no. 4
A linear time algorithm for the computation of some distance functions between convex polygons
RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 4, pp. 413-424. 
@article{RO_1991__25_4_413_0,
     author = {Atallah, M. J. and Ribeiro, C. C. and Lifschitz, S.},
     title = {A linear time algorithm for the computation of some distance functions between convex polygons},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {413--424},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {4},
     year = {1991},
     mrnumber = {1143502},
     zbl = {0770.68109},
     language = {en},
     url = {http://www.numdam.org/item/RO_1991__25_4_413_0/}
}
TY  - JOUR
AU  - Atallah, M. J.
AU  - Ribeiro, C. C.
AU  - Lifschitz, S.
TI  - A linear time algorithm for the computation of some distance functions between convex polygons
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1991
SP  - 413
EP  - 424
VL  - 25
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1991__25_4_413_0/
LA  - en
ID  - RO_1991__25_4_413_0
ER  - 
%0 Journal Article
%A Atallah, M. J.
%A Ribeiro, C. C.
%A Lifschitz, S.
%T A linear time algorithm for the computation of some distance functions between convex polygons
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1991
%P 413-424
%V 25
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1991__25_4_413_0/
%G en
%F RO_1991__25_4_413_0
Atallah, M. J.; Ribeiro, C. C.; Lifschitz, S. A linear time algorithm for the computation of some distance functions between convex polygons. RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 4, pp. 413-424. http://www.numdam.org/item/RO_1991__25_4_413_0/

1. M. J. Atallah, A Linear Time Algorithm for the Hausdorff Distance between Convex Polygons, Inform. Process. Lett., 1983, 17, pp. 207-209. | MR | Zbl

2. P. Cox, H. Maitre, and M. Minoux and C. C. Ribeiro, Optimal Matching of Convex Polygons, Pattern Recognition Lett., 1989, 9, pp.327-334. | Zbl

3. H. Edelsbrunner, Computing the Extreme Distances between Two Convex Polygons, J. Algorithms, 1985, 6, pp. 213-224. | MR | Zbl

4. B. Grunbaum, 1967 Convex Polytopes, Wiley, New York. | MR | Zbl

5. J. O'Rourke, C.-B. Chien, T. Olson and D. Naddor, A New Linear Time Algorithm for Intersecting Convex Polygons, Comput. Graph. Image Process., 1982, 19, pp. 384-391. | Zbl