Folding and one straight cut suffice

Authors:
Erik D. Demaine;Martin L. Demaine;Anna Lubiw
Affiliations:
Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;-;Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

A computational algorithm for origami design

Proceedings of the twelfth annual symposium on Computational geometry
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions

Proceedings of the fourteenth annual symposium on Computational geometry
Folding and Cutting Paper

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Straight Skeletons for General Polygonal Figures in the Plane

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics

Motorcycle graphs and straight skeletons

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithmic study of manufacturing paperclips and other folded structures

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Hi-index	0.00