| |
| | Reciprocal Polyhedra |
 | | Regular map: a map is said to be regular, of type {p,q} if there are p vertices and p edges for each face, q edges and q faces at each vertex, arranged symmetrically in a sense that can be made precise. |
 | | In Maple, one can define a duality of a regular polyhedron or Archimedean solid via the command duality(dualp,p,s); where dualp is the name of the reciprocal polyhedron of the given polyhedron p with respect to the sphere s which is concentric with p (i.e., s and p have the same center). |
 | | A given regular polyhedra is closed under duality, i.e., the duality of a regular polyhedron is also a regular polyhedron. |
| www.cecm.sfu.ca /~hle/polyhedra/duality.html (540 words) |
|