Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geodesic Folding of Tetrahedron

Published 3 Dec 2019 in cs.CG | (1912.01227v1)

Abstract: In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut along a geodesic strip of triangles to be decomposed and unfolded into one or multiple bands (homeomorphic to a cylinder). The number of bands is the greatest common divisor of the two numbers. By a proper choice of pairs of numbers, we can create a common triangular band that folds into different multiple polyhedra that belongs to the family.

Summary

Whiteboard

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

Open Problems

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

Continue Learning

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

Collections

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