Geodesic
Separating Two Simple Polygons by a Sequence of Translations.
Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 123-136.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : inverse Ackermann function, optimal algorithm, separating polygons. translational separability of planar objects, Computational geometry 
@article{DCG_1988__3_1-2_131041,
     author = {R. Pollack and M. Sharir and S. Sifrony},
     title = {Separating  {Two} {Simple} {Polygons} by a {Sequence} of {Translations.}},
     journal = {Discrete & computational geometry},
     pages = {123--136},
     publisher = {mathdoc},
     volume = {3},
     number = {1-2},
     year = {1988},
     zbl = {0646.68052},
     url = {http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131041/}
}
TY  - JOUR
AU  - R. Pollack
AU  - M. Sharir
AU  - S. Sifrony
TI  - Separating  Two Simple Polygons by a Sequence of Translations.
JO  - Discrete & computational geometry
PY  - 1988
SP  - 123
EP  - 136
VL  - 3
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131041/
ID  - DCG_1988__3_1-2_131041
ER  - 
%0 Journal Article
%A R. Pollack
%A M. Sharir
%A S. Sifrony
%T Separating  Two Simple Polygons by a Sequence of Translations.
%J Discrete & computational geometry
%D 1988
%P 123-136
%V 3
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131041/
%F DCG_1988__3_1-2_131041
R. Pollack; M. Sharir; S. Sifrony. Separating  Two Simple Polygons by a Sequence of Translations.. Discrete & computational geometry, Tome 3 (1988) no. 1-2, pp. 123-136. http://geodesic.mathdoc.fr/item/DCG_1988__3_1-2_131041/