51 search results - page 8 / 11 » Fast Localized Delaunay Triangulation |
103
Voted
VISUALIZATION
2000
IEEE
15 years 6 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,...
137
Voted
VISUALIZATION
1999
IEEE
15 years 6 months ago
1999
IEEE
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...
150
click to vote
SGP
2004
15 years 4 months ago
2004
: 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...
114
Voted
GRAPHICSINTERFACE
2009
14 years 11 months ago
2009
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
117
Voted
CG
2004
Springer
15 years 1 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...