Abstract

A simplicial surface provides its carrier with a natural triangulation whose vertex set includes the cone points and the corners of the boundary. However, this triangulation is not intrinsically distinguished from other triangulations with the same vertex set, it is not preserved under isometric deformations of the surface. Delaunay tessellations of polyhedral surfaces are defined intrinsically in terms of empty discs on surfaces. The edges of Delaunay tessellations are geodesics on the original polyhedral surface (and not necessarily straight edges in the 3-space). For any polyhedral surface there exists a unique Delaunay tessellation. It is not necessarily strongly regular, i.e. the intersection of two closed cells may not be a single closed cell.For discretization of notions of Riemannian geometry it is natural to deal with intrinsic tessellations. We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. The intrinsic Laplace-Beltrami operator is based on an intrinsic Delaunay triangulation of the surface. We describe an incremental flipping algorithm to construct such triangulations together with an overlay structure which captures the relationship between the extrinsic and intrinsic triangulations. We demonstrate some numerical benefits of the intrinsic Laplace-Beltrami operator.This talk is based on the original results obtained in [1] and [2].

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.