Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami

Authors:
Erik D. Demaine;Martin L. Demaine;Joseph S. B. Mitchell
Affiliations:
Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;-;Dept. of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
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
The complexity of flat origami

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Power of Non-Rectilinear Holes

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Straight Skeletons for General Polygonal Figures in the Plane

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

Quickest paths, straight skeletons, and the city Voronoi diagram

Proceedings of the eighteenth annual symposium on Computational geometry
Motorcycle graphs and straight skeletons

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
When Can You Fold a Map?

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximate convex decomposition of polygons

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximate convex decomposition of polygons

Computational Geometry: Theory and Applications
Approximate convex decomposition of polygons

Computational Geometry: Theory and Applications
Single-Vertex origami and spherical expansive motions

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

Hi-index	0.01