Surface reconstruction by Voronoi filtering
Surface reconstruction by Voronoi filtering
复制标题
DOI：
10.1007/pl00009475
复制
发表时间：
1999-12-01
影响因子：
0.8
通讯作者：
Bern, M
中科院分区：
文献类型：
--
作者：
Amenta, N;Bern, M
我们给出了一个简单的组合算法，该算法从有限个样本点集计算光滑曲面的分段线性逼近。该算法使用Voronoi顶点去除Delaunay三角剖分中的三角形。我们通过证明算法的正确性，证明了对于密度依赖于局部特征大小函数的密集采样曲面，输出在拓扑上是有效的，并且收敛于原始曲面(无论是逐点还是按曲面法线)。我们简要描述了该算法的实现，并给出了实例输出。
We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled surfaces, where density depends on a local feature size function, the output is topologically valid and convergent (both pointwise and in surface normals) to the original surface. We briefly describe an implementation of the algorithm and show example outputs.