Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles |
scientific article; zbMATH DE number 78493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles |
scientific article; zbMATH DE number 78493 |
Statements
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (English)
0 references
14 December 1992
0 references
The authors give a formula for a minimum number of dissecting rectangles for a given rectangular polygon with arbitrary (possibly, degenerate) holes. They also give a polynomial time algorithm for dissecting the polygon in a minimum number of rectangles. The holes can degenerate into points. This fact disproves an assertion about the \(NP\)-hardness of this problem.
0 references
rectilinear polygons
0 references
rectangles
0 references
holes
0 references
0.810317873954773
0 references
0.809089183807373
0 references
0.8085856437683105
0 references
0.7975475192070007
0 references
