Packing disks into disks with optimal worst-case density
From MaRDI portal
Publication:5088965
DOI10.4230/LIPICS.SOCG.2019.35MaRDI QIDQ5088965FDOQ5088965
Authors: Sándor P. Fekete, Phillip Keldenich, Christian Scheffer 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.07908
Recommendations
- Packing disks into disks with optimal worst-case density
- Worst-case optimal squares packing into disks
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- Split packing: an algorithm for packing circles with optimal worst-case density
- Split packing: algorithms for packing circles with optimal worst-case density
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.
- New classes of fast lower bounds for bin packing problems
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- 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 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 (11)
- Density of binary disc packings: the nine compact packings
- A constraint on the random packing of disks
- Away from each other
- Worst-case optimal covering of rectangles by disks
- Packing disks by flipping and flowing
- Disk packing for the estimation of the size of a wire bundle
- (Re)packing equal disks into rectangle
- Packing disks into disks with optimal worst-case density
- A short note on a simple search heuristic for the diskspacking problem
- Techniques and results on approximation algorithms for packing circles
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
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 Q5088965)
