Issue No. 03 - March (1984 vol. 6)
Robert E. Webber , Department of Computer Science and the Center for Automation Research, University of Maryland, College Park, MD 20742; Department of Computer Science, Rutgers University, New Bruns
Hanan Samet , Department of Computer Science and the Center for Automation Research, University of Maryland, College Park, MD 20742.
The ``line quadtree'' data structure hierarchically represents a region and its boundary. Based on the standard quadtree, each node in this structure stores adjacency information as well. While line quadtrees use the same amount of space as standard qaudtrees, they facilitate several region processing algorithms. In particular, we describe efficient algorithms for boundary and superimposing two maps encoded as line quadtrees.
Robert E. Webber, Hanan Samet, "On Encoding Boundaries with Quadtrees", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 6, no. , pp. 365-369, March 1984, doi:10.1109/TPAMI.1984.4767529