Folding Every Point on a Polygon Boundary to a Point

Folding Every Point on a Polygon Boundary to a Point

We consider a problem in computational origami. Given a piece of paper as a convex polygon <i>P</i> and a point <i>f</i> located within, we fold every point on a boundary of <i>P</i> to <i>f</i> and compute a region that is safe from folding, i.e., the...

Full description

Bibliographic Details
Main Authors: Nattawut Phetmak, Jittat Fakcharoenphol
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Algorithms
Subjects:
geometric folding
parabola intersection
computational origami
linear-time algorithms
straight skeletons
Online Access:https://www.mdpi.com/1999-4893/16/6/281

Internet

https://www.mdpi.com/1999-4893/16/6/281

Similar Items