Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Valeriu Soltan / rank | |||
Property / author | |||
Property / author: Valeriu Soltan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal rectangular partitions of digitized blobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5203690 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Algorithms for Geometric Graph Search Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4165403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948588 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3893361 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a manhattan path and related problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:48, 16 May 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