56 search results - page 8 / 12 » Computing Delaunay Triangulation with Imprecise Input Data |
COMPGEOM
2003
ACM
14 years 22 days ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
We present an efficient and uniform approach for the automatic reconstruction of surfaces of CAD (computer aided design) models and scalar fields defined on them, from an unorg...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
SGP
2004
13 years 10 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...
SGP
2007
13 years 10 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...