Packing disks into disks with optimal worst-case density
DOI10.1007/S00454-022-00422-8OpenAlexW2950870475WikidataQ114229289 ScholiaQ114229289MaRDI QIDQ2679596FDOQ2679596
Authors: 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
Recommendations
- Packing disks into disks with optimal worst-case density
- Worst-case optimal squares packing into disks
- On the densest packing of convex discs
- A method for finding the densest lattice k-fold packing of disks
- Disk packing in a square: a new global optimization approach
- A constraint on the random packing of disks
- Improving dense packings of equal disks in a square
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- A heuristic quasi-physical strategy for solving disks packing problem
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)
Cites Work
- Split packing: an algorithm for packing circles with optimal worst-case density
- Disk packing for the estimation of the size of a wire bundle
- New approaches to circle packing in a square. With program codes.
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A literature review on circle and sphere packing problems: models and methodologies
- Solving circle packing problems by global optimization: numerical results and industrial applications
- 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
- Packing Cylinders into Cylindrical Containers
- The densest packing of 19 congruent circles in a circle
- Densest packings of eleven 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
- Title not available (Why is that?)
- Some packing and covering theorems
- A Finite Packing Problem
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- Title not available (Why is that?)
- Packing of 14, 16, 17 and 20 Circles in a Circle
- Dense Packing of Equal Circles within a Circle
- Split packing: algorithms for packing circles with optimal worst-case density
- Polynomial-time approximation schemes for circle packing problems
- A bounded space algorithm for online circle packing
Cited In (12)
- A constraint on the random packing of disks
- Split packing: algorithms for packing circles with optimal worst-case density
- On-line packing and covering a disk with disks
- Split packing: packing circles into triangles with optimal worst-case density
- A density result for random packings of unit disks
- Packing a tetrahedron by similar tetrahedra
- Packing disks by flipping and flowing
- Disk packing for the estimation of the size of a wire bundle
- (Re)packing equal disks into rectangle
- A short note on a simple search heuristic for the diskspacking problem
- Worst-case optimal squares packing into disks
- Split packing: an algorithm for packing circles with optimal worst-case density
This page was built for publication: Packing disks into disks with optimal worst-case density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679596)
