Skip to main content
SpringerLink
Log in

Constructing shortest watchman routes by divide-and-conquer

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

Abstract

We study the problem of finding shortest watchman routes in simple polygons from which polygons are visible. We develop a divide-and-conquer algorithm that constructs the shortest watchman route in O(n 2) time for a simple polygon with n edges. This improves the previous O(n 3) bound [8] and confirms a conjecture due to Chin and Ntafos [4].

This work was supported in part by the Hori Information Science Promotion Foundation and the International Information Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Chazelle, A theorem on polygon cutting with applications, Proceedings, 23th Annu. IEEE Symp. Found. of Comput. Sci., 339–349, 1982.

    Google Scholar 

  2. B. Chazelle, Triangulating a simple polygon in linear time, Proceedings, 31th Annu. IEEE Symp. Found. of Comput. Sci., 220–229, 1990.

    Google Scholar 

  3. W.P.Chin and S.Ntafos, Optimum watchman routes, Inform. Process. Lett. 28, 39–44, 1988.

    Article  Google Scholar 

  4. W.P.Chin and S.Ntafos, Shortest watchman routes in simple polygons, Discrete Comput. Geometry 6, 9–31, 1991.

    Google Scholar 

  5. H.Edelsbrunner, J.O'Rourke and R.Seidel, Constructing arrangements of lines with applications. SIAM J. Comput. 15, 341–363, 1986.

    Article  Google Scholar 

  6. L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons, Algorithmica 2, 209–233, 1987.

    Article  Google Scholar 

  7. S.Ntafos, The robber route problem, Inform. Process. Lett. 34, 59–63, 1990.

    MathSciNet  Google Scholar 

  8. X.H.Tan, T.Hirata and Y.Inagaki, An incremental algorithm for constructing shortest watchman routes, To appear in Internationa Journal of Computational Geometry & Applications (also in Lect. Note in Comput. Sci. 557, 163–175, 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of High-Technology for Human Welfare, Tokai University, 317 Nishino, 410-03, Numazu, Japan

    Xuehou Tan

  2. Faculty of Engineering, Nagoya University, Chikusa-ku, 464, Nagoya, Japan

    Tomio Hirata

Authors
  1. Xuehou Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomio Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, X., Hirata, T. (1993). Constructing shortest watchman routes by divide-and-conquer. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_236

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_236

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation