Abstract
Let V be a set of points in a d-dimensional l p -metric space. Let s,t∈V and let L be a real number. An L-bounded leg path from s to t is an ordered set of points which connects s to t such that the leg between any two consecutive points in the set has length of at most L. The minimal path among all these paths is the L-bounded leg shortest path from s to t. In the s–t Bounded Leg Shortest Path (stBLSP) problem we are given two points s and t and a real number L, and are required to compute an L-bounded leg shortest path from s to t. In the All-Pairs Bounded Leg Shortest Path (apBLSP) problem we are required to build a data structure that, given any two query points from V and a real number L, outputs the length of the L-bounded leg shortest path (a distance query) or the path itself (a path query). In this paper we obtain the following results:
-
1.
An algorithm for the apBLSP problem in any l p -metric which, for any fixed ε>0, computes in O(n 3(log 3 n+log 2 n⋅ε −d)) time a data structure which approximates any bounded leg shortest path within a multiplicative error of (1+ε). It requires O(n 2log n) space and distance queries are answered in O(log log n) time.
-
2.
An algorithm for the stBLSP problem that, given s,t∈V and a real number L, computes in O(n⋅polylog(n)) the exact L-bounded shortest path from s to t. This algorithm works in l 1 and l ∞ metrics. In the Euclidean metric we also obtain an exact algorithm but with a running time of O(n 4/3+ε), for any ε>0.
-
3.
For any weighted directed graph we give a data structure of size O(n 2.5log n) which is capable of answering path queries with a multiplicative error of (1+ε) in O(log log n+ℓ) time, where ℓ is the length of the reported path.
Our results improve upon the results given by Bose et al. (Comput. Geom. Theory Appl. 29:233–249, 2004). Our algorithms incorporate several new ideas along with an interesting observation made on geometric spanners, which is of independent interest.
Similar content being viewed by others
References
Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29, 912–953 (1999)
Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society, Providence (1999)
Aggarwal, A., Hansen, M., Leighton, T.: Solving query-retrieval problems by compacting Voronoi diagrams. In: Proc. 22nd Annu. ACM Sympos. Theory Comput., pp. 331–340 (1990)
Bentley, J.L., Saxe, J.B.: Decomposable searching problems I: Static-to-dynamic transformations. J. Algorithms 1, 301–358 (1980)
Bose, P., Meheswari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom. Theory Appl. 29, 233–249 (2004)
Chan, T.M.: Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM 48, 1–12 (2001)
Chan, T.M.: A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. In: ACM–SIAM Symposium on Discrete Algorithms (2006)
Chan, T.M., Efrat, A.: Fly cheaply: On the minimum fuel consumption problem. J. Algorithms 41, 330–337 (2001)
Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inform. Theory IT-31(4), 509–517 (1985)
Chazelle, B., Preparata, F.P.: Halfspace range search: An algorithmic application of k-sets. Discrete Comput. Geom. 1, 83–93 (1986)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
Eppstein, D.: Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom. 13, 111–122 (1995)
Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry. Elsevier, Amsterdam (2000)
Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32, 249–267 (1992)
Kapoor, S., Smid, M.: New techniques for exact and approximate dynamic closest-point problems. SIAM J. Comput. 25, 775–796 (1996)
Matoušek, J.: Efficient partition trees. Discrete Comput. Geom. 8, 315–334 (1992)
Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theor. Comput. Sci. 312(1), 47–74 (2004)
Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46(3), 362–394 (1999)
Vaidya, P.M.: A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom. 6, 369–381 (1991)
Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49(3), 289–317 (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
M. Segal was partially supported by REMON (4G) consortium.
Rights and permissions
About this article
Cite this article
Roditty, L., Segal, M. On Bounded Leg Shortest Paths Problems. Algorithmica 59, 583–600 (2011). https://doi.org/10.1007/s00453-009-9322-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9322-3