Counting Blanks in Polygonal Arrangements

DOI10.1137/16M110407XzbMath1397.52009arXiv1604.00960OpenAlexW2787428120WikidataQ129285814 ScholiaQ129285814MaRDI QIDQ4585744

Erel Segal-Halevi, Arseniy V. Akopyan

Publication date: 7 September 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.00960

zbMATH Keywords

packing and coveringcake-cuttingrectilinear polygonsconvex objectsredivision

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Covering convex sets with non-overlapping polygons
• On the perimeter of \(k\) pairwise disjoint convex bodies contained in a convex set in the plane
• Graph-Theoretic Solutions to Computational Geometry Problems

This page was built for publication: Counting Blanks in Polygonal Arrangements