首页 | 官方网站   微博 | 高级检索  
     

一种基于扫描点的平面散乱点云边界的提取算法
引用本文:周石林,王琪,廖文和.一种基于扫描点的平面散乱点云边界的提取算法[J].计算机工程与应用,2004,40(9):80-82.
作者姓名:周石林  王琪  廖文和
作者单位:南京航空航天大学机电工程学院,南京,210016
摘    要:根据平面散乱点云的特点,依据边界点和非边界点的位置关系,用网格把点云划分开来,在确定边界网格和非边界网格以后,将所有的边界网格按照它们的位置关系连接成环,对于从每一个边界网格提取边界提出了一种最小凸边算法,并且从理论和实验上证明了这种最小凸边算法的可行性。

关 键 词:最小凸边  边界点  散乱点云
文章编号:1002-8331-(2004)09-0080-03

A Kind of Algorithm for Distill Edge from Planar Points in Disorder Based on Scan Code
Zhou Shilin Wang Qi,Liao Wenhe.A Kind of Algorithm for Distill Edge from Planar Points in Disorder Based on Scan Code[J].Computer Engineering and Applications,2004,40(9):80-82.
Authors:Zhou Shilin Wang Qi  Liao Wenhe
Abstract: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.
Keywords:Least Chimb  Edge Point  Large Number of Points in Disorder
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号