Cited in
(16)- Split packing: algorithms for packing circles with optimal worst-case density
- Variations and extension of the convex-concave procedure
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Optimized ellipse packings in regular polygons
- Iterated dynamic thresholding search for packing equal circles into a circular container
- VRONI
- Packmol
- BetaSCPWeb
- CAVER
- BetaVoid
- BetaConcept
- Split Packing
- QTFier
- An action-space-based global optimization algorithm for packing circles into a square container
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- High density packings of equal circles in rectangles with variable aspect ratio
This page was built for software: packomania
