Abstract
Given a set X of points inside a polygonal region P, two distinguished points s, t ∈ X, we study the problem of finding the simple polygonal paths that turn only at the points of X and avoid the boundary of P, from s to t. We present an O((n 2 + m) logm) time, O(n 2 + m) space algorithm for computing a simple path or reporting no such path exists, where n is the number of points of X and m is the number of vertices of P. This gives a significant improvement upon the previously known O(m 2 n 2) time and space algorithm, and O(n 3 logm + m n) time, O(n 3 + m) space algorithm.
An important result of this paper, termed the Shortest-path Dependence Theorem, is to characterize the simple paths of the minimum link distance, in terms of the shortest paths between the points of X inside P. It finally turns out that the visibility graph of X, together with an implicit representation of the shortest paths between all pairs of the points of X, is sufficient to compute a simple path from s to t or report no simple paths exist. The Shortest-path Dependence Theorem is of interest in its own right, and might be used to solve other problems concerning simple paths or polygons.
This work was partially supported by the Grant-in-Aid (MEXT/JSPS KAKENHI 23500024) for Scientific Research from Japan Society for the Promotion of Science and the National Natural Science Foundation of China under grant 61173034.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Candian Conf. on Comput. Geom., pp. 38–44 (1996)
Ben-Moshe, B., Hall-Holt, O., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: Proc. ACM Sympos. Comput. Geom., pp. 27–35 (2004)
Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Comput. Geom. 16, 223–233 (2000)
Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)
Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3nd edn. The MIT Press (2009)
Daescu, O., Luo, J.: Computing simple paths on points in simple polygons. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds.) KyotoCGGT 2007. LNCS, vol. 4535, pp. 41–55. Springer, Heidelberg (2008)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39, 126–152 (1989)
Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett. 38, 231–235 (1991)
Zhou, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.B.: Generating random polygons with given vertices. Comput. Geom. 6, 277–290 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Tan, X., Jiang, B. (2014). Finding Simple Paths on Given Points in a Polygonal Region. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)