Efficient structures for geometric data management
Efficient structures for geometric data management
Spatial priority search: an access technique for scaleless maps
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Reactive data structures for geographic information systems
Reactive data structures for geographic information systems
Progressive vector transmission
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Strip trees: a hierarchical representation for curves
Communications of the ACM
Design and Implementation of Multi-scale Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Ontology-driven map generalization
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
An important requirement of multi-scale spatial databases is that topological consistency is maintained both within individual features and between co-displayed features for all scales at which they may be retrieved. Here we show how a triangulation-based branch-pruning generalisation procedure can be enhanced to enable its output to be used to build topologically-consistent multi-scale data structures. A major limitation of existing branch-pruning methods, of the lack of vertex filtering, is overcome by the application of a topologically consistent, vertex priority labelling procedure. The branch pruning generalisation method is also improved by the introduction of an edge resampling technique and the provision of control over single and double-sided application of pruning. Experimental results of the use of the techniques are presented.