Two Points on a Polyhedron

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Maze rule: it is possible to move between faces that are neighbors in the polyhedron but are NOT neighbors in the 2D polyhedral net. Find the length of the shortest path between two given points on the polyhedron (count the number of edges crossed on the polyhedron).

Contributed by: Izidor Hafner (January 2012)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.