Pages that link to "Item:Q3721830"
From MaRDI portal
The following pages link to A new point-location algorithm and its practical efficiency: comparison with existing algorithms (Q3721830):
Displaying 10 items.
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain (Q433075) (← links)
- Parallel algorithms for fractional and maximal independent sets in planar graphs (Q913519) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- Representing stereo data with the Delaunay triangulation (Q2638828) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)
