2000 character limit reached
Geodesic trajectories on regular polyhedra
Published 12 Aug 2015 in math.MG and math.CO | (1508.03546v1)
Abstract: Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive structure of geodesics between vertices on a cube, we prove, in some precise sense, that there are twice as many geodesics between certain pairs of vertices than other pairs. We also obtain the fact that there are no geodesics that start and end at the same vertex on the regular tetrahedron or the cube.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.