The distance of closest approach of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries. The distance of closest approach is sometimes referred to as the contact distance. For the simplest objects, spheres, the distance of closest approach is simply the sum of their radii. For non-spherical objects, the distance of closest approach is a function of the orientation of the objects, and its calculation can be difficult. The maximumpacking density of hard particles, an important problem of ongoing interest, depends on their distance of closest approach. The interactions of particles typically depend on their separation, and the distance of closest approach plays an important role in determining the behavior of condensed matter systems.
Excluded volume
The excluded volume of particles is a key parameter in such descriptions,; the distance of closest approach is required to calculate the excluded volume. The excluded volume for identical spheres is just four times the volume of one sphere. For other anisotropic objects, the excluded volume depends on orientation, and its calculation can be surprising difficult. The simplest shapes after spheres are ellipses and ellipsoids; these have received , yet their excluded volume is not known. Vieillard Baron was able to provide an overlap criterion for two ellipses. His results were useful for computer simulations of hard particle systems and for packing problems using Monte Carlo simulations. The one anisotropic shape whose excluded volume can be expressed analytically is the spherocylinder; the solution of this problem is a classic work by Onsager. The problem was tackled by considering the distance between two line segments, which are the center lines of the capped cylinders. Results for other shapes are not readily available. The orientation dependence of the distance of closest approach has surprising consequences. Systems of hard particles, whose interactions are only entropic, can become ordered. Hard spherocylinders form not only orientationally ordered nematic, but also positionally ordered smectic phases. Here, the system gives up some disorder to gain disorder and entropy elsewhere.
Case of two ellipses
Vieillard Baron first investigated this problem, and although he did not obtain a result for the distance of closest approach, he derived the overlap criterion for two ellipses. His results were useful for the study of the phase behavior of hard particles and for the packing problem using Monte Carlo simulations. Although overlap criteria have been developed, analytic solutions for the distance of closest approach and the location of the point of contact have only recently become available. The details of the calculations are provided in Ref. The Fortran 90 subroutine is provided in Ref. The procedure consists of three steps:
Transformation of the two tangent ellipses and, whose centers are joined by the vector', into a circle and an ellipse, whose centers are joined by the vector '. The circle and the ellipse remain tangent after the transformation.
Determination of the distance of closest approach of and analytically. It requires the appropriate solution of a quartic equation. The normal ' is calculated.
Determination of the distance of closest approach and the location of the point of contact of and by the inverse transformations of the vectors ' and '.
Input:
lengths of the semiaxes,
unit vectors ',' along major axes of both ellipses, and
unit vector ' joining the centers of the two ellipses.
Output:
distance between the centers when the ellipses and are tangent, and
location of point of contact in terms of ','.
Case of two ellipsoids
Consider two ellipsoids, each with a given shape and orientation, whose centers are on a line with given direction. We wish to determine the distance between centers when the ellipsoids are in point contact externally. This distance of closest approach is a function of the shapes of the ellipsoids and their orientation. There is no analytic solution for this problem, since solving for the distance requires the solution of a sixth order polynomial equation. Here an algorithm is developed to determine this distance, based on the analytic results for the distance of closest approach of ellipses in 2D, which can be implemented numerically. Details are given in publications. Subroutines are provided in two formats: Fortran90 and C. The algorithm consists of three steps.
Constructing a plane containing the line joining the centers of the two ellipsoids, and finding the equations of the ellipses formed by the intersection of this plane and the ellipsoids.
Determining the distance of closest approach of the ellipses; that is the distance between the centers of the ellipses when they are in point contact externally.
Rotating the plane until the distance of closest approach of the ellipses is a maximum. The distance of closest approach of the ellipsoids is this maximum distance.
