Surface reconstruction by Voronoi filtering

被引:421
作者
Amenta, N [1 ]
Bern, M
机构
[1] Univ Texas, Austin, TX 78712 USA
[2] Xerox Corp, Palo Alto Res Ctr, Palo Alto, CA 94304 USA
关键词
D O I
10.1007/PL00009475
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:481 / 504
页数:24
相关论文
共 22 条
  • [21] KIRKPATRICK DG, 1988, COMPUTATIONAL GEOMET, P217
  • [22] LEVY S, GEOMVIEW