A discrete Laplace-Beltrami operator for simplicial surfaces

Mathematics – Differential Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 6 vector graphics figures. v2: Section 2 on Delaunay triangulations of piecewise flat surfaces revised and expanded.

Scientific paper

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. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delaunay triangulation of the simplicial surface. This leads to new definitions of discrete harmonic functions, discrete mean curvature, and discrete minimal surfaces. The definition of the discrete Laplace-Beltrami operator depends on the existence and uniqueness of Delaunay tessellations in piecewise flat surfaces. While the existence is known, we prove the uniqueness. Using Rippa's Theorem we show that, as claimed, Musin's harmonic index provides an optimality criterion for Delaunay triangulations, and this can be used to prove that the edge flipping algorithm terminates also in the setting of piecewise flat surfaces.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A discrete Laplace-Beltrami operator for simplicial surfaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A discrete Laplace-Beltrami operator for simplicial surfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A discrete Laplace-Beltrami operator for simplicial surfaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-345468

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.