| Article ID: | iaor19941026 |
| Country: | France |
| Volume: | 25 |
| Issue: | 4 |
| Start Page Number: | 413 |
| End Page Number: | 424 |
| Publication Date: | Oct 1991 |
| Journal: | RAIRO Operations Research |
| Authors: | Ribeiro C.C., Atallah M.J., Lifschitz S. |
| Keywords: | pattern recognition |
The authors present in this paper a linear time algorithm for the computation of some distance functions between convex polygons in ℝ2 in the general case where they can intersect. The interest for this problem comes from applications in robot vision, pattern recognition and contour fitting. The algorithm is based on previous work of Atallah for the computation of the Hausdorff distance between disjoint convex polygons. Computational results are presented.