Acta Geodaetica et Cartographica Sinica ›› 2016, Vol. 45 ›› Issue (10): 1250-1259.doi: 10.11947/j.AGCS.2016.20150491

Previous Articles     Next Articles

Position Clustering for Polygon Object under Dual-constrains

YU Li, GAN Shu, YUAN Xiping, LI Jiatian   

  1. Faculty of Land Resource Engineering, Kunming University of Science and Technology, Kunming 650093, China
  • Received:2015-09-23 Revised:2016-07-08 Online:2016-10-20 Published:2016-11-08
  • Supported by:

    The National Natural Science Foundation of China(Nos.41561083;41261092;41561082);The Natural Science Foundation of Yunnan Province(No.2015FA016)

Abstract:

It is a vital research direction for spatial clustering to recognize polygon cluster, but due to the dual-constrains by geometric information of polygons and obstacles, the position similarity of polygon is difficult to calculate accurately and quickly.A polygon clustering algorithm under dual-constrains is proposed by extending the algorithm of multi-scale spatial clustering, and constructing an intensity function to express position aggregation between object and its adjacent object. For further discuss, it takes the same thresholds of intensity function in adjacent scales as convergence condition. Simulated polygons and real data are chosen to perform clustering in experiments to verify the validity of our algorithm. Results show that without predefined parameters, this algorithm can identify variety polygon clusters with different densities, arbitrary shape, bridge and obstacle.

Key words: polygon, position clustering, Voronoi diagram, spatial obstacle, assessment index

CLC Number: