Nicholas Sharp
Keenan Crane
ABSTRACT
No abstract available.
Supplemental Material
Available for Download
Index Terms
Geometry processing with intrinsic triangulations
Recommendations
Weighted Triangulations for Geometry Processing
In this article we investigate the use of weighted triangulations as discrete, augmented approximations of surfaces for digital geometry processing. By incorporating a scalar weight per mesh vertex, we introduce a new notion of discrete metric that ...
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
Special Issue on Industrial GeometryThe discrete Laplace–Beltrami operator plays a prominent role in many digital geometry processing applications ranging from denoising to parameterization, editing, and physical simulation. The standard discretization uses the cotangents of the angles in ...
Navigating intrinsic triangulations
We present a data structure that makes it easy to run a large class of algorithms from computational geometry and scientific computing on extremely poor-quality surface meshes. Rather than changing the geometry, as in traditional remeshing, we consider ...
Comments