Abstract
The Generalized Area Partitioning tree (GAP-tree) is a model that supports on-the-fly generalisation of planar partitions of polygon objects. This paper focuses on solving some limitations of the existing GAP-tree and explores two extensions. The first extension enables the handling of a disjoint polygonal cluster (within the partition) and allows aggregation operations to be performed. The skeleton partitioning model, which is based on the constrained Delaunay triangulation for the polygonal cluster, is used to define the bridge areas between aggregated polygons. The second extension involves the improvement of removing insignificant objects by separating them into parts around the adjusted skeleton and assigning these parts to different neighbours. The adjusted skeleton is defined by the compatibility between the removed object and its neighbours, which considers not only topological relationships but also importance and semantic similarity. This process again uses the Delaunay triangulation. The algorithm is given to construct the extended GAP-tree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ai T, Guo R, Liu Y (2000) A Binary Tree Representation of Bend Hierarchical Structure Based on Gestalt Principles. In: Forer P, Yeh AGO, He J (eds) Proceedings of the 9th International Symposium on Spatial Data Handling, Beijing, pp 2a30–2a43
Ai T, Guo R (2000) A Constrained Delaunay Partitioning of Areal Objects to Support Map Generalization. Journal of Wuhan Technical University of Surveying and Mapping 25(1):35–41 (in Chinese)
Bader M, Weibel R (1997) Detecting and Resolving Size and Proximity Conflicts in the Generalization of Polygonal Maps. In: Ottoson L (eds) Proceedings of the 18th International Cartographic Conference. Stockholm, pp 1525–1532
Hernandez D, Clementini E (1995) Qualitative Distance. In: Proceedings of COSIT’95, Semmering, Austria, pp 45–57
Jones CB, Bundy GL, Ware JM (1995) Map Generalization with a Triangulated Data Structure. Cartography and Geographic Information System 22(4): 317–331
Oosterom P Van (1995) The GAP-tree, An Approach to On-the-Fly Map Generalization of An Area Partitioning. In: Muller J C, Lagrange J P, Weibel R (eds) GIS and Generalization: Methodology and Practice. Taylor & Francis, London, pp 120–13
Oosterom P Van (1994) Reactive Data Structure for Geographic Information Systems. Oxford University Press, Oxford
Oosterom P Van (1991) The Reactive-Tree: A Storage Structure for a Seamless, Scaleless Geographic Database. In: Auto-Carto 10, pp 393–407
Poorten P, Jones C B (1999) Customisable Line Generalization Using Delaunay Triangulation, CD-Rom Proceedings of the 19th ICC, Ottawa, Section 8
Preparata FP, Shamos MI (1985) Computational Geometry An Introduction. Springers-Verlag
Putten J Van, Oosterom P Van (1998) New Results with Generalized Area Partitionings. In: Proceedings of Spatial Data Handling, Ottawa, Canada
Ware JM, Jones CB (1995) A Triangulated Spatial Model for Cartographic Generalization of Areal Objects. In: Proceedings COSIT’95. Semmering, Austria, pp 173–192
Ware JM, Jones CB (1997) A Spatial Model for Detecting (and Resolving) Conflict Caused by Scale Reduction. In: Kraak MJ, and Molenaar M (eds) In: Advance in GIS Research II (7th Int. Symposium on Spatial Data handling), Springer-Verlag
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ai, T., van Oosterom, P. (2002). GAP-Tree Extensions Based on Skeletons. In: Richardson, D.E., van Oosterom, P. (eds) Advances in Spatial Data Handling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56094-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-56094-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62859-7
Online ISBN: 978-3-642-56094-1
eBook Packages: Springer Book Archive