Efficient expected-case algorithms for planar point location
From MaRDI portal
Recommendations
- Optimal Expected-Case Planar Point Location
- Lower bounds for expected-case planar point location
- Expected asymptotically optimal planar point location
- scientific article; zbMATH DE number 1303604
- On the Exact Worst Case Query Complexity of Planar Point Location
- Towards an optimal method for dynamic planar point location
- Dynamic planar point location with optimal query time
- Dynamic planar point location with optimal query time (extended abstract)
- PLANAR POINT LOCATION REVISITED
- Dynamic planar point location in optimal time
Cited in
(15)- Expected time analysis for Delaunay point location
- Expected asymptotically optimal planar point location
- Biased range trees
- Lower bounds for expected-case planar point location
- Algorithms for a simple point placement problem
- A simple entropy-based algorithm for planar point location
- A simple entropy-based algorithm for planar point location
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Efficient Point Location in a Convex Spatial Cell-Complex
- On the Exact Worst Case Query Complexity of Planar Point Location
- Adaptive Point Location in Planar Convex Subdivisions
- Optimal Expected-Case Planar Point Location
- I/O-Efficient Point Location in a Set of Rectangles
- On solving unreliable planar location problems
- Dynamic planar point location with optimal query time
This page was built for publication: Efficient expected-case algorithms for planar point location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721994)