多约束的平面点集形状重构方法  

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

作　　者：朱杰[1,2] 孙毅中[1,2] 

机构地区：[1]南京师范大学虚拟地理环境教育部重点实验室,江苏南京210023 [2]江苏省地理信息资源开发与利用协同创新中心,江苏南京210023

出　　处：《测绘学报》2017年第2期253-264,共12页Acta Geodaetica et Cartographica Sinica

基　　金：国家自然科学基金(41671392);公安部科技强警基础工作专项(2015GABJC39)~~

摘　　要：针对平面点集空间分布的复杂性,本文提出了一种基于Delaunay三角网的平面点集形状重构方法。首先采用一种简单且实用的数据结构以表达Delaunay三角网中嵌入的几何信息和拓扑信息,然后由外向内迭代过滤Delaunay三角网得到一个大概边界,最后进一步考虑边界的凹凸信息和空洞现象,获取最终的精细边界。试验结果表明与其他典型的Delaunay三角网重构方法相比,本文提出的算法能更好地适用于平面点集空间分布的复杂性,通过所构建的数学模型实现了凸凹多边形内外边界提取。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.

关 键 词：平面点集 形状重构 DELAUNAY三角网 多约束 GIS 

分 类 号：P208[天文地球—地图制图学与地理信息工程]