Sciweavers

415 search results - page 2 / 83
» A Fast Algorithm for Delaunay Based Surface Reconstruction
Sort
View
COMPGEOM
2009
ACM
13 years 12 months ago
High resolution surface reconstruction from overlapping multiple-views
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
Nader Salman, Mariette Yvinec
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
13 years 11 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
SMI
2010
IEEE
173views Image Analysis» more  SMI 2010»
13 years 3 months ago
Point Cloud Skeletons via Laplacian Based Contraction
—We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds....
Junjie Cao, Andrea Tagliasacchi, Matt Olson, Hao Z...
COMPGEOM
2010
ACM
13 years 9 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
3DIM
2007
IEEE
13 years 11 months ago
Surface Reconstruction from Point Clouds by Transforming the Medial Scaffold
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...