Sciweavers

415 search results - page 5 / 83
» A Fast Algorithm for Delaunay Based Surface Reconstruction
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
13 years 11 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
VIS
2007
IEEE
235views Visualization» more  VIS 2007»
14 years 8 months ago
Efficient Surface Reconstruction using Generalized Coulomb Potentials
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
Andrei C. Jalba, Jos B. T. M. Roerdink
GMP
2006
IEEE
248views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Adaptive Fourier-Based Surface Reconstruction
In this paper, we propose to combine Kazhdan’s FFT-based approach to surface reconstruction from oriented points with adaptive subdivision and partition of unity blending techni...
Oliver Schall, Alexander G. Belyaev, Hans-Peter Se...
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