Minimum number of pieces in a convex partition of a polygonal domain

Authors
Martini, H
Citation
H. Martini, Minimum number of pieces in a convex partition of a polygonal domain, INT J C GEO, 9(6), 1999, pp. 599-614
Citations number
26
Categorie Soggetti
Engineering Mathematics
Journal title
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
ISSN journal
02181959 → ACNP
Volume
9
Issue
6
Year of publication
1999
Pages
599 - 614
Database
ISI
SICI code
0218-1959(199912)9:6<599:MNOPIA>2.0.ZU;2-H
Abstract
Let F 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 partitione d by linear cuts in the directions from F.