A mesh M with planar faces is called an edge offset (EO) mesh if there exists a combinatorially equivalent mesh M d such that corresponding edges of M and M d lie on parallel lines...
Helmut Pottmann, Philipp Grohs, Bernhard Blaschitz
—There are multiple areas of computer graphics where triangular meshes are being altered in order to reduce their size or complexity, while attempting to preserve the original sh...
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...