On convex partitions of polygonal regions
From MaRDI portal
Publication:1296981
DOI10.1016/S0012-365X(98)00125-3zbMath0954.52023MaRDI QIDQ1296981
Publication date: 3 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (2)
MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN ⋮ The geometry of Minkowski spaces -- a survey. II.
Cites Work
- On the minimality of polygon triangulation
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- Minimum convex partition of a polygon with holes by cuts in given directions
- Minimum convex partition of polygonal domains by guillotine cuts
- Excursions into combinatorial geometry
- A Generalization of a Theorem of Tietze and Nakajima on Local Convexity
- Partition of a plane set into a finite number of d-convex parts
- Minimal rectangular partitions of digitized blobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On convex partitions of polygonal regions