Shortest Watchman Routes in Simple Polygons.

@article{Chin1991,
author = {Chin, Wei-Pang, Ntafos, S.},
journal = {Discrete & computational geometry},
keywords = {polynomial-time algorithm; simple polygons; watchman-route problem; NP- hard},
number = {1},
pages = {9-32},
title = {Shortest Watchman Routes in Simple Polygons.},
url = {http://eudml.org/doc/131140},
volume = {6},
year = {1991},
}

TY - JOUR
AU - Chin, Wei-Pang
AU - Ntafos, S.
TI - Shortest Watchman Routes in Simple Polygons.
JO - Discrete & computational geometry
PY - 1991
VL - 6
IS - 1
SP - 9
EP - 32
KW - polynomial-time algorithm; simple polygons; watchman-route problem; NP- hard
UR - http://eudml.org/doc/131140
ER -