Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Handbook of discrete and computational geometry
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
SIAM Journal on Computing
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum spanning trees in d dimensions
Nordic Journal of Computing
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Journal of the ACM (JACM)
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Compact oracles for approximate distances around obstacles in the plane
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast pruning of geometric spanners
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.01 |
Let G be a geometric t-spanner in Ed with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + 驴)-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.