An Automated Processing Method for Agglomeration Areas

Agglomeration operations are a core component of the automated generalization of aggregated area groups. However, because geographical elements that possess agglomeration features are relatively scarce, the current literature has not given sufficient attention to agglomeration operations. Furthermore, most reports on the subject are limited to the general conceptual level. Consequently, current agglomeration methods are highly reliant on subjective determinations and cannot support intelligent computer processing. This paper proposes an automated processing method for agglomeration areas. Firstly, the proposed method automatically identifies agglomeration areas based on the width of the striped bridging area, distribution pattern index (DPI), shape similarity index (SSI), and overlap index (OI). Next, the progressive agglomeration operation is carried out, including the computation of the external boundary outlines and the extraction of agglomeration lines. The effectiveness and rationality of the proposed method has been validated by using actual census data of Chinese geographical conditions in the Jiangsu Province.

[1]  Zhilin Li.  Algorithmic Foundation of Multi-Scale Spatial Representation , 2006 .

[2]  Wenhao Yu,et al.  Assessing the implications of the recent community opening policy on the street centrality in China: A GIS-based method and case study , 2017 .

[3]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[4]  Jiawei Han,et al.  Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining , 1999, SSD.

[5]  H. Zhen-hui.  An Algorithm for Computing the Minimum Area Bounding Rectangle of an Arbitrary Polygon , 2008 .

[6]  Zhilin Li,et al.  Toward Quantitative Measures for the Semantic Quality of Polygon Generalization , 2006, Cartogr. Int. J. Geogr. Inf. Geovisualization.

[7]  Peter van Oosterom,et al.  Construction of the Planar Partition Postal Code Map Based on Cadastral Registration , 2005, GeoInformatica.

[8]  Hong Yan,et al.  Skeletonization of ribbon-like shapes based on regularity and singularity analyses , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Christopher B. Jones,et al.  A Triangulated Spatial Model for Cartographic Generalisation of Areal Objects , 1995, COSIT.

[10]  Tiow Seng Tan,et al.  Triangulations from topologically correct digital Voronoi diagrams , 2015, Comput. Geom..

[11]  Jan-Henrik Haunert,et al.  Area Collapse and Road Centerlines based on Straight Skeletons , 2008, GeoInformatica.

[12]  THANH-TUNG CAO,et al.  PROOF OF CORRECTNESS OF THE DIGITAL DELAUNAY TRIANGULATION , 2010 .

[13]  N. Regnauld.  ALGORITHMS FOR THE AMALGAMATION OF TOPOGRAPHIC DATA , 2003 .

[14]  Alexander Wolff,et al.  Area aggregation in map generalisation by mixed-integer programming , 2010, Int. J. Geogr. Inf. Sci..

[15]  Ju Jia Zou,et al.  Triangle refinement in a constrained Delaunay triangulation skeleton , 2007, Pattern Recognit..

[16]  Andrés Serna,et al.  Detection, segmentation and classification of 3D urban objects using mathematical morphology and supervised learning , 2014 .

[17]  A. Ruas.  MULTIPLE PARADIGMS FOR AUTOMATING MAP GENERALIZATION : GEOMETRY , TOPOLOGY , HIERARCHICAL PARTIONING AND LOCAL TRIANGULATION , 2008 .