pith. sign in

arxiv: 1502.01036 · v1 · pith:K4NARZNHnew · submitted 2015-02-03 · 🧮 math.DG

The distance from a point to its opposite along the surface of a box

classification 🧮 math.DG
keywords timesalongdistancefacefacespointregionsspider
0
0 comments X
read the original abstract

Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we can assume that the box has dimensions $1\times a\times b$ with the spider on one of the $1\times a$ faces (with $a\leq 1$). The shortest path between the points is always a line segment for some planar flattening of the box by cutting along edges. We then partition the $1\times a$ face into regions, depending on which faces this path traverses. This choice of faces determines an algebraic distance formula in terms of $a$, $b$, and suitable coordinates imposed on the face. We then partition the set of pairs $(a,b)$ by homeomorphism of the borders of the $1\times a$ face's regions and a labeling of these regions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.