一种基于扫描点的平面散乱点云边界的提取算法

A Kind of Algorithm for Distill Edge from Planar Points in Disorder Based on Scan Code

根据平面散乱点云的特点,依据边界点和非边界点的位置关系,用网格把点云划分开来,在确定边界网格和非边界网格以后,将所有的边界网格按照它们的位置关系连接成环,对于从每一个边界网格提取边界提出了一种最小凸边算法,并且从理论和实验上证明了这种最小凸边算法的可行性。

According to the characteristic of large number of planar points in disorder in this paper,according to the place relation between edge points and no edge points,we divide all points into parts in gridding,after distinguish edge griddings from no edge griddings,we link all edge griddings into a ring according to their place relationship,and bring forward a new kind of the least chimb algorithm in which we can distill borderline from every edge gridding,afterward we prove that this algorithm is feasible in theory and experiment.