1. Edelsbrunner, H.: On computing the extreme distances between two convex polygons. Technical report F96, Technical University of Graz, 1982.
2. Schwartz, J. T.: Finding the minimum distance between two convex polygons. Information Processing Letters1981, 168–170.
3. Toussaint, G. T., Bhattacharya, B. K.: Optimal algorithms for computing the minimum distance between two finite planar sets. Fifth International Congress of Cybernetics and Systems, Mexico City, August 1981.
4. McKenna, M., Toussaint, G. T.: Finding the minimum vertex distance between two disjoint convex polygons in linear time. Tech. Report No. SOCS-83.6, School of Computer Science, McGill University, April 1983.
5. Chin, F., Wang, C. A.: Minimum vertex distance problem between two convex polygons. Technical report, University of Alberta, 1983.