A summary of results on mean distance in shapes

The average or mean of the distances between pairs of vertices in a connected graph is a natural measure of the compactness of that graph. Using graphs to represent shapes, or corridor arrangements, we arrive, through a limiting process, at a concept for mean distance in shapes. This paper gives the mean distance for eight specific shapes and six infinite families of shapes.