Minimum convex partition of polygonal domains by guillotine cuts
From MaRDI portal
Publication:1380781
DOI10.1007/PL00009346zbMath0901.52014MaRDI QIDQ1380781
Publication date: 11 March 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
Related Items
MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN, Polygons cuttable by a circular saw, On convex partitions of polygonal regions, Dissections of polygons into triangles of equal areas