An algorithmic study of manufacturing paperclips and other folded structures

Computational Geometry: Theory and Applications

Volumn 25, Issue 1-2, 2003, Pages 117-138

  Arkin, Esther M ^a   Fekete, Sándor P ^b   Mitchell, Joseph S B ^a  

^a Stony Brook University   (United States)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Folding; Linkages; Manufacturing; NP complete; NP hard; Polygons; Process planning; Wire bending

Indexed keywords

EID: 84867969481     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00133-5     Document Type: Article

References (36)

1. E.M. Arkin, M.A. Bender, E.D. Demaine, M.L. Demaine, J.S.B. Mitchell, S. Sethia, and S.S. Skiena When can you fold a map? F. Dehne, J.-R. Sack, R. Tamassia, Proceedings of the 7th Workshop on Algorithms and Data Structures (WADS 2001) Lecture Notes in Computer Science 2125 2001 Providence RI 401 413
2. B. Aronov, and J. O'Rourke Nonoverlap of the star unfolding Discrete Comput. Geom. 8 1992 219 250
3. V. Ayyadevara, D. Bourne, K. Shimada, and R.H. Sturges Determining near optimal interference-free polyhedral configurations for stacking Proceedings of IEEE International Symposium on Assembly and Task Planning 1999 286 293
4. M. Bern, E.D. Demaine, D. Eppstein, E. Kuo, A. Mantler, and J. Snoeyink Ununfoldable polyhedra with convex faces Computational Geometry 24 2003 51 62
5. M. Bern, and B. Hayes The complexity of flat origami Proc. 7th ACM-SIAM Sympos. Discrete Algorithms 1996 175 183
6. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides Locked and unlocked polygonal chains in 3D Proc. 10th ACM-SIAM Sympos. Discrete Algorithms 1999 866 867
7. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides Locked and unlocked polygonal chains in 3D Discrete Comput. Geom. 26 3 2001 269 281
8. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides A note on reconfiguring tree linkages: Trees can lock Discrete Appl. Math. 117 1-3 2002 293 297
9. T. Biedl, E. Demaine, M. Demaine, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, and S. Whitesides Unfolding some classes of orthogonal polyhedra Proc. 10th Canad. Conf. Comput. Geom. 1998 70 71 Fuller version in Elec. Proc. http://cgm.cs.mcgill.ca/cccg98/proceedings/welcome.hml
10. D. Bourne, and C.-H. Wang Design and manufacturing of sheet metal parts: Using features to resolve manufacturability problems A. Busnaina, Computer in Engineering 1995 ASME New York 745 753
11. R. Connelly, E. Demaine, and G. Rote Every polygon can be untangled Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci. 2000 432 442
12. L.J. de Vin, J. de Vries, A.H. Streppel, and H.J.J. Kals PART-S, a CAPP system for small batch manufacturing of sheet metal components Proc. of the 24th CIRP International Seminar on Manufacturing Systems 1992 171 182
13. E.D. Demaine, Folding and Unfolding, PhD Thesis, Department of Computer Science, University of Waterloo, 2001
14. E.D. Demaine, M.L. Demaine, and A. Lubiw Folding and one straight cut suffice Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg. 1999 891 892
15. E.D. Demaine, M.L. Demaine, and J.S.B. Mitchell Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami Computational Geometry 16 1 2000 3 21
16. M.T. Goodrich, and R. Tamassia Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations J. Algorithms 23 1997 51 73
17. S.K. Gupta, D.A. Bourne, K.H. Kim, and S.S. Krishnan Automated process planning for sheet metal bending operations J. Manufacturing Systems 17 5 1998 338 360
18. T. Hull On the mathematics of flat origamis Congr. Numer. 100 1994 215 224
19. K.K. Kim, D. Bourne, S. Gupta, and S.S. Krishnan Automated process planning for robotic sheet metal bending operations J. Manufacturing Syst. 17 5 1998 338 360
20. R.J. Lang Mathematical algorithms for origami design Symmetry: Culture and Science 5 2 1994 115 152
21. R.J. Lang A computational algorithm for origami design Proc. 12th Annu. ACM Sympos. Comput. Geom. 1996 98 105
22. W.J. Lenhart, and S.H. Whitesides Turning a polygon inside-out Proc. 3rd Canad. Conf. Comput. Geom. 1991 66 69
23. W.J. Lenhart, and S.H. Whitesides Reconfiguring closed polygonal chains in Euclidean d-space Discrete Comput. Geom. 13 1995 123 140
24. L. Lu, and S. Akella Folding cartons with fixtures: A motion planning approach Proc. 1999 IEEE International Conference on Robotics and Automation Detroit, MI 1999 1570 1576
25. A. Lubiw, J. O'Rourke, When can a polygon fold to a polytope? Technical Report 048, Dept. Comput. Sci., Smith College, June 1996. Presented at AMS Conf., 5 October 1996
26. M. Namiki, K. Fukuda, Unfolding 3-dimensional convex polytopes: A package for Mathematica 1.2 or 2.0, Mathematica Notebook, Univ. of Tokyo, 1993
27. J. O'Rourke Computational geometry column 33 Internat. J. Comput. Geom. Appl. 8 1999 381 384 Also in SIGACT News 29 2 1998 12 16 Issue 107
28. J. O'Rourke Folding and unfolding in computational geometry J. Akiyama, M. Kano, M. Urabe, Proc. Japan Conf. Discrete and Computational Geometry, Tokyo, Japan, 9-12 December 1998 Lecture Notes in Computer Science 1763 2000 Springer-Verlag Berlin 258 266
29. N. Pei, and S. Whitesides On the reachable regions of chains Proc. 8th Canad. Conf. Comput. Geom. 1996 161 166
30. N. Pei, and S. Whitesides On folding rulers in regular polygons Proc. 9th Canad. Conf. Comput. Geom. 1997 11 16
31. C. Schevon, J. O'Rourke. A conjecture on random unfoldings, Technical Report JHU-87/20, Johns Hopkins Univ., Baltimore, MD, 1987
32. I. Streinu A combinatorial approach to planar non-colliding robot arm motion planning Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci. 2000 443 453
33. M. van Kreveld, J. Snoeyink, and S. Whitesides Folding rulers inside triangles Discrete Comput. Geom. 15 1996 265 285
34. C.-H. Wang, Manufacturability-driven decomposition of sheet metal products, PhD Thesis, Carnegie Mellon University, The Robotics Institute, 1997
35. C.-H. Wang, and D. Bourne Concurrent decomposition for sheet metal products ASME Design Engineering Technical Conference, Sacramento 1997
36. C.-H. Wang, and R.H. Sturges Bendcad: A design system for concurrent multiple representations of parts J. Intelligent Manufacturing 7 1996 133 144