Dense packing of congruent circles in free-form non-convex containers
DOI10.1016/j.cagd.2017.03.006zbMath1366.65042OpenAlexW2601374418WikidataQ114202349 ScholiaQ114202349MaRDI QIDQ2357688
Jinesh Machchhar, Gershon Elber
Publication date: 14 June 2017
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2017.03.006
Numerical computation using splines (65D07) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A literature review on circle and sphere packing problems: models and methodologies
- A heuristic for the circle packing problem with a variety of containers
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- Dense packings of congruent circles in a circle
- Reformulation descent applied to circle packing problems
- A simulated annealing approach for the circular cutting problem
- Minimizing the object dimensions in circle and sphere packing problems
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- Algorithms for congruent sphere packing and applications
- Packing Cylinders into Cylindrical Containers
This page was built for publication: Dense packing of congruent circles in free-form non-convex containers
