References
- A. Aggarwal, The art gallery theorem: its variations, applications, and algorithmic aspects, Ph. D. thesis, Johns Hopkins Univ., 1984
- W. P. Chin and S. Ntafos, 'Optimum watchman route,' Info. Proc. Lett., Vol.28, pp.39-44, 1988 https://doi.org/10.1016/0020-0190(88)90141-X
- W. P. Chin and S. Ntafos, 'Shortest watchman routes in simple polygons,' Discrete Comput, Geometry, Vol.6, pp. 9-31, 1991 https://doi.org/10.1007/BF02574671
- V. Chvatai, 'A combinatorial theorem in plane geometry,' J. Combin. Theory ser. B, Vol.18, pp.39-41, 1975 https://doi.org/10.1016/0095-8956(75)90061-1
- J. I. Doh and K. Y. Chwa, 'An algorithm for determining internal line visibility of a simple polygon,' Report no. CSTR-88-33, Korea Advanced Institute of Science and Technology, 1988
- H. Edelsbrunner, J. O'Rourke, and E. Welzl, 'Stationing guards in rectilinear art galleries,' Comput. vision, Graphics, and Image Process. Vol.28, pp.167-176, 1984
- P. J. Heffernan, 'An optimal algorithm for the two guard problem,' Proc. 9th ACM Symp. on Computational Geometry, pp.348-358, 1993 https://doi.org/10.1145/160985.161163
- C. Icking and R. Klein, 'The two guards problem,' Proc. 7th ACM Symp. on Computational Geometry, pp.166-175, 1991 https://doi.org/10.1145/109648.109667
- S. H. Kim, Visibility algorithms under distance constraint, Ph.D. dissertation, Korea Advanced Institute of Science and Technology, 1994
- S. H. Lee and K. Y. Chwa, 'Some chain visibility problems in a simple polygon,' Algorithmica, Vol.5, pp.485-507, 1990 https://doi.org/10.1007/BF01840400
- W. Lenhart, R. Pollack, J. R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides, and C. Yap, 'Computing the link center of a simple polygon,' Discrete Comput. Geom., Vol.3, pp.281-293, 1988 https://doi.org/10.1007/BF02187913
- B.J. Nilsson, Guarding Art Galleries-Methods for Mobile Guards, Ph. D. thesis, Lund Univ., 1995
- J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987
- S. Y. Shin, 'Visibility in the plane and its related problems,' Ph. D. dissertation, Michigan Univ., 1986
- S. Suri, 'On some link distance problems in a simple polygon,' IEEE Trans. Robotics and Automation, Vol.6, pp.108-113, 1990 https://doi.org/10.1109/70.88124
- 류상률, 서대화, 김승호, ' 단조 다각형에서 최단 경비원 경로를 구하는 알고리즘', 정보과학회논문지, 제23권 제3호, pp. 244-258, 1996
- 류상률, 김승호, '단조 다각형에서 최소링크를 가진 경비원 경로를 구하는 최적 알고리즘', 정보과학회논문지, 제24권 제2호, pp.122-130, 1997
- 류상률, '약 가시성 다각형에서 최소링크를 가진 최단 경비원 경로를 구하는 알고리즘', 정보과학회논문지, 제29권 제5.6호, pp.274-283, 2002