Pages that link to "Item:Q1286475"
From MaRDI portal
The following pages link to Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations (Q1286475):
Displaying 12 items.
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
- A fast boundary integral equation method for point location problem (Q1658922) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- High order direct arbitrary-Lagrangian-Eulerian schemes on moving Voronoi meshes with topology changes (Q2122699) (← links)
- Boundary layer mesh generation with fast collision detection (Q2172357) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- Optimal Delaunay and Voronoi Quantization Schemes for Pricing American Style Options (Q2917431) (← links)
- Computational Geometry Methods and Intelligent Computing (Q3628356) (← links)
- Generation of Boundary Layer Meshes by the Enhanced Jump-and-Walk Method with a Fast Collision Detecting Algorithm (Q5020244) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)