Packing disks into disks with optimal worst-case density
From MaRDI portal
Publication:2679596
DOI10.1007/s00454-022-00422-8OpenAlexW2950870475WikidataQ114229289 ScholiaQ114229289MaRDI QIDQ2679596
Sándor P. Fekete, Phillip Keldenich, Christian Scheffer
Publication date: 23 January 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-022-00422-8
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40) Circle packings and discrete conformal geometry (52C26)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A literature review on circle and sphere packing problems: models and methodologies
- New approaches to circle packing in a square. With program codes.
- Solving circle packing problems by global optimization: numerical results and industrial applications
- The densest packing of 19 congruent circles in a circle
- Densest packings of eleven congruent circles in a circle
- Integrated container loading software for pulp and paper industry
- Curved hexagonal packings of equal disks in a circle
- Dense packings of congruent circles in a circle
- The densest packing of 13 congruent circles in a circle
- The densest packing of 12 congruent circles in a circle
- Split packing: algorithms for packing circles with optimal worst-case density
- Disk packing for the estimation of the size of a wire bundle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Polynomial-Time Approximation Schemes for Circle Packing Problems
- A Finite Packing Problem
- Dense Packing of Equal Circles within a Circle
- Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- Some packing and covering theorems
- Packing Cylinders into Cylindrical Containers
- Packing of 14, 16, 17 and 20 Circles in a Circle
- A bounded space algorithm for online circle packing
