首页 | 本学科首页   官方微博 | 高级检索  
     

散乱点云自适应切片算法研究
引用本文:孙殿柱,朱昌志,李延瑞,田中朝.散乱点云自适应切片算法研究[J].四川大学学报(工程科学版),2010,42(1):216-219.
作者姓名:孙殿柱  朱昌志  李延瑞  田中朝
作者单位:山东理工大学机械工程学院,山东淄博,255091
基金项目:国家高技术研究发展863计划资助项目(2006AA04Z105)
摘    要:提出一种散乱点云自适应切片算法,该算法建立点云动态空间索引结构,基于该结构快速准确获取切片邻域数据并确定各层切片位置,依据邻域数据与切片的位置关系将其分为正负两个区域,通过正负区域配对点连线与切片求交获取切片数据点,并采用最小生成树算法排序,得到有序的切片数据点,实现散乱点云的自适应切片,实例证明该算法适用于逆向工程中各种复杂型面点云数据,切片数据获取精度高,算法运行速度快.

关 键 词:逆向工程  散乱点云  动态空间索引结构  最小生成树  自适应切片
收稿时间:9/2/2008 12:00:00 AM
修稿时间:2008/12/4 0:00:00

Research Onself-adaptive Slicing Algorithm for Scattered Points
Sun Dianzhu,Zhu Changzhi,Li Yanrui and Tian Zhongchao.Research Onself-adaptive Slicing Algorithm for Scattered Points[J].Journal of Sichuan University (Engineering Science Edition),2010,42(1):216-219.
Authors:Sun Dianzhu  Zhu Changzhi  Li Yanrui and Tian Zhongchao
Affiliation:SUN Dian-zhu,ZHU Chang-zhi,LI Yan-rui,TIAN Zhong-chao(School of Mechanical Eng.,Sh,ong Univ.of Technol.,Zibo 255091,China)
Abstract:An self-adaptive slicing algorithm for scattered points is proposed,which has four steps:first,the slicing neighbor points are obtained based on the spacial index structure of scattered points;second,the slicing neighbor points are divided into two parts;third,the slicing points are obtained by the intersecting between matching points of slicing neighbor data and the slice;fourth,the intersecting points are sorted with algorithm of Minimum Spannirng Tree.This algerithm can obtain slicing points accurately,e...
Keywords:reverse engineering  scattered points  spacial index structure  minimum spannirng  tree  self-adaptive slicing  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《四川大学学报(工程科学版)》浏览原始摘要信息
点击此处可从《四川大学学报(工程科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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