Smooth surface reconstruction via natural neighbour interpolation of distance functions

被引:82
作者
Boissonnat, JD [1 ]
Cazals, F [1 ]
机构
[1] INRIA, F-06902 Sophia Antipolis, France
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2002年 / 22卷 / 1-3期
关键词
natural neighbour interpolation; reconstruction; Delaunay triangulation; smooth surface; Voronoi diagram;
D O I
10.1016/S0925-7721(01)00048-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in R-3. (C) 2001 Elsevier Science B.V. All fights reserved.
引用
收藏
页码:185 / 203
页数:19
相关论文
共 33 条
[1]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[2]  
[Anonymous], P 23 ANN C COMP GRAP
[3]  
[Anonymous], 1996, LEVEL SET METHODS
[4]   R-regular shape reconstruction from unorganized points [J].
Attali, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (04) :239-247
[5]  
BAJAJ C, 1995, COMPUT GRAPH, V11, P109
[6]   The ball-pivoting algorithm for surface reconstruction [J].
Bernardini, F ;
Mittleman, J ;
Rushmeier, H ;
Silva, C ;
Taubin, G .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1999, 5 (04) :349-359
[7]  
Bernardini F., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P481, DOI 10.1145/262839.263098
[8]  
Bernardini F., 1997, P 9 CAN C COMP GEOM, P193
[9]  
BLOOMENTHAL J, 1997, INTRO IMPLICIT SURFA, V391
[10]   GEOMETRIC STRUCTURES FOR 3-DIMENSIONAL SHAPE REPRESENTATION [J].
BOISSONNAT, JD .
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :266-286