Home > Science > Mathematics > Geometry > Polyhedra and Polytopes
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 ...
www.btinternet.com/~se16/js/circumnavcubetetra.htm
Post a Review
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Do you have experience with or are you familiar with this website? Please post your comments / review below to share with the rest of the community.
Please note, all comments are subject to review and can be removed at any time for any reason.
Disclaimer: eiNET is not affiliated in any way with the Circumnavigating a cube and a tetrahedron (www.btinternet.com/~se16/js/circumnavcubetetra.htm) website.
Views and opinions expressed may not be representative of eiNET or its owners but all effort is made to keep the site free of obscenities, illegal or otherwise malicious activity.
Are you the owner of this site? You can manage your listing here.