A bounded space algorithm for online circle packing

DOI10.1016/J.IPL.2015.12.007zbMath1352.68289OpenAlexW2209399941MaRDI QIDQ5964819

Rafael C. S. Schouery, Flávio K. Miyazawa, Pedro Hokama

Publication date: 1 March 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.12.007

zbMATH Keywords

circle packingonline algorithmscomputational geometryworst-case analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Online circle and sphere packing ⋮ Packing disks into disks with optimal worst-case density ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Unnamed Item ⋮ Techniques and results on approximation algorithms for packing circles

Cites Work

• Unnamed Item
• A literature review on circle and sphere packing problems: models and methodologies
• New approaches to circle packing in a square. With program codes.
• Two-dimensional online bin packing with rotation
• Bounds for online bounded space hypercube packing
• Polynomial-Time Approximation Schemes for Circle Packing Problems
• Optimal Online Algorithms for Multidimensional Packing Problems

This page was built for publication: A bounded space algorithm for online circle packing