Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations

Conference · Wed May 01 00:00:00 EDT 1996

OSTI ID:231593

Muecke, E P; Saias, I; Zhu, B

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. (LANL), Los Alamos, 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; TRN: AHC29611%%113
• Resource Relation: Conference: International conference on supercomputing, Philadelphia, PA (United States), 25-28 May 1996; Other Information: PBD: [1996]
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
GEOMETRY
ALGORITHMS
TWO-DIMENSIONAL CALCULATIONS
THREE-DIMENSIONAL CALCULATIONS
INFORMATION SYSTEMS
COMPUTER-AIDED DESIGN
USES