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. © 2011 Springer-Verlag.
CITATION STYLE
Demaine, E. D., Demaine, M. L., Hawksley, A., Ito, H., Loh, P. R., Manber, S., & Stephens, O. (2011). Making polygons by simple folds and one straight cut. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7033 LNCS, pp. 27–43). https://doi.org/10.1007/978-3-642-24983-9_4
Mendeley helps you to discover research relevant for your work.