We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Quad-morphing is a new technique used for generating quadrilaterals from an existing triangle mesh. Beginning with an initial triangulation, triangles are systematically transform...
Steven J. Owen, Matthew L. Staten, Scott A. Canann...
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...