Circle Packing for Origami Design Is Hard
Author(s)
Demaine, Erik D; Fekete, Sandor P.; Lang, Robert J.
DownloadSubmitted version (166.7Kb)
Terms of use
Metadata
Show full item recordAbstract
Over the past 20 years, the world of origami has been changed by the introduction of design algorithms that bear a close relationship to, if not outright ancestry from, computational geometry. One of the first robust algorithms for origami design was the circle/river method (also called the tree method) developed independently by Lang [Lang 94,Lang 97,Lang 96] and Meguro [Meguro 92,Meguro 94]. This algorithm and its variants provide a systematic method for folding any structure that topologically resembles a graph theoretic weighted tree. Other algorithms followed, notably one by Tachi [Tachi 09] that gives the crease pattern to fold an arbitrary 3D surface.
Date issued
2011-06-21Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Origami5: Fifth International Meeting of Origami Science, Mathematics, and Education
Publisher
AK Peters, Ltd. / CRC Press
Citation
Demaine, Erik D. et al."Circle Packing for Origami Design Is Hard." Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education. Edited by Patsy Wang-Iverson et al., CRC Press, 2011: 609-626
Version: Author's final manuscript
ISBN
9781568817149
9781439873502
9780429106576