计算机技术与发展2011，Vol.21Issue(10)：14-18,5.
一种基于三维Delaunay三角化的曲面重建算法
A Geometric Spread Approach of 3-D Reconstruction
摘要
Abstract
It introduces a method of 3D surface reconstruction. As many other algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite,sufficiently dense, subset of its points. It is based on the 3D Delaunay triangulation of points, and uses the local area incremental algorithm to build the triangular mesh. Build up the 3D Delaunay triangulation through incremental insertion of points, and use breadth-first algorithm to pick the appropriate facets to reconstruct surfaces. The algorithm doesn' t need preprocessing of input data and nearly user input independent. Present some results of the method, which turn out to be good on surfaces with and without boundaries.关键词
曲面重建/三维Delaunay三角化/三角网格/广度优先Key words
surface reconstruction /3D Delaunay triangulation/ triangular mesh/ breadth-first分类
信息技术与安全科学引用本文复制引用
袁方,唐杰,武港山..一种基于三维Delaunay三角化的曲面重建算法[J].计算机技术与发展,2011,21(10):14-18,5.基金项目
国家高技术研究发展计划(863)(2007 AA06A402) （863）
