Fast computation of shortest watchman routes in simple polygons

Xuehou Tan. Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett., 77(1):27-33, 2001. [doi]

@article{Tan01a:0,
  title = {Fast computation of shortest watchman routes in simple polygons},
  author = {Xuehou Tan},
  year = {2001},
  doi = {10.1016/S0020-0190(00)00146-0},
  url = {http://dx.doi.org/10.1016/S0020-0190(00)00146-0},
  tags = {routing},
  researchr = {https://researchr.org/publication/Tan01a%3A0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {77},
  number = {1},
  pages = {27-33},
}