56 search results - page 3 / 12 » Computing Delaunay Triangulation with Imprecise Input Data |
SODA
2000
ACM
13 years 7 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
WSCG
2004
13 years 7 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 ...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
CCCG
2008
13 years 7 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....