In mathematics, the matching distance is a metric on the space of size functions.

The core of the definition of matching distance is the observation that the information contained in a size function can be combinatorially stored in a formal series of lines and points of the plane, called respectively cornerlines and cornerpoints.

.

The matching distance and

implies that matching two points of the diagonal has no cost.

See also

• Size theory

• Size function

• Size functor

• Size homotopy group

• Natural pseudodistance

References