We present in this paper a linear time algorithm for the computation of some distance functions between convex polygons in R2 in the general case where they can intersect. The interest for this problem comes from applications in robot vision, pattern recognition and contour fitting, see Cox, Maitre, Minoux and Ribeiro . The algorithm is based on previous work of Atallah  for the computation of the Hausdorff distance between disjoint convex polygons. Computational results are presented.
Paru en mai 1990 , 15 pages
Ce cahier a été révisé en mai 1991