MINIMUM CONVEX PARTITION OF POLYGONAL DOMAINS BY GUILLOTINE CUTS

Authors
MARTINI H SOLTAN V
Citation
H. Martini et V. Soltan, MINIMUM CONVEX PARTITION OF POLYGONAL DOMAINS BY GUILLOTINE CUTS, Discrete & computational geometry, 19(2), 1998, pp. 291-304
Citations number
20
Categorie Soggetti
Computer Science Theory & Methods",Mathematics,"Computer Science Theory & Methods",Mathematics
Journal title
Discrete & computational geometry → ACNP
ISSN journal
01795376
Volume
19
Issue
2
Year of publication
1998
Pages
291 - 304
Database
ISI
SICI code
0179-5376(1998)19:2<291:MCPOPD>2.0.ZU;2-T
Abstract
Let P be a multiply connected polygonal domain with holes (possibly de generate) and let F be a certain family of directions in the plane. We give a formula for the minimum number of convex pieces in which P is partitioned with the help of guillotine cuts along the directions of F .