We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Perfect Laplacians for Polygon Meshes.
- Authors
Herholz, Philipp; Kyprianidis, Jan Eric; Alexa, Marc
- Abstract
A discrete Laplace-Beltrami operator is called perfect if it possesses all the important properties of its smooth counterpart. It is known which triangle meshes admit perfect Laplace operators and how to fix any other mesh by changing the combinatorics. We extend the characterization of meshes that admit perfect Laplacians to general polygon meshes. More importantly, we provide an algorithm that computes a perfect Laplace operator for any polygon mesh without changing the combinatorics, although, possibly changing the embedding. We evaluate this algorithm and demonstrate it at applications.
- Subjects
LAPLACIAN operator; POLYGONS; MESHFREE methods; COMBINATORICS; COMPUTER algorithms
- Publication
Computer Graphics Forum, 2015, Vol 34, Issue 5, p211
- ISSN
0167-7055
- Publication type
Article
- DOI
10.1111/cgf.12709