Sciweavers

280 search results - page 3 / 56
» Surface reconstruction from unorganized points
Sort
View
COMGEO
2007
ACM
13 years 7 months ago
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
Daniel Freedman
CGF
2000
155views more  CGF 2000»
13 years 7 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
13 years 12 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
VISUALIZATION
1998
IEEE
13 years 12 months ago
Surface reconstruction with anisotropic density-scaled alpha shapes
Generation of a three-dimensional model from an unorganized set of points is an active area of research in computer graphics. Alpha shapes can be employed to construct a surface w...
Marek Teichmann, Michael V. Capps
SMI
2003
IEEE
14 years 28 days ago
Using Growing Cell Structures for Surface Reconstruction
We study the use of neural network algorithms in surface reconstruction from an unorganized point cloud, and meshing of an implicit surface. We found that for such applications, t...
Ioannis P. Ivrissimtzis, Won-Ki Jeong, Hans-Peter ...