Geodesic
Shortest Watchman Routes in Simple Polygons.
Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 9-32
Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : polynomial-time algorithm, simple polygons, watchman-route problem, NP- hard 
@article{DCG_1991__6_4_131140,
     author = {Wei-Pang Chin and S. Ntafos},
     title = {Shortest {Watchman} {Routes} in {Simple} {Polygons.}},
     journal = {Discrete & computational geometry},
     pages = {9--32},
     year = {1991},
     volume = {6},
     number = {4},
     zbl = {0715.68037},
     url = {http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131140/}
}
TY  - JOUR
AU  - Wei-Pang Chin
AU  - S. Ntafos
TI  - Shortest Watchman Routes in Simple Polygons.
JO  - Discrete & computational geometry
PY  - 1991
SP  - 9
EP  - 32
VL  - 6
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131140/
ID  - DCG_1991__6_4_131140
ER  - 
%0 Journal Article
%A Wei-Pang Chin
%A S. Ntafos
%T Shortest Watchman Routes in Simple Polygons.
%J Discrete & computational geometry
%D 1991
%P 9-32
%V 6
%N 4
%U http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131140/
%F DCG_1991__6_4_131140
Wei-Pang Chin; S. Ntafos. Shortest Watchman Routes in Simple Polygons.. Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 9-32. http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131140/