Online circle and sphere packing
DOI10.1016/j.tcs.2019.01.004zbMath1422.68323arXiv1708.08906OpenAlexW2963979458WikidataQ128627206 ScholiaQ128627206MaRDI QIDQ2419121
Carla Negri Lintzmayer, Flávio K. Miyazawa, Eduardo Candido Xavier
Publication date: 29 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.08906
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Polynomial-time approximation schemes for circle and other packing problems
- A literature review on circle and sphere packing problems: models and methodologies
- A note on online hypercube packing
- New approaches to circle packing in a square. With program codes.
- Two-dimensional online bin packing with rotation
- Packing unit squares in squares: A survey and new results
- On limits of dense packing of equal spheres in a cube
- Approximation and online algorithms for multidimensional bin packing: a survey
- This side up!
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- A bounded space algorithm for online circle packing
This page was built for publication: Online circle and sphere packing
