The cut locus is a mathematical structure defined for a closed set S in a metric space X, that is, a space in which the length of every path is well defined. The cut locus of S is the closure of the set of all points p\in X that have two or more distinct shortest paths in X from S to p.
Let X be a metric space, equipped with the metric \mathrm{d}_X, and let x \in X be a point. The cut locus of x in X (\mathrm{CL}_X(x)), is the locus of all the points in X for which there exists at least two distinct shortest paths to x in X. More formally, y \in \mathrm{CL}_X(x) for a point y in X if and only if there exists two paths \gamma,\gamma':I\to X such that \gamma(0) = \gamma'(0) = x, \gamma(1)=\gamma'(1)=y, |\gamma|=|\gamma'|= \mathrm{d}_X(x,y) and the trajectory of the two paths is distinct.
Examples
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 polyhedronP, 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.
Example for the special case
Let X = S^2, that is the regular 2-sphere. Then the cut locus of every point on the sphere consists of exactly one point, namely the antipodal one.
Reference
Guibas, Oudot, Gao, Wang. Geodesic Delaunay triangulation and witness complex in the plane, 2008
Encyclopedia
top
