When Can You Fold a Map?
暂无分享,去创建一个
Steven Skiena | Esther M. Arkin | Joseph S. B. Mitchell | Michael A. Bender | Erik D. Demaine | Martin L. Demaine | Saurabh Sethia
[1] Esther M. Arkin,et al. An algorithmic study of manufacturing paperclips and other folded structures , 2002, Comput. Geom..
[2] P. Di Francesco,et al. Folding and coloring problems in mathematics and physics , 2000 .
[3] Robert J. Lang,et al. A computational algorithm for origami design , 1996, SCG '96.
[4] Marshall W. Bern,et al. The complexity of flat origami , 1996, SODA '96.
[5] John E. Koehler. Folding a strip of stamps , 1968 .
[6] Richard M. Karp,et al. Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..
[7] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[8] Joseph S. B. Mitchell,et al. Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami , 2000, Comput. Geom..
[9] Mihalis Yannakakis,et al. On the Complexity of Protein Folding , 1998, J. Comput. Biol..
[10] Liang Lu,et al. Folding cartons with fixtures: a motion planning approach , 1999, IEEE Trans. Robotics Autom..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[13] Uzi Vishkin,et al. On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.
[14] W. F. Lunnon. A map-folding problem , 1968 .
[15] Joseph S. B. Mitchell,et al. Reaching folded states of a rectangular piece of paper , 2001, Canadian Conference on Computational Geometry.
[16] W. F. Lunnon. Multi-Dimensional Map-Folding , 1971, Comput. J..
[17] Mikkel Thorup,et al. Faster deterministic sorting and priority queues in linear space , 1998, SODA '98.
[18] M. Farach. Optimal suffix tree construction with large alphabets , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[19] Thomas C. Hull. On the Mathematics of Flat Origamis , 1994 .
[20] Mihalis Yannakakis,et al. On the complexity of protein folding (abstract) , 1998, RECOMB '98.
[21] Toshikazu Kawasaki. On relation between mountain-creases and valley -creases of a flat origami , 1990 .