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 with the spider on one of the faces (with ). 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 face into regions, depending on which faces this path traverses. This choice of faces determines an algebraic distance formula in terms of , , and suitable coordinates imposed on the face. We then partition the set of pairs by homeomorphism of the borders of the face's regions and a labeling of these regions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.