Origamizer: A practical algorithm for folding any polyhedron
© Erik D. Demaine and Tomohiro Tachi. It was established at SoCG'99 that every polyhedral complex can be folded from a sufficiently large square of paper, but the known algorithms are extremely impractical, wasting most of the material and making folds through many layers of paper. At a deeper...
Main Authors: | Demaine, Erik, Tachi, Tomohiro |
---|---|
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137685 |
Similar Items
-
Origamizer: A practical algorithm for folding any polyhedron
by: Demaine, Erik, et al.
Published: (2021) -
Universal hinge patterns for folding strips efficiently into any grid polyhedron
by: Demaine, Erik D, et al.
Published: (2021) -
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
by: Benbernou, Nadia M., et al.
Published: (2021) -
(Non)Existence of Pleated Folds: How Paper Folds Between Creases
by: Demaine, Erik D., et al.
Published: (2012) -
CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION
by: Butler, Steven Kay, et al.
Published: (2019)