"Laughter is the closest distance between two people."
- Victor
Borge
Godfried T. Toussaint, "Computing the
width of a set," IEEE Transactions on Pattern Analysis and
Machine
Intelligence,
vol. 10, No. 5, September, 1988, pp. 761-765. (with M. Houle)
Godfried T. Toussaint, "An optimal algorithm for
computing
the minimum vertex distance between two crossing convex polygons,"
Computing,
vol. 32, 1984, pp. 357-364.
Godfried T. Toussaint, "Efficient
algorithms for computing the maximum distance between two finite planar
sets," Journal of Algorithms, vol. 4, 1983, pp. 121-136.
(with
B. K. Bhattacharya)
Godfried T. Toussaint, "Optimal
algorithms for computing the minimum distance between two finite planar
sets," Proc. Fifth International Congress of Cybernetics and
Systems,
Mexico City, August 1981. (with B. K.
Bhattacharya)
You can get further information
in
the following papers (not available electronically).
Godfried T. Toussaint, "Computing the external
geodesic
diameter of a simple polygon," Computing, vol. 44, 1990,
pp.
1-19. (with D. Samuel)
Godfried T. Toussaint, "Fast algorithms
for computing the diameter of a finite planar set," The
Visual
Computer,
Vol. 3, No. 6, May 1988, pp.379-388. (with B.
K. Bhattacharya)
Godfried T. Toussaint, "Finding the minimum vertex
distance between two disjoint convex polygons in linear time," Computers
and Mathematics with Applications, vol. 11, No. 12, 1985, pp.
1227-1242. (with M. McKenna)
Godfried T. Toussaint, "A simple O(n log n)
algorithm
for finding the maximum distance between two finite planar sets,"
Pattern
Recognition Letters, vol. 1, 1982, pp. 21-24. (with J. A. McAlear)