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.
| Keywords | : | |
| file credit | : | Erik D. Demaine et al |
| file type | : | |
| file topic | : | Computer, Engineering |
| rating | : | ![]() ![]() ![]() ![]() ![]() |
| viewed | : | 63 times |
| file address | : |
file link is informed by: , http://
Related posts:
