7 search results - page 1 / 2 » An Upper Bound for Conforming Delaunay Triangulations |
COMPGEOM
1992
ACM
13 years 8 months ago
1992
ACM
CIAC
2010
Springer
13 years 9 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
SODA
2000
ACM
13 years 5 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...
CCCG
2009
13 years 5 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...