Abstract
We consider the problem of finding an obstacle-avoiding path between two points s and t in the plane, amidst a set of disjoint polygonal obstacles with a total of n vertices. The length of this path should be within a small constant factor c of the length of the shortest possible obstacle-avoiding s-t path measured in the L p -metric. Such an approximate shortest path is called a c-short path, or a short path with stretch factor c. The goal is to preprocess the obstacle-scattered plane by creating an efficient data structure that enables fast reporting of a c-short path (or its length). In this paper, we give a family of algorithms for the above problem that achieve an interesting trade-off between the stretch factor, the query time and the preprocessing bounds. Our main results are algorithms that achieve logarithmic length query time, after subquadratic time and space preprocessing.
Part of this work was done while the authors were with the Max-Planck-Institut für Informatik in Saarbrücken, Germany. Gautam Das was partially supported by NSF Grant CCR-9306822.
The research of this author was supported in part by the National Science Foundation under Grant CCR-9623585.
This author was supported by ONR Grant N00014-89-J-1946, by ARPA under ONR contract N00014-88-K-0591, by the U.S. Army Research Office through the Math. Sciences Institute of Cornell Univ. under contract DAAL03-91-C-0027, and by the Cornell Theory Center which receives funding from its Corporate Research Institute, NSF, New York State, ARPA, NIH, and IBM.
Part of this work was done while the author was with the Max-Planck-Institut für Informatik, Saarbrücken, Germany.
This author was partially supported by the EU ESPRIT LTR Project No. 20244 (ALCOM-IT).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Arya, G. Das, D.M. Mount, J.S. Salowe and M. Smid, “Euclidean spanners: short, thin, and lanky”, Proc. 27th ACM STOC, 1995, pp. 489–498.
S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman and A. Wu, “An optimal algorithm for approximate nearest neighbor searching”, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 573–582.
M. J. Atallah and D. Z. Chen, “Parallel rectilinear shortest paths with rectangular obstacles”, Comp. Geometry: Theory and Appl., 1:2 (1991), pp.79–113.
M. J. Atallah and D. Z. Chen, “On parallel rectilinear obstacle-avoiding paths”, Computational Geometry: Theory and Applications, 3 (1993), pp. 307–313.
D. Z. Chen. “On the all-pairs Euclidean short path problem”, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 1995, pp. 292–301.
D. Z. Chen and K. S. Klenk, “Rectilinear short path queries among rectangular obstacles”, Proc. 7th Can. Conf. on Comp. Geometry, 1995, pp. 169–174.
D. Z. Chen, K. S. Klenk, and H.-Y. T. Tu, “Rectilinear shortest path queries among weighted obstacles in the rectilinear plane”, Proc. 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 370–379.
L. P. Chew, “Constrained Delaunay triangulations”, Algorithmica, 4 (1989), pp. 97–108.
L. P. Chew, “There are planar graphs almost as good as the complete graph”, J. of Computer and System Sciences, 39 (1989), pp. 205–219.
L. P. Chew, “Planar graphs and sparse graphs for efficient motion planning in the plane”, Computer Science Tech Report, PCS-TR90-146, Dartmouth College.
L. P. Chew and R. L. Drysdale, “Voronoi diagrams based on convex distance functions”, Proc. 1st Annual ACM Symp. on Comp. Geometry, 1985, pp. 235–244.
Y.-J. Chiang, F. P. Preparata, and R. Tamassia, “A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps”, Proc. of the 4th ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 44–53.
K. L. Clarkson, “Approximation algorithms for shortest path motion planning”, Proc. 19th Annual ACM Symp. Theory of Computing, 1987, pp. 56–65.
H. Djidjev, G. Pantziou and C. Zaroliagis, “On-line and dynamic algorithms for shortest path problems”, Proc. 12th Symp. on Theor. Aspects of Comp. Sc., LNCS 900, Springer-Verlag, 1995, pp. 193–204.
D. P. Dobkin, S. J. Friedman, and K. J. Supowit, “Delaunay graphs are almost as good as complete graphs”, Discrete & Comp. Geometry, 5 (1990), pp. 399–407.
H. ElGindy and P. Mitra, “Orthogonal shortest route queries among axes parallel rectangular obstacles”, Int. J. of Comp. Geometry and Appl., 4 (1) (1994), 3–24.
G. Frederickson, “Fast algorithms for shortest paths in planar graphs, with applications”, SIAM J. on Computing, 16 (1987), pp.1004–1022.
G.N. Frederickson, “Using cellular graph embeddings in solving all pairs shortest path problems”, J. of Algorithms, 19 (1995), pp. 45–85.
M. Goodrich, “Planar separators and parallel polygon triangulation”, Proc. 24th ACM Symp. on Theory of Comp., 1992, pp.507–516.
M.T. Goodrich and R. Tamassia, “Dynamic ray shooting and shortest paths via balanced geodesic triangulations”, Proc. 9th Annual ACM Symp. on Computational Geometry, 1993, pp. 318–327.
L.J. Guibas and J. Hershberger, “Optimal shortest path queries in a simple polygon”, Proc. 3rd Annual ACM Symp. on Computational Geometry, 1987, pp. 50–63.
L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, “Linear time algorithms for visibility and shortest paths problems inside triangulated simple polygons”, Algorithmica, 2 (1987), pp. 209–233.
P. Klein, S. Rao, M. Rauch and S. Subramanian, “Faster shortest-path algorithms for planar graphs”, Proc. 26th ACM Symp. on Theory of Comp., 1994, pp.27–37.
R. Lipton and R. Tarjan, “A separator theorem for planar graphs”, SIAM J. Applied Mathematics, 36 (1979), pp.177–189.
B. Schieber and U. Vishkin, “On finding lowest common ancestors: Simplification and parallelization”, SIAM J. Computing, 17:6 (1988), pp.1253–1262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, C.D. (1996). Planar spanners and approximate shortest path queries among obstacles in the plane. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_79
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive