Topologically-consistent map generalisation procedures and multi-scale spatial databases

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 re-sampling technique and the provision of control over single and double-sided application of pruning. Experimental results of the use of the techniques are presented.

Cite

CITATION STYLE

APA

van der Poorten, P. M., Zhou, S., & Jones, C. B. (2002). Topologically-consistent map generalisation procedures and multi-scale spatial databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2478, pp. 209–227). Springer Verlag. https://doi.org/10.1007/3-540-45799-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free