[1]
H. E. G. a. D. Avis., "A linear algorithm for computing the visibility polygon from a point," Journal of Algorithms, vol. 2, no. 2, p. 186 – 197, 1981.
|
|
[2]
|
V. Chvátal, "A combinatorial theorem in plane geometry. Journal of Combinatorial Theory," Journal of Combinatorial Theory, Series B, vol. 18, no. 1, p. 39 – 41, 1975.
|
|
[3]
|
S. Fisk, "A short proof of chvátal’s watchman theorem," Journal of Combinatorial Theory, Series B, vol. 24, no. 3, p. 374, 1978.
|
|
[4]
|
D.T. Lee and A.K. Lin, "Computational Complexity of Art Gallery Problems," Springer New York, p. 303–309, 1990.
|
|
[5]
|
B.J. Nilsson and E. Packer, "An approximation algorithm for the two-watchman route in a simple polygon," in In Proceedings of EuroCG 2016, EuroCG, 2016.
|
|
[6]
|
J.S.B. Mitchell, "Approximating Watchman Routes," in Society for Industrial and Applied Mathematics, New Orleans, Louisiana, 2013.
|
|
[7]
|
S. Carlsson, B.J. Nilsson, and S. Ntafos, "Optimum guard covers and m-watchmen routes for restricted polygons," International Journal of Computational Geometry \& Applications, vol. 03, no. 01, pp. 85-105, 1993.
|
|
[8]
|
B.J. Nilsson, and D. Wood, "Optimum Watchmen Routes in Spiral Polygons: Extended Abstract," in Proceedings 2nd Canadian Conference in Computational Geometry, Ottawa, 1990.
|
|
[9]
|
B.J. Nilsson, and D. Wood, Watchmen Routes in Spiral Polygons, Technical Report LU-CS-TR:90-55, Dept. of Computer Science, Lund University, 1990.
|
|
[10]
|
B. J. Nilsson and S. Schuierer, "Shortest m-watchmen routes for histograms: the minmax case," in Proceedings ICCI `92: Fourth International Conference on Computing and Information, 1992.
|
|
[11]
|
J.S.B. Mitchell and E.L. Wynters, "Watchman routes for multiple guards," in Proc. 3rd CCCG, 1991.
|
|
[12]
|
E. Packer, "Computing Multiple Watchman Routes," in McGeoch, C.C. (eds) Experimental Algorithms. WEA 2008. Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2008.
|
|
[13]
|
A. Bagheri, A. Brötzner, F. Farivar, R. Ghasemi, F. Keshavarz-Kohjerdi, E. Krohn, B.J. Nilsson, C. Schmidt, "Minsum m watchmen’s routes in Stiegl polygons," in XX Spanish Meeting on Computational Geometry, Spain, 2023.
|
|
[14]
|
M. Bousquet-Melou, A.J. Guttmann, W.P. Orrick, and A. Rechnitzer, "Inversion relations, reciprocity and polyominoes," Annals of Combinatorics, vol. 3, p. 223–249, 1999.
|
|
[15]
|
M. de Berg, O. Cheong, M. Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 3rd ed. ed., Santa Clara, CA, USA: Springer-Verlag TELOS, 2008.
|
|
[16]
|
M. Dunbabin and L. Marques, "Robots for Environmental Monitoring: Significant Advancements and Applications," IEEE Robotics & Automation Magazine, vol. 19, no. 1, pp. 24-39, 2012.
|
)