This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to c...
This paper presents a novel hierarchical approach to triangular mesh generation from height fields. A waveletbased multiresolution analysis technique is used to estimate local sha...