Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density

DOI10.1137/1.9781611974782.7zbMath1410.68375OpenAlexW4251859436MaRDI QIDQ4575741

Sebastian Morr

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.7

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Packing disks into disks with optimal worst-case density ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Unnamed Item ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Split Packing

This page was built for publication: Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density