Common EdgeUnzippings for Tetrahedra
Abstract
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.
 Publication:

arXiv eprints
 Pub Date:
 May 2011
 arXiv:
 arXiv:1105.5401
 Bibcode:
 2011arXiv1105.5401O
 Keywords:

 Computer Science  Computational Geometry;
 Computer Science  Discrete Mathematics;
 F.2.2
 EPrint:
 9 pages, 4 figures. Version 2 simplifies one proof