Papers
Topics
Authors
Recent
Search
2000 character limit reached

Common Edge-Unzippings for Tetrahedra

Published 26 May 2011 in cs.CG and cs.DM | (1105.5401v2)

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.

Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Joseph O'Rourke 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up