Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Fakcharoenphol, Nattawut Phetmak"'
Publikováno v:
Algorithms; Volume 16; Issue 6; Pages: 281
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. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::44b7119456a1ca2f1ee583e76b23d233
