Provably Good Moving Least Squares

被引:97
作者
Kolluri, Ravikrishna [1 ]
机构
[1] Univ Calif Berkeley, Berkeley, CA 94720 USA
关键词
Reconstruction; interpolation; implicit surfaces;
D O I
10.1145/1361192.1361195
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We analyze a moving least squares (MLS) interpolation scheme for reconstructing a surface from point cloud data. The input is a sufficiently dense set of sample points that lie near a closed surface F with approximate surface normals. The output is a reconstructed surface passing near the sample points. For each sample point s in the input, we define a linear point function that represents the local shape of the surface near s. These point functions are combined by a weighted average, yielding a three-dimensional function I. The reconstructed surface is implicitly defined as the zero set of I. We prove that the function I is a good approximation to the signed distance function of the sampled surface F and that the reconstructed surface is geometrically close to and isotopic to F. Our sampling requirements are derived from the local feature size function used in Delaunay-based surface reconstruction algorithms. Our analysis can handle noisy data provided the amount of noise in the input dataset is small compared to the feature size of F.
引用
收藏
页数:25
相关论文
共 33 条
[1]   Econometric estimation of country-specific hospital costs [J].
Taghreed Adam ;
David B Evans ;
Christopher JL Murray .
Cost Effectiveness and Resource Allocation, 1 (1)
[2]   Computational topology: ambient isotopic approximation of 2-manifolds [J].
Amenta, N ;
Peters, TJ ;
Russell, AC .
THEORETICAL COMPUTER SCIENCE, 2003, 305 (1-3) :3-15
[3]   A simple algorithm for homeomorphic surface reconstruction [J].
Amenta, N ;
Choi, S ;
Dey, TK ;
Leekha, N .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2002, 12 (1-2) :125-141
[4]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[5]  
AMENTA N, 2004, P ACM SIGGRAPH
[6]  
[Anonymous], 2001, P 6 ACM S SOLID MODE, DOI DOI 10.1145/376957.376986
[7]  
[Anonymous], 2003, LEVEL SET METHOD DYN
[8]   Smoothing and accelerated computations in the element free Galerkin method [J].
Belytschko, T ;
Krongauz, Y ;
Fleming, M ;
Organ, D ;
Liu, WKS .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1996, 74 (1-2) :111-126
[9]  
Boissonnat J.-D., 2000, P 16 ANN S COMP GEOM, P223
[10]  
BOISSONNAT JD, 2003, P EUR ACM SIGGRAPH S, P9