基于R^＊-tree的散乱点云截面数据获取算法  

Acquisition algorithm for section data of scattered points based on R^＊ tree

作　　者：孙殿柱[1] 范志先[1] 朱昌志[1] 田中朝[1] 

机构地区：[1]山东理工大学机械工程学院,山东淄博255091

出　　处：《江苏大学学报（自然科学版）》2010年第4期464-468,共5页Journal of Jiangsu University：Natural Science Edition

基　　金：国家"863"计划项目(2006AA04Z105)

摘　　要：为快速准确地获取散乱点云的截面数据,以较少数据准确表达模型信息,提出一种截面数据获取算法.采用R*-tree建立点云的动态空间索引结构,基于该结构快速准确获取截面邻域数据,依据该数据与截平面的位置关系将邻域数据分为正负两个邻域,通过对两邻域数据点配对连线与截平面求交获取截面数据,并采用最小生成树算法对其排序,最终得到有序的截面数据.结果表明,该算法数据适应性强,截面数据获取精度高,运行速度快,且能够以较少数据准确表达模型型面特征.In order to obtain section data of scattered points rapidly and accurately, and to express the information of model with less data, an acquisition algorithm for section data was proposed. The section neighbor data was obtained based on the spacial index structure of scattered points, and its topology was organized with R^＊- tree. The section neighbor data was divided into two parts based on the relation of section neighborhood data and location of cut plane. By the intersecting of matching points, the section data was obtained. The section data was sorted by the algorithm of minimum spanning tree. Finally, the ordered section data was obtained. The results show that the algorithm can obtain the section data accurately and effectively, has strong adaptability of data type, and can express the information of model with less data.

关 键 词：散乱点云 R＊-tree 截面邻域数据 截面数据获取 最小生成树 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]