Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:43, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles |
scientific article |
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
