期刊名称：ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN：2194-9042
电子版ISSN：2194-9050
出版年度：2002
卷号：XXXIV Part 4
出版社：Copernicus Publications
摘要：The Generalized Area Partitioning tree (GAP-tree) is a model that supports on- the-fly generalisatio n 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 extensio n involves the improvement o f 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 imp ortance and semantic similarity. This process again uses the Delaunay triangulation. The algorithm is given to construct the extended GAP-tree
关键词：on-the-fly generalisation; spatial partitioning; and neighbourhood ; analysis; GAP-tree
