Minimum partition of polygons under width and cut constraints

DOI10.4230/LIPICS.ISAAC.2025.22MaRDI QIDQ7364362zbMATH OpenFDO

Authors Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.22

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Problem About Lines and Ovals
• A Solution of the "Plank Problem"
• Bang's problem and symplectic invariants
• Computing optimal diameter-bounded polygon partitions
• Conway's fried potato problem revisited
• Exact and approximation algorithms for computing optimal fat decompositions
• Hardness of packing, covering and partitioning simple polygons with unit squares
• Kadets-type theorems for partitions of a convex body
• Plank theorems via successive inradii
• Relative width measures and the plank problem
• Some Special Cases of Bang's Inequality
• The plank problem for symmetric bodies
• The structure of optimal partitions of orthogonal polygons into fat rectangles

This page was built for publication: Minimum partition of polygons under width and cut constraints

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