Abstract
We consider shortest path queries in a polygonal domain P having n vertices and h holes. A skeleton graph is a subgraph of a Voronoi diagram of P. Our novel algorithm utilizes a reduced skeleton graph of P to compute a tessellation of P. It builds a data structure of size O(n 2) in O(n 2logn) time to support distance queries for any pair of query points in P in O(hlogn) time.
Research supported by NSERC and SUN Microsystems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Computing 28(6), 2215–2256 (1999)
Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discete Comput. Geom. 18, 377–383 (1997)
Chen, D.Z., Daescu, O., Klenk, K.S.: On geometric path query problems. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 248–257. Springer, Heidelberg (1997)
Chiang, Y.J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 215–224 (1999)
Guibas, L., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. (JCSS) 39(2), 126–152 (1989)
Srinivasan, V., Nackman, L.R.: Voronoi diagram for multiply-connected polygonal domains I: algorithm. IBM Journal of Research and Development 31(3), 361–372 (1987)
Yang, C.L., Wang, J.Y., Meng, X.X.: Upper bounds on the size of inner Voronoi diagrams of multiply connected polygons. J. Software 17(7), 1527–1534 (2006)
Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12, 28–35 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, H., Maheshwari, A., Sack, JR. (2008). Shortest Path Queries in Polygonal Domains. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)