Abstract
Given a simple polygon P with m vertices, a set X = {x 1,x 2, ...,x n } of n points within P, a start point s ∈ X, and an end point t ∈ X, we give an O(n 3logm + mn) time, O(n 3 + m) space algorithm to find O(n 2) simple polygonal paths from s to t that have their vertices among the points in X and stay inside P, or report that no such path exists.
This is a preview of subscription content, log in via an institution to check access.
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 Canadian 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 Symposium on Computat. Geom. pp. 27–35 (2004)
Cheng, Q., Chrobak, M., Sundaram, G.: Computing simple paths among obstacles. Computational Geometry 16, 223–233 (2000)
Ghosh, S., Mount, D.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20, 888–910 (1991)
Meisters, G.: Polygons have ears. Amer. Math. Monthly 82, 648–651 (1975)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Zhu, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.B.: Generating random polygons with given vertices. Comput. Geom. Theory Appl. 6, 277–290 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daescu, O., Luo, J. (2008). Computing Simple Paths on Points in Simple Polygons. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)