基于约束Delaunay三角网的线、面群目标分布边界计算

Computation of the boundaries of linear/polygonal groups based on constrained delaunay triangulation

群组目标的分布边界在空间方向关系判断、相似度计算以及地图自动综合等领域有着重要的应用,但目前的分布边界计算主要是针对空间点群目标,鲜有涉及空间线、面群目标。在约束Delaunay三角网的基础上,利用动态阈值"剥皮"法实现线、面群目标的分布边界计算。方法得到的分布边界多边形符合人们的空间认知习惯,能够较好地描述线、面群目标的空间形态和分布范围。

The boundary of object group has been used in many fields such as judgement of spatial direction relationships ,calculation of spatial similarity and automated map generalization .However ,at present ,the computation of the boundary of object group mainly aims at point group ,rarely involving linear/polygonal group .A method of “stripping” with dynamic threshold is proposed to realize the computation of the boundary of linear/polygonal group based on constrained delaunay triangulation .The boundary‐polygon obtained by the algorithm can describe the spatial shape and distribution range of linear/polygon group well ,meeting people’s habits of spatial cognition .