Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility

Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski. Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. In Donghyun Kim 0001, R. N. Uma, Zhipeng Cai 0001, Dong Hoon Lee 0001, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Volume 12273 of Lecture Notes in Computer Science, pages 311-323, Springer, 2020. [doi]

@inproceedings{NilssonOPSZ20,
  title = {Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility},
  author = {Bengt J. Nilsson and David Orden and Leonidas Palios and Carlos Seara and Pawel Zylinski},
  year = {2020},
  doi = {10.1007/978-3-030-58150-3_25},
  url = {https://doi.org/10.1007/978-3-030-58150-3_25},
  researchr = {https://researchr.org/publication/NilssonOPSZ20},
  cites = {0},
  citedby = {0},
  pages = {311-323},
  booktitle = {Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
  editor = {Donghyun Kim 0001 and R. N. Uma and Zhipeng Cai 0001 and Dong Hoon Lee 0001},
  volume = {12273},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-58150-3},
}