6 search results - page 1 / 2 » Perturbations and vertex removal in a 3D delaunay triangulat... |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
22
Voted
WSCG
2004
13 years 8 months ago
2004
In this article we present a visualisation algorithm based on image warping. A source data for the algorithm is a set of images with colour and depth information rendered for the ...
ICPR
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. Thi...
IJCV
2002
13 years 7 months ago
2002
A novel technique for multi-scale curvature computation on a free-form 3-D surface is presented. This is achieved by convolving local parametrisations of the surface with 2-D Gauss...
BILDMED
2003
13 years 8 months ago
2003
We present an approach to generating volumetric meshes from closed triangulated surface meshes. The approach initially generates a structured hexahedral mesh based on the bounding ...