Abstract
The problem of finding the shortest watchman route in a simple polygon P through a point s on its boundary is considered. A route is a watchman route if every point inside P can be seen from at least one point along the route. We present an incremental algorithm that constructs the shortest watchman route in O(n 3) time for a simple polygon with n edges. This improves the previous O(n 4) bound.
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
B.Chazelle, Triangulating a simple polygon in linear time, Proceedings, 31th Annu. IEEE Symp. Found. of Comput. Sci.(1990), pp. 220–229.
W.P.Chin and S.Ntafos, Optimum watchman routes, Inform. Process. Lett. 28, 39–44, 1988.
W.P.Chin and S.Ntafos, Shortest watchman routes in a simple polygon, Discrete Comput. Geometry 6, 9–31, 1991.
L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, in Proc. 2nd ACM Symp. Comput. Geometry(1987), pp.1–13.
S.Ntafos, The robber route problems, Inform. Process. Lett. 34 (1990) 59–63.
J.O'Rourke, Art Gallery theorems and algorithms, Oxford University Press, 1987.
X.H.Tan, T.Hirata and Y.Inagaki, Constructing shortest watchman routes by divide-and-conquer, Manuscript in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, XH., Hirata, T., Inagaki, Y. (1991). An incremental algorithm for constructing shortest watchman routes. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_60
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive