Sciweavers

41 search results - page 2 / 9
» Irreducible triangulations of surfaces with boundary
Sort
View
CGF
2000
155views more  CGF 2000»
13 years 6 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
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,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
SGP
2003
13 years 7 months ago
Provably Good Surface Sampling and Approximation
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...
Steve Oudot, Jean-Daniel Boissonnat
VISUALIZATION
1999
IEEE
13 years 10 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
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...
Patricia Crossno, Edward Angel
IMR
1998
Springer
13 years 10 months ago
Advancing Front Quadrilateral Meshing Using Triangle Transformations
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...
CAD
2005
Springer
13 years 6 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
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...
Chuan-Chu Kuo, Hong-Tzong Yau