Discrete Laplace Operator on Meshed Surfaces

被引:125
作者
Belkin, Mikhail [1 ]
Sun, Jian
Wang, Yusu [1 ]
机构
[1] Ohio State Univ, Dept Comp Sci & Eng, Columbus, OH 43210 USA
来源
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08) | 2008年
基金
美国国家科学基金会;
关键词
Laplace-Beltrami operator; Surface mesh; Approximation algorithm;
D O I
10.1145/1377676.1377725
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In recent years a considerable amount of work in graphics and geometric optimization used tools based on the Laplace-Beltrami operator on a surface. The applications of the Laplacian include mesh editing, surface smoothing, and shape interpolations among others. However, it has been shown [13, 24, 26] that the popular cotangent approximation schemes do not provide convergent point-wise (or even L-2) estimates, while many applications rely on point-wise estimation. Existence of such schemes has been an open question [13]. In this paper we propose the first algorithm for approximating the Laplace operator of a surface from a mesh with point-wise convergence guarantees applicable to arbitrary meshed surfaces. We show that for a sufficiently fine mesh over an arbitrary surface, our mesh Laplacian is close to the Laplace-Beltrami operator on the surface at every point of the surface. Moreover, the proposed algorithm is simple and easily implementable. Experimental evidence shows that our algorithm exhibits convergence empirically and compares favorably with cotangent-based methods in providing accurate approximation of the Laplace operator for various meshes.
引用
收藏
页码:278 / 287
页数:10
相关论文
共 27 条
[1]  
Alliez P, 2002, ACM T GRAPHIC, V21, P347, DOI 10.1145/566570.566588
[2]   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
[3]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[4]  
AMENTA N, 2007, NORMAL VARIATION ADA
[5]  
[Anonymous], 2006, Curve and surface reconstruction: algorithms with mathematical analysis
[6]   Towards a theoretical foundation for Laplacian-based manifold methods [J].
Belkin, M ;
Niyogi, P .
LEARNING THEORY, PROCEEDINGS, 2005, 3559 :486-500
[7]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[8]  
Demanet L., 2006, PAINLESS HIGHLY ACCU
[9]  
Desbrun M, 1999, COMP GRAPH, P317, DOI 10.1145/311535.311576
[10]  
DONG S, 2006, SIGGRAPH 06, P1057