Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
Conference
·
OSTI ID:231593
This paper studies the point location problem in Delaunay triangulations without preprocessing and additional storage. The proposed procedure finds the query point simply by walking through the triangulation, after selecting a good starting point by random sampling. The analysis generalizes and extends a recent result of d = 2 dimensions by proving this procedure to take expected time close to O(n{sup 1/(d+1)}) for point location in Delaunay triangulations of n random points in d = 3 dimensions. Empirical results in both two and three dimensions show that this procedure is efficient in practice.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 231593
- Report Number(s):
- LA-UR--96-769; CONF-960548--2; ON: DE96009802
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient VLSI parallel algorithm for Delaunay triangulation on orthogonal tree network in two and three dimensions
Strategies for nonobtuse boundary Delaunay triangulations
Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm
Journal Article
·
Wed Feb 28 23:00:00 EST 1990
· IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)
·
OSTI ID:6991564
Strategies for nonobtuse boundary Delaunay triangulations
Conference
·
Wed Dec 30 23:00:00 EST 1998
·
OSTI ID:348942
Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm
Journal Article
·
Sat May 01 00:00:00 EDT 1993
· Journal of Computational Physics; (United States)
·
OSTI ID:5152158