Minimum convex partition of polygonal domains by guillotine cuts

DOI10.1007/PL00009346zbMath0901.52014OpenAlexW2061049203MaRDI QIDQ1380781

Valeriu Soltan, Horst Martini

Publication date: 11 March 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009346

zbMATH Keywords

polygonsguillotine cutsdissection

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Related Items (4)

Dissections of polygons into triangles of equal areas ⋮ MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN ⋮ Polygons cuttable by a circular saw ⋮ On convex partitions of polygonal regions

This page was built for publication: Minimum convex partition of polygonal domains by guillotine cuts