Common Edge-Unzippings for Tetrahedra
Computational Geometry
2011-06-09 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1105.5401,
title = {Common Edge-Unzippings for Tetrahedra},
author = {Joseph O'Rourke},
journal= {arXiv preprint arXiv:1105.5401},
year = {2011}
}
Comments
9 pages, 4 figures. Version 2 simplifies one proof