Inspired by the question, "Shortest path connecting two opposite points on a cube":

Q. What does the cut locus with respect to one corner of a hypercube in $\mathbb{R}^d$ look like?

"The cut locus from a point $p$ on a surface is the closure of the set of all points that have at least two shortest paths connecting them to $p$."1

Here it is for $d=3$:

          Cut locus with respect to vertex $0$ is a star-tree rooted at vertex $6$.

1Itoh, Jin-ichi, and Robert Sinclair. "Thaw: A tool for approximating cut loci on a triangulation of a surface." Experimental Mathematics 13.3 (2004): 309-325.


Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.