Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
From MaRDI portal
Publication:1286475
DOI10.1016/S0925-7721(98)00035-2zbMath0922.68122MaRDI QIDQ1286475
Binhai Zhu, Isaac Saias, E. P. Mücke
Publication date: 20 October 1999
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (12)
High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes ⋮ Expected time analysis for Delaunay point location ⋮ HCPO: an efficient insertion order for incremental Delaunay triangulation ⋮ Practical distribution-sensitive point location in triangulations ⋮ Optimal Delaunay and Voronoi Quantization Schemes for Pricing American Style Options ⋮ A fast boundary integral equation method for point location problem ⋮ Boundary layer mesh generation with fast collision detection ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Distribution-sensitive construction of the greedy spanner ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Computational Geometry Methods and Intelligent Computing ⋮ Generation of Boundary Layer Meshes by the Enhanced Jump-and-Walk Method with a Fast Collision Detecting Algorithm
Uses Software
This page was built for publication: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
