208 search results - page 2 / 42 » Blocking delaunay triangulations |
SODA
2003
ACM
13 years 7 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 ...
ESA
2001
Springer
13 years 10 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
EWC
2002
13 years 5 months ago
2002
We present results on a two-step improvement of mesh quality in three-dimensional Delaunay triangulations. The first step refines the triangulation by inserting sinks and eliminate...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
VCIP
2001
13 years 7 months ago
2001
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....