An Optimal Contour Algorithm for Iso-Oriented Rectangles


Given a set of n iso-oriented rectangles in 2-space we describe an algorithm which determines the contour of their union in O(nlog n + p) time and O(n + p) space, where p is the number of edges in the contour. This performance is time-optimal. The space requirements are the same as in the best previously known algorithm. We achieve this by introducing a new… (More)
DOI: 10.1016/0196-6774(84)90013-0


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics