15 search results - page 1 / 3 » A Note on Point Location in Delaunay Triangulations of Rando... |
ALGORITHMICA
1998
13 years 10 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
ESA
2001
Springer
14 years 3 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...
CIAC
2010
Springer
14 years 3 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...
COMGEO
2006
ACM
13 years 11 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 ...