Acta Geodaetica et Cartographica Sinica ›› 2017, Vol. 46 ›› Issue (2): 253-264.doi: 10.11947/j.AGCS.2017.20160122

Previous Articles     Next Articles

An Efficient Approach to Shape Reconstruction from Planar Point Set Based on Multi-constraints

ZHU Jie1,2, SUN Yizhong1,2   

  1. 1. Key Laboratory of Virtual Geographic Environment of Ministry of Education, Nanjing Normal University, Nanjing 210023, China;
    2. Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application, Nanjing 210023, China
  • Received:2016-03-30 Revised:2016-10-27 Online:2017-02-20 Published:2017-03-07
  • Contact: 孙毅中 E-mail:sunyizhong_cz@163.com
  • Supported by:
    The National Natural Science Foundation of China (No.41671392),Special Program for basic research of Sci-tech Police of Ministry of Public Security (No.2015GABJC39)

Abstract: An efficient algorithm to boundary representation from a planar point set in order to adapt the complexity of spatial distribution was presented in this paper. At first, an appropriate and practical data structure was designed to express geometric information and topological information, which provides an easy access to links embedded in DT serving as a basis for the filtering procedures; then the algorithm generates rough boundary based on an iterative removal of Delaunay triangulation. Furthermore, a mathematic formulation for cavities and holes was given and a statistical method to detect them was designed. Finally, a series of experiments including both simulated and real data sets to validate the effectiveness and practicability of our algorithm was conducted.

Key words: planar point set, shape reconstruction, Delaunay triangulation, multi-constraints, GIS

CLC Number: