Affiliation:
1. Faculty of Computer Engineering, Kasetsart University, Bangkok 10900, Thailand
Abstract
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 problem is an extended version of a problem by Akitaya, Ballinger, Demaine, Hull, and Schmidt that only folds corners of the polygon. To find the region, we prove structural properties of intersections of parabola-bounded regions and use them to devise a linear-time algorithm. We also prove a structural result regarding the complexity of the safe region as a variable of the location of point f, i.e., the number of arcs of the safe region can be determined using the straight skeleton of the polygon P.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference20 articles.
1. Lang, R.J. (2009, January 8–10). Computational Origami: From Flapping Birds to Space Telescopes. Proceedings of the Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry (SCG ’09), Aarhus, Denmark.
2. Demaine, E.D., and O’Rourke, J. (2008). Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press. reprint ed.
3. Hull, T.C. (2020). Origametry: Mathematical Methods in Paper Folding, Cambridge University Press.
4. Akitaya, H.A., Ballinger, B., Demaine, E.D., Hull, T.C., and Schmidt, C. (2021, January 10–12). Folding Points to a Point and Lines to a Line. Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021), Halifax, NS, Canada.
5. Simple Folding is Really Hard;Akitaya;J. Inf. Process.,2017