  The landscapes of a polyhedron are subsets of its nets one must consider to
identify all shortest paths. Landscapes of cubes and tetrahedra have been used
to identify coordinate based formulas for the lengths of the shortest paths
between points on these surfaces. We extend these results to develop formulas
for the lengths of the shortest paths between points on the surface of
octahedra.
