Common Edge-Unzippings for Tetrahedra

Details Common Edge-Unzippings for Tetrahedra Common Edge-Unzippings for Tetrahedra

2011-05-26

arxiv.org/abs/1105.5401v2

Computer Science

Computational Geometry

9 pages, 4 figures. Version 2 simplifies one proof

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Common Edge-Unzippings for Tetrahedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Common Edge-Unzippings for Tetrahedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Common Edge-Unzippings for Tetrahedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663858