Minimum convex partition of polygonal domains by guillotine cuts

DOI10.1007/PL00009346MaRDI QIDQ1380781zbMATH OpenOpenAlexFDO

Authors Horst Martini, Valeriu Soltan

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)

Recommendations

• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Minimum convex partition of a polygon with holes by cuts in given directions
• Minimum convex partition of a polygon with holes by cuts in given directions
• scientific article; zbMATH DE number 4065050
• A polynomial algorithm for one problem of guillotine cutting

Cited in

(8)

• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Dissections of polygons into triangles of equal areas
• Minimum convex partitions of multidimensional polyhedrons
• Minimum convex partition of a polygon with holes by cuts in given directions
• The number of guillotine partitions in \(d\) dimensions
• scientific article; zbMATH DE number 1979490 (Why is no real title available?)
• On convex partitions of polygonal regions
• Polygons cuttable by a circular saw

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

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