MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
Horst Martini, Valeriu Soltan · International Journal of Computational Geometry & Applications · 1999
Let [Formula: see text] be a given nonempty family of directions in the plane. For a multiply connected polygonal domain P with polygonal holes, possibly degenerate, we determine the minimum number of convex polygons into which P is partitioned by linear cuts in the directions from [Formula: see text].