Show simple item record

dc.contributor.authorAlexa, Marcen_US
dc.contributor.authorHerholz, Philippen_US
dc.contributor.authorKohlbrenner, Maxen_US
dc.contributor.authorSorkine-Hornung, Olgaen_US
dc.contributor.editorJacobson, Alec and Huang, Qixingen_US
dc.date.accessioned2020-07-05T13:25:58Z
dc.date.available2020-07-05T13:25:58Z
dc.date.issued2020
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.14068
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf14068
dc.description.abstractDiscrete Laplacians for triangle meshes are a fundamental tool in geometry processing. The so-called cotan Laplacian is widely used since it preserves several important properties of its smooth counterpart. It can be derived from different principles: either considering the piecewise linear nature of the primal elements or associating values to the dual vertices. Both approaches lead to the same operator in the two-dimensional setting. In contrast, for tetrahedral meshes, only the primal construction is reminiscent of the cotan weights, involving dihedral angles.We provide explicit formulas for the lesser-known dual construction. In both cases, the weights can be computed by adding the contributions of individual tetrahedra to an edge. The resulting two different discrete Laplacians for tetrahedral meshes only retain some of the properties of their two-dimensional counterpart. In particular, while both constructions have linear precision, only the primal construction is positive semi-definite and only the dual construction generates positive weights and provides a maximum principle for Delaunay meshes. We perform a range of numerical experiments that highlight the benefits and limitations of the two constructions for different problems and meshes.en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectMathematics of computing
dc.subjectMesh generation
dc.subjectDiscrete optimization
dc.subjectComputing methodologies
dc.subjectMesh geometry models
dc.subjectTheory of computation
dc.subjectComputational geometry
dc.titleProperties of Laplace Operators for Tetrahedral Meshesen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersDiscrete Differential Geometry
dc.description.volume39
dc.description.number5
dc.identifier.doi10.1111/cgf.14068
dc.identifier.pages55-68


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

  • 39-Issue 5
    Geometry Processing 2020 - Symposium Proceedings

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License