scientific article; zbMATH DE number 7559235
From MaRDI portal
Publication:5088965
DOI10.4230/LIPIcs.SoCG.2019.35MaRDI QIDQ5088965
Phillip Keldenich, Sándor P. Fekete, Christian Scheffer
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1903.07908
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Packing disks into disks with optimal worst-case density ⋮ Away from each other ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Density of binary disc packings: the nine compact packings
Cites Work
- Unnamed Item
- A literature review on circle and sphere packing problems: models and methodologies
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- 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
- Some packing and covering theorems
- Packing Cylinders into Cylindrical Containers
- Packing of 14, 16, 17 and 20 Circles in a Circle
- New classes of fast lower bounds for bin packing problems
- A bounded space algorithm for online circle packing
This page was built for publication:
