Split packing: an algorithm for packing circles with optimal worst-case density

DOI10.1137/1.9781611974782.7zbMATH Open1410.68375OpenAlexW4251859436MaRDI QIDQ4575741FDOQ4575741

Authors: 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

Recommendations

• Split packing: algorithms for packing circles with optimal worst-case density
• Split packing: packing circles into triangles with optimal worst-case density
• Worst-case optimal squares packing into disks
• Packing disks into disks with optimal worst-case density
• Polynomial-time approximation schemes for circle and other packing problems

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Split packing: algorithms for packing circles with optimal worst-case density
• An approximate method for circle packing and disc covering
• Split packing: packing circles into triangles with optimal worst-case density
• Worst-case optimal covering of rectangles by disks
• Split Packing
• (Re)packing equal disks into rectangle
• Packing disks into disks with optimal worst-case density
• Worst-case optimal squares packing into disks
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)

This page was built for publication: Split packing: an algorithm for packing circles with optimal worst-case density

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