Geodesic
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 43-76 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : polygon motion, time-complexity, computational geometry, polygonal obstacles 
@article{DCG_1990__5_2_131106,
     author = {K. Kedem and M. Sharir},
     title = {An {Efficient} {Motion-Planning} {Algorithm} for a {Convex} {Polygonal} {Object} in {Two-Dimensional} {Polygonal} {Space.}},
     journal = {Discrete & computational geometry},
     pages = {43--76},
     year = {1990},
     volume = {5},
     number = {2},
     zbl = {0688.68039},
     url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131106/}
}
TY  - JOUR
AU  - K. Kedem
AU  - M. Sharir
TI  - An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
JO  - Discrete & computational geometry
PY  - 1990
SP  - 43
EP  - 76
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131106/
ID  - DCG_1990__5_2_131106
ER  - 
%0 Journal Article
%A K. Kedem
%A M. Sharir
%T An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
%J Discrete & computational geometry
%D 1990
%P 43-76
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131106/
%F DCG_1990__5_2_131106
K. Kedem; M. Sharir. An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 43-76. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131106/