启发式区域扩张网格重构算法  

Heuristic region growing mesh reconstruction algorithm

作　　者：沈建国[1] 陈志杨[2] 丁展[1] 张三元[1] 叶修梓[1] 

机构地区：[1]浙江大学CAD＆CG国家重点实验室,浙江杭州310027 [2]浙江工业大学软件学院,浙江杭州310014

出　　处：《浙江大学学报（工学版）》2008年第12期2080-2085,共6页Journal of Zhejiang University：Engineering Science

基　　金：浙江省科技计划资助项目(2007C21006);国家“863”高技术研究发展计划资助项目(2007AA01Z311,2007AA04Z1A5);教育部博士点基金资助项目(20060335114)

摘　　要：为了从散乱数据点快速构造网格,提出了一种新的区域扩张算法.算法从一个种子面片出发,利用启发信息,即网格的某些局部特性,优先选择有利的活动边进行扩张.有利的活动边指扩张简单、不易产生几何错误的活动边.在每次扩张中算法首先确定候选点,然后根据准则选择最佳点与活动边构成新面片,再经过启发信息检测和几何完整性检测,最后加入到已构造网格中.如此不断循环,最终构造出反映物体形状的二维流形网格.算法只需要采样点的位置信息,不需要事先给定点法矢、曲面边界等其他信息,就可以处理分布不均匀或含少量噪音的数据点.A new region growing algorithm was proposed to fast reconstruct a mesh from an unorganized point cloud. Starting with a seed face, the algorithm selects the best active edge to grow based on the heuristic information. The best active edge is an active one which can make region growing easy and avoid geometry error. In each growing, among the candidate points, the best point is selected based On some criteria to create a triangle with the active edge. Then the triangle is added into the mesh if it passes the heuristic information test and the geometric integrity test. Sample points are processed until a two-dimensional manifold mesh which recovering object shape is constructed. The algorithm doesn＇ t need point normal, surface boundary, but only point position. It can not only deal with non-uniform point clouds, but also noisy ones.

关 键 词：网格重构 区域扩张 二维流形 

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