Shortest Watchman Routes in Simple Polygons.
Discrete & computational geometry (1991)
- Volume: 6, Issue: 1, page 9-32
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topChin, Wei-Pang, and Ntafos, S.. "Shortest Watchman Routes in Simple Polygons.." Discrete & computational geometry 6.1 (1991): 9-32. <http://eudml.org/doc/131140>.
@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 -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.