Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
From MaRDI portal
Publication:5572083
Cited in
(13)- Packing, covering and tiling in two-dimensional spaces
- Reformulation descent applied to circle packing problems
- Dense packings of congruent circles in a circle
- Global optimization method for finding dense packings of equal circles in a circle
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Optimal cover of a disk with three smaller congruent disks
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
- Packing 16, 17 or 18 circles in an equilateral triangle
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Densest packings of eleven congruent circles in a circle
- Optimal packings of eleven equal circles in an equilateral triangle
- Reconstruction using witness complexes
This page was built for publication: Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572083)