|
|
|
|
|
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
|
|
|
|
|