The reactive-tree: A storage structure for a seamless, scaleless geographic database
Peter J. M. van Oosterom · 1991
This paper presents the first fully dynamic and reactive data structure. Reac tive data structures are vector based structures tailored to the efficient storage and retrieval of geometric objects at different levels of detail. Geometric se lections can be interleaved by insertions of new objects and by deletions of existing objects. Detail levels are closely related to cartographic map general ization techniques. The proposed data structure supports the following gener alization techniques: simplification, aggregation, symbolization, and selection. The core of the reactive data structure is the Reactive-tree, a geometric index structure, that also takes care of the selection-part of the generalization. Other aspects of the generalization process are supported by introducing associated structures, e.g. the Binary Line Generalization-tree for simplification. The proposed structure forms an important step in the direction of the develop ment of a seamless, scaleless geographic database. 1