Packing disks into disks with optimal worst-case density

DOI10.1007/S00454-022-00422-8MaRDI QIDQ2679596OpenAlexWikidataFDO

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

zbMATH Keywords

approximationpacking densityinterval arithmeticNP-hardnessdisk packingtight worst-case bound

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 7559235 (Why is no real title available?)
• A Finite Packing Problem
• A bounded space algorithm for online circle packing
• A literature review on circle and sphere packing problems: models and methodologies
• An improved algorithm for the packing of unequal circles within a larger containing circle
• Curved hexagonal packings of equal disks in a circle
• Dense Packing of Equal Circles within a Circle
• Dense packings of congruent circles in a circle
• Densest packings of eleven congruent circles in a circle
• Disk packing for the estimation of the size of a wire bundle
• Integrated container loading software for pulp and paper industry
• New approaches to circle packing in a square. With program codes.
• Packing Cylinders into Cylindrical Containers
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Packing of 14, 16, 17 and 20 Circles in a Circle
• Polynomial-time approximation schemes for circle packing problems
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Some packing and covering theorems
• Split packing: algorithms for packing circles with optimal worst-case density
• Split packing: an algorithm for packing circles with optimal worst-case density
• The densest packing of 12 congruent circles in a circle
• The densest packing of 13 congruent circles in a circle
• The densest packing of 19 congruent circles in a circle

Cited in

(12)

• Disk packing for the estimation of the size of a wire bundle
• Split packing: algorithms for packing circles with optimal worst-case density
• Packing a tetrahedron by similar tetrahedra
• (Re)packing equal disks into rectangle
• Packing disks by flipping and flowing
• Split packing: packing circles into triangles with optimal worst-case density
• On-line packing and covering a disk with disks
• A density result for random packings of unit disks
• Split packing: an algorithm for packing circles with optimal worst-case density
• A constraint on the random packing of disks
• Worst-case optimal squares packing into disks
• A short note on a simple search heuristic for the diskspacking problem

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)