Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Samet et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: