An optimal algorithm for shortest paths in unweighted disk graphs
From MaRDI portal
Cites work
- A geometric consistency theorem for a symbolic perturbation scheme
- A sweepline algorithm for Voronoi diagrams
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
- Dynamic connectivity in disk graphs
- Dynamic connectivity in disk graphs
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Faster algorithms for cycle hitting problems on disk graphs
- Faster algorithms for reverse shortest path in unit-disk graphs and related geometric optimization problems: improving the shrink-and-bifurcate technique
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Minimum cuts in geometric intersection graphs
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- On bounded leg shortest paths problems
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Shortest paths in intersection graphs of unit disks
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Single-source shortest path problem in weighted disk graphs
- Subexponential Parameterized algorithms on disk graphs (extended abstract)
- THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
- The unweighted and weighted reverse shortest path problem for disk graphs
- Unit disk graphs
This page was built for publication: An optimal algorithm for shortest paths in unweighted disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322422)
