Circumnavigating a cube and a tetrahedron
Circumnavigating a cube and a tetrahedron by visiting all of the sides or all of the edges Henry Bottomley September 2001 This page is related to a page on Surface distances on a cube or cuboid Consider the following set of problems for a polyhedron: 1a. What is the shortest possible closed route on the surface of the polyhedron which crosses each face once 1b. What is the shortest possible ...
|
Origami Polyhedra@