Time-and space-optimal contour computation for a set of rectangles (Q1108000)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4066326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-and space-optimal contour computation for a set of rectangles |
scientific article; zbMATH DE number 4066326 |
Statements
Time-and space-optimal contour computation for a set of rectangles (English)
0 references
1987
0 references
We present the first time- and space-optimal algorithm for the problem of computing the contours of the disjoint polygons defined by the union of n rectangles in the plane. It requires O(n log n\(+e)\) time and O(n) space, where e is the total number of edges in the contour cycles. The space optimality of the solution is demonstrated by way of a combinatorial argument.
0 references
optimal contour computation
0 references
computational geometry
0 references
0.91680246591568
0 references
0.9116966724395752
0 references
0.8133637309074402
0 references
