Discrete laplace operators: no free lunch
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Oriented Morphometry of Folds on Surfaces
IPMI '09 Proceedings of the 21st International Conference on Information Processing in Medical Imaging
Progressive surface reconstruction for heart mapping procedure
Computer-Aided Design
Discrete bi-Laplacians and biharmonic b-splines
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.03 |
The discrete Laplace–Beltrami operator plays a prominent role in many digital geometry processing applications ranging from denoising to parameterization, editing, and physical simulation. The standard discretization uses the cotangents of the angles in the immersed mesh which leads to a variety of numerical problems. We advocate the use of the intrinsic Laplace–Beltrami operator. It satisfies a local maximum principle, guaranteeing, e.g., that no flipped triangles can occur in parameterizations. It also leads to better conditioned linear systems. The intrinsic Laplace–Beltrami operator is based on an intrinsic Delaunay triangulation of the surface. We detail an incremental algorithm to construct such triangulations together with an overlay structure which captures the relationship between the extrinsic and intrinsic triangulations. Using a variety of example meshes we demonstrate the numerical benefits of the intrinsic Laplace–Beltrami operator.