A bounded space algorithm for online circle packing

DOI10.1016/J.IPL.2015.12.007MaRDI QIDQ5964819zbMATH OpenOpenAlexFDO

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

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

online algorithmscomputational geometryworst-case analysiscircle packing

Mathematics Subject Classification ID

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

Recommendations

• Online circle and sphere packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• scientific article; zbMATH DE number 1134660

Cites work

• A literature review on circle and sphere packing problems: models and methodologies
• Bounds for online bounded space hypercube packing
• Handbook of constraint programming.
• New approaches to circle packing in a square. With program codes.
• Optimal Online Algorithms for Multidimensional Packing Problems
• Polynomial-time approximation schemes for circle packing problems
• Two-dimensional online bin packing with rotation

Cited in

(7)

• scientific article; zbMATH DE number 7559235 (Why is no real title available?)
• Split packing: algorithms for packing circles with optimal worst-case density
• Packing disks into disks with optimal worst-case density
• Efficient approximations for the online dispersion problem
• Techniques and results on approximation algorithms for packing circles
• Online circle and sphere packing
• An efficient solution space exploring and descent method for packing equal spheres in a sphere

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964819)