Making Polygons by Simple Folds and One Straight Cut
We give an efficient algorithmic characterization of simple polygons whose edges can be aligned onto a common line, with nothing else on that line, by a sequence of all-layers simple folds. In particular, such alignments enable the cutting out of the polygon and its complement with one complete straight cut. We also show that these makeable polygons include all convex polygons possessing a line of symmetry.
KeywordsConvex Hull Convex Polygon Steiner Point Simple Polygon Polygonal Line
Unable to display preview. Download preview PDF.
- 2.Bern, M., Demaine, E., Eppstein, D., Hayes, B.: A disk-packing algorithm for an origami magic trick. In: Origami3: Proceedings of the 3rd International Meeting of Origami Science, Math, and Education, Monterey, California, pp. 17–28 (March 2001); Improvement of version appearing in Proceedings of the International Conference on Fun with Algorithms, Isola d’Elba, Italy, pp. 32–42 (June 1998) Google Scholar
- 5.Demaine, E.D., Devadoss, S.L., Mitchell, J.S.B., O’Rourke, J.: Continuous foldability of polygonal paper. In: Proceedings of the 16th Canadian Conference on Computational Geometry, Montréal, Canada, pp. 64–67 (August 2004)Google Scholar
- 6.Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press (July 2007)Google Scholar