The DOI matches its Crossref record.
A Discrete Laplace–Beltrami Operator for Simplicial Surfaces
Open accessAbstract
We define a discrete Laplace–Beltrami operator for simplicial surfaces (Definition 16). 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Shape google: Geometric words and expressions for invariant shape retrieval
Bronstein, A. M., Bronstein, M. M., Guibas, L. J., & Ovsjanikov, M. (2011) · ACM Transactions on Graphics · doi:10.1145/1899404.1899405 · Cited by 810
Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0301-6 · Cited by 267
Metadata
- Authors
- Bobenko, A. I., & Springborn, B. A.
- Venue
- Discrete & Computational Geometry
- Published
- 2007-09-06
- Volume
- 38
- Issue
- 4
- Pages
- 740-756
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2163787581
- Cited by
- 219
- References
- 0
- FWCI
- 43.12
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Discrete Laplace–Beltrami Operator for Simplicial Surfaces. https://app.cochat.ai/papers/10.1007/s00454-007-9006-1
- The paper
- Bobenko, A. I., & Springborn, B. A. (2007). A Discrete Laplace–Beltrami Operator for Simplicial Surfaces. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-007-9006-1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.