Recent Results in Computational Origami (2001)
| Venue: | In Proceedings of the 3rd International Meeting of Origami Science, Math, and Education |
| Citations: | 17 - 3 self |
BibTeX
@INPROCEEDINGS{Demaine01recentresults,
author = {Erik D. Demaine and Martin L. Demaine},
title = {Recent Results in Computational Origami},
booktitle = {In Proceedings of the 3rd International Meeting of Origami Science, Math, and Education},
year = {2001},
pages = {3--16}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Computational origami is a recent branch of computer science studying efficient algorithms for solving paper-folding problems. This field essentially began with Robert Lang's work on algorithmic origami design [25], starting around 1993. Since then, the field of computational origami has grown significantly. The purpose of this paper is to survey the work in the field, with a focus on recent results, and to present several open problems that remain. The survey cannot hope to be complete, but we attempt to cover most areas of interest.
