|
|
|
|
|
Nattawut Phetmak and Jittat Fakcharoenphol
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. This ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, and Mohammad R. Salavatipour
Pág. 1464 - 1483
|
|
|
|
|
|
|
|
|
|
|
Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Ptracu
Pág. 240 - 251
|
|
|
|
|
|
|
|
|
|
|
Arkin, Esther M, Bender, Michael A, Demaine, Erik D, Fekete, S ndor P, Mitchell, Joseph S B, Sethia, Saurabh
Pág. 531 - 566
|
|
|
|
|
|
|
|
|
|
|
Hossain, S. Alam, S. M. N. Lin, C. K. Demaine, H. Khan, Y. S. A. Das, N. G. Rour, M. A.
Pág. 35 - 44
|
|
|
|
|
|
|
|
|
|
|
Demaine, E D; Foster, I; Kesselman, C; Snir, M
Pág. 610 - 616
|
|
|
|
|
|