415 search results - page 1 / 83 » A Fast Algorithm for Delaunay Based Surface Reconstruction |
WSCG
2003
14 years 11 months ago
2003
106
click to vote
CGF
2000
14 years 10 months ago
2000
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,...
VISUALIZATION
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
LATIN
1998
Springer
15 years 2 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
SGP
2007
15 years 13 days ago
2007
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...