Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees

M. B. Dillencourt, H. Samet
1996 Algorithmica  
A variant of the plane-sweep paradigm known as topological sweep is adapted to solve geometric problems involving two-dimensional regions when the underlying representation is a region quadtree. The utility of this technique is illustrated by showing how it can be used to extract the boundaries of a map in O(M) space and O(Mα(M)) time, where M is the number of quadtree blocks in the map, and α(·) is the (extremely slowly growing) inverse of Ackerman's function. The algorithm works for maps that
more » ... contain multiple regions as well as holes. The algorithm makes use of active objects (in the form of regions) and an active border. It keeps track of the current position in the active border so that at each step no search is necessary. The algorithm represents a considerable improvement over a previous approach whose worst-case execution time is proportional to the product of the number of blocks in the map and the resolution of the quadtree (i.e., the maximum level of decomposition). The algorithm works for many different quadtree representations including those where the quadtree is stored in external storage.
doi:10.1007/bf01942608 fatcat:52ejo35uprabrhvxxeus2ojfkm