The reactive-tree: a storage structure for a seamless, scaleless geographic database
conference paper
This paper presents the first fully dynamic and reactive data structure. Reactive data structures are vector based structures tailored to the efficient storage and retrieval of geometric objects at different levels of detail. Geometric selections can be interleaved by insertions of new objects and by deletions of existing objects. 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. -from Author
TNO Identifier
231665
Publisher
ACSM/ASPRS
Source title
Proceedings Tenth International Symposium on Computer-Assisted Cartography, AUTO-CARTO 10, 25-28 March 1991, Baltimore, Md, USA
Place of publication
Falls Church, VA
Pages
393-407