Circle Packing for Origami Design Is Hard
Name
paper.pdf
Description
Submitted version
Size
166.78 KB
Format
Adobe PDF
Checksum (MD5)
04fea9597161872034d497d5c78c7b77
Author(s)
Demaine, Erik D
Fekete, Sandor P.
Lang, Robert J.
Date Issued
June 21, 2011
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1201/b10971
