2011/05/26 by Joseph O’Rourke, O'Rourke, Joseph
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Logic, programming, and type systems #Model-Driven Software Engineering Techniques
paper · pdf · doi:10.48550/arxiv.1105.5401
openalex publication_date 2011/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.