Cut locus

Let ${\displaystyle X}$ be a metric space, equipped with the metric ${\displaystyle \mathrm {d} _{X}}$, and let ${\displaystyle x\in X}$ be a point. The cut locus of ${\displaystyle x}$ in ${\displaystyle X}$ (${\displaystyle \operatorname {CL} _{X}(x)}$), is the locus of all the points in ${\displaystyle X}$ for which there exists at least two distinct shortest paths to ${\displaystyle x}$ in ${\displaystyle X}$. More formally, ${\displaystyle y\in \operatorname {CL} _{X}(x)}$ for a point ${\displaystyle y}$ in ${\displaystyle X}$ if and only if there exists two paths ${\displaystyle \gamma ,\gamma ':I\to X}$ such that ${\displaystyle \gamma (0)=\gamma '(0)=x}$, ${\displaystyle \gamma (1)=\gamma '(1)=y}$, ${\displaystyle |\gamma |=|\gamma '|=\mathrm {d} _{X}(x,y)}$, and the trajectories of the two paths are distinct.

For example, let S be the boundary of a simple polygon, and X the interior of the polygon. Then the cut locus is the medial axis of the polygon. The points on the medial axis are centers of maximal disks that touch the polygon boundary at two or more points, corresponding to two or more shortest paths to the disk center.

As a second example, let S be a point x on the surface of a convex polyhedron P, and X the surface itself. Then the cut locus of x is what is known as the ridge tree of P with respect to x. This ridge tree has the property that cutting the surface along its edges unfolds P to a simple planar polygon. This polygon can be viewed as a net for the polyhedron.