Sciweavers

653 search results - page 8 / 131
» Efficient reconstruction from non-uniform point sets
Sort
View
ICPR
2000
IEEE
16 years 7 months ago
Face Reconstruction from a Small Number of Feature Points
This paper proposes a method for face reconstruction that makes use of only a small set of feature points. Faces can be modeled by forming linear combinations of prototypes of sha...
Bon-Woo Hwang, Seong-Whan Lee, Volker Blanz, Thoma...
SIGGRAPH
1992
ACM
15 years 10 months ago
Surface reconstruction from unorganized points
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
CGF
2000
155views more  CGF 2000»
15 years 5 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
VISUALIZATION
1999
IEEE
15 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
SGP
2004
15 years 8 months ago
Spectral Surface Reconstruction From Noisy Point Clouds
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...