Abstract
We present efficient algorithms for shortest-path and minimumlink-path queries between two convex polygons inside a simple polygon, which acts as an obstacle to be avoided. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision. Performing shortest-path queries is a variation of the wellstudied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.
Research supported in part by the National Science Foundation under grant CCR-9007851, by the U.S. Army Research Office under grants DAAL03-91-G-0035 and DAAH04-93-0134, and by the Office of Naval Research and the Defense Advanced Research Projects Agency under contract N00014-91-J-4052, ARPA order 8225.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Nancy M. Amato. An optimal algorithm for finding the separation of simple polygons. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 48–59. Springer-Verlag, 1993.
E. M. Arkin, J. S. B. Mitchell, and S. Suri. Optimal link path queries in a simple polygon. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 269–279, 1992.
B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485–524, 1991.
B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34:1–27, 1987.
Y.-J. Chiang, F. P. Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 44–53, 1993.
Y.-J. Chiang and R. Tamassia. Optimal shortest path and minimum-link path queries between two convex polygons in the presence of obstacles. Report CS-94-03, Comput. Sci. Dept., Brown Univ., Providence, RI, 1994.
F. Chin and C. A. Wang. Optimal algorithms for the intersection and the minimum distance problems between planar polygons. IEEE Trans. Comput., C-32(12):1203–1207, 1983.
S. Ghosh. Computing visibility polygon from a convex set and related problems. J. Algorithms, 12:75–95, 1991.
M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths via balanced geodesic triangulations. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 318–327, 1993.
L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci., 39:126–152, 1989.
M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166–204, 1981.
F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
J. H. Reif and J. A. Storer. Minimizing turns for discrete movement in the interior of a polygon. IEEE J. Robot. Autom., pages 182–193, 1987.
S. Suri. On some link distance problems in a simple polygon. IEEE Trans. Robot. Autom., 6:108–113, 1990.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chiang, YJ., Tamassia, R. (1994). Optimal shortest path and minimum-link path queries in the presence of obstacles. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049414
Download citation
DOI: https://doi.org/10.1007/BFb0049414
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive