# Inversive distance

In inversive geometry, the inversive distance is a way of measuring the "distance" between two circles, regardless of whether the circles cross each other, are tangent to each other, or are disjoint from each other.[1]

## Properties

The inversive distance remains unchanged if the circles are inverted, or transformed by a Möbius transformation.[1][2][3] One pair of circles can be transformed to another pair by a Möbius transformation if and only if both pairs have the same inversive distance.[1]

An analogue of the Beckman–Quarles theorem holds true for the inversive distance: if a bijection of the set of circles in the inversive plane preserves the inversive distance between pairs of circles at some chosen fixed distance $\delta$, then it must be a Möbius transformation that preserves all inversive distances.[3]

## Distance formula

For two circles in the Euclidean plane with radii $r$ and $R$, and distance $d$ between their centers, the inversive distance can be defined by the formula[1]

$I=\left|\frac{d^2-r^2-R^2}{2rR}\right|.$

This formula gives:

• a value greater than 1 for two disjoint circles,
• a value of 1 for two circles that are tangent to each other and both outside each other,
• a value less than 1 and greater than −1 for two circles that cross,
• a value of 0 for two circles that cross each other with right angles ,
• a value of −1 for two circles that are tangent to each other, one inside of the other,
• and a value less than −1 when one circle contains the other.

Some authors modify this formula by taking the inverse hyperbolic cosine of the value given above, rather than the value itself.[2][4] That is, rather than using the number $I$ as the inversive distance, the distance is instead defined as the number $\delta$ obeying the equation

$\delta=\cosh^{-1} I.$

Although transforming the inversive distance in this way makes the distance formula more complicated, and prevents its application to crossing pairs of circles, it has the advantage that (like the usual distance for points on a line) the distance becomes additive for circles in a pencil of circles. That is, if three circles belong to a common pencil, then (using $\delta$ in place of $I$ as the inversive distance) one of their three pairwise distances will be the sum of the other two.[2]

## In other geometries

It is also possible to define the inversive distance for circles on a sphere, or for circles in the hyperbolic plane.[1]

## Applications

### Steiner chains

A Steiner chain for two disjoint circles is a finite cyclic sequence of additional circles, each of which is tangent to the two given circles and to its two neighbors in the chain. Steiner's porism states that if two circles have a Steiner chain, they have infinitely many such chains. The chain is allowed to wrap more than once around the two circles, and can be characterized by a rational number $p$ whose numerator is the number of circles in the chain and whose denominator is the number of times it wraps around. All chains for the same two circles have the same value of $p$. If the inversive distance between the two circles (after taking the inverse hyperbolic cosine) is $\delta$, then $p$ can be found by the formula

$p=\frac{\pi}{\sin^{-1}\tanh(\delta/2)}.$

Conversely, every two disjoint circles for which this formula gives a rational number will support a Steiner chain. More generally, an arbitrary pair of disjoint circles can be approximated arbitrarily closely by pairs of circles that support Steiner chains whose $p$ values are rational approximations to the value of this formula for the given two circles.[2]

### Circle packings

The inversive distance has been used to define the concept of an inversive-distance circle packing: a collection of circles such that a specified subset of pairs of circles (corresponding to the edges of a planar graph ) have a given inversive distance with respect to each other. This concept generalizes the circle packings described by the circle packing theorem, in which specified pairs of circles are tangent to each other.[1][5] Although less is known about the existence of inversive distance circle packings than for tangent circle packings, it is known that, when they exist, they can be uniquely specified (up to Möbius transformations) by a given maximal planar graph and set of Euclidean or hyperbolic inversive distances. This rigidity property can be generalized broadly, to Euclidean or hyperbolic metrics on triangulated manifolds with angular defects at their vertices.[6] However, for manifolds with spherical geometry, these packings are no longer unique.[7] In turn, inversive-distance circle packings have been used to construct approximations to conformal mappings.[1]

## References

1. Bowers, Philip L.; Hurdal, Monica K. (2003), "Planar conformal mappings of piecewise flat surfaces", in Hege, Hans-Christian; Polthier, Konrad, Visualization and Mathematics III, Mathematics and Visualization, Springer, pp. 3–34, doi:10.1007/978-3-662-05105-4_1, MR 2046999.
2. ^ a b c d Coxeter, H. S. M. (1966), "Inversive distance", Annali di Matematica Pura ed Applicata 71: 73–83, doi:10.1007/BF02413734, MR 0203568.
3. ^ a b Lester, J. A. (1991), "A Beckman-Quarles type theorem for Coxeter's inversive distance", Canadian Mathematical Bulletin 34 (4): 492–498, doi:10.4153/CMB-1991-079-6, MR 1136651.
4. ^ Coxeter, H.S.M.; Greitzer, S.L. (1967), Geometry Revisited, New Mathematical Library 19, Washington, D.C.: Mathematical Association of America, pp. 123–124, ISBN 978-0-88385-619-2, Zbl 0166.16402
5. ^ Bowers, Philip L.; Stephenson, Kenneth (2004), "8.2 Inversive distance packings", Uniformizing dessins and Belyĭ maps via circle packing, Memoirs of the American Mathematical Society 805, pp. 78–82, doi:10.1090/memo/0805, MR 2053391.
6. ^ Luo, Feng (2011), "Rigidity of polyhedral surfaces, III", Geometry & Topology 15 (4): 2299–2319, doi:10.2140/gt.2011.15.2299, MR 2862158.
7. ^ Ma, Jiming; Schlenker, Jean-Marc (2012), "Non-rigidity of spherical inversive distance circle packings", Discrete Comput. Geom. 47 (3): 610–617, doi:10.1007/s00454-012-9399-3, MR 2891251.