{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:54Z","timestamp":1758823734969,"version":"3.30.2"},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0925-7721(02)00133-5","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:00:13Z","timestamp":1046440813000},"page":"117-138","source":"Crossref","is-referenced-by-count":9,"title":["An algorithmic study of manufacturing paperclips and other folded structures"],"prefix":"10.1016","volume":"25","author":[{"given":"Esther M","family":"Arkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor P","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S.B","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00133-5_BIB001","series-title":"Proceedings of the 7th Workshop on Algorithms and Data Structures (WADS 2001)","first-page":"401","article-title":"When can you fold a map?","volume":"2125","author":"Arkin","year":"2001"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB002","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02293047","article-title":"Nonoverlap of the star unfolding","volume":"8","author":"Aronov","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00133-5_BIB003","series-title":"Proceedings of IEEE International Symposium on Assembly and Task Planning","first-page":"286","article-title":"Determining near optimal interference-free polyhedral configurations for stacking","author":"Ayyadevara","year":"1999"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB004","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0925-7721(02)00091-3","article-title":"Ununfoldable polyhedra with convex faces","volume":"24","author":"Bern","year":"2003","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB005","series-title":"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms","first-page":"175","article-title":"The complexity of flat origami","author":"Bern","year":"1996"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB006","series-title":"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms","first-page":"866","article-title":"Locked and unlocked polygonal chains in 3D","author":"Biedl","year":"1999"},{"issue":"3","key":"10.1016\/S0925-7721(02)00133-5_BIB007","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00454-001-0038-7","article-title":"Locked and unlocked polygonal chains in 3D","volume":"26","author":"Biedl","year":"2001","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"10.1016\/S0925-7721(02)00133-5_BIB008","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0166-218X(01)00229-3","article-title":"A note on reconfiguring tree linkages: Trees can lock","volume":"117","author":"Biedl","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(02)00133-5_BIB009","series-title":"Proc. 10th Canad. Conf. Comput. Geom.","first-page":"70","article-title":"Unfolding some classes of orthogonal polyhedra","author":"Biedl","year":"1998"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB010","series-title":"Computer in Engineering","first-page":"745","article-title":"Design and manufacturing of sheet metal parts: Using features to resolve manufacturability problems","author":"Bourne","year":"1995"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB011","series-title":"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"432","article-title":"Every polygon can be untangled","author":"Connelly","year":"2000"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB012","series-title":"Proc. of the 24th CIRP International Seminar on Manufacturing Systems","first-page":"171","article-title":"PART-S, a CAPP system for small batch manufacturing of sheet metal components","author":"de Vin","year":"1992"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB013","doi-asserted-by":"crossref","unstructured":"E.D. Demaine, Folding and Unfolding, PhD Thesis, Department of Computer Science, University of Waterloo, 2001","DOI":"10.1007\/3-540-47738-1_9"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB014","series-title":"Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg.","first-page":"891","article-title":"Folding and one straight cut suffice","author":"Demaine","year":"1999"},{"issue":"1","key":"10.1016\/S0925-7721(02)00133-5_BIB015","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(99)00056-5","article-title":"Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami","volume":"16","author":"Demaine","year":"2000","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB016","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/jagm.1995.0797","article-title":"Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations","volume":"23","author":"Goodrich","year":"1997","journal-title":"J. Algorithms"},{"issue":"5","key":"10.1016\/S0925-7721(02)00133-5_BIB017","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0278-6125(98)80002-2","article-title":"Automated process planning for sheet metal bending operations","volume":"17","author":"Gupta","year":"1998","journal-title":"J. Manufacturing Systems"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB018","first-page":"215","article-title":"On the mathematics of flat origamis","volume":"100","author":"Hull","year":"1994","journal-title":"Congr. Numer."},{"issue":"5","key":"10.1016\/S0925-7721(02)00133-5_BIB019","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0278-6125(98)80002-2","article-title":"Automated process planning for robotic sheet metal bending operations","volume":"17","author":"Kim","year":"1998","journal-title":"J. Manufacturing Syst."},{"issue":"2","key":"10.1016\/S0925-7721(02)00133-5_BIB020","first-page":"115","article-title":"Mathematical algorithms for origami design","volume":"5","author":"Lang","year":"1994","journal-title":"Symmetry: Culture and Science"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB021","series-title":"Proc. 12th Annu. ACM Sympos. Comput. Geom.","first-page":"98","article-title":"A computational algorithm for origami design","author":"Lang","year":"1996"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB022","series-title":"Proc. 3rd Canad. Conf. Comput. Geom.","first-page":"66","article-title":"Turning a polygon inside-out","author":"Lenhart","year":"1991"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB023","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02574031","article-title":"Reconfiguring closed polygonal chains in Euclidean d-space","volume":"13","author":"Lenhart","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00133-5_BIB024","series-title":"Proc. 1999 IEEE International Conference on Robotics and Automation Detroit, MI","first-page":"1570","article-title":"Folding cartons with fixtures: A motion planning approach","author":"Lu","year":"1999"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB025","unstructured":"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"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB026","unstructured":"M. Namiki, K. Fukuda, Unfolding 3-dimensional convex polytopes: A package for Mathematica 1.2 or 2.0, Mathematica Notebook, Univ. of Tokyo, 1993"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB027","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1142\/S0218195998000199","article-title":"Computational geometry column 33","volume":"8","author":"O'Rourke","year":"1999","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(02)00133-5_BIB028","series-title":"Proc. Japan Conf. Discrete and Computational Geometry, Tokyo, Japan, 9\u201312 December 1998","first-page":"258","article-title":"Folding and unfolding in computational geometry","volume":"1763","author":"O'Rourke","year":"2000"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB029","series-title":"Proc. 8th Canad. Conf. Comput. Geom.","first-page":"161","article-title":"On the reachable regions of chains","author":"Pei","year":"1996"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB030","series-title":"Proc. 9th Canad. Conf. Comput. Geom.","first-page":"11","article-title":"On folding rulers in regular polygons","author":"Pei","year":"1997"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB031","unstructured":"C. Schevon, J. O'Rourke. A conjecture on random unfoldings, Technical Report JHU-87\/20, Johns Hopkins Univ., Baltimore, MD, 1987"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB032","series-title":"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"443","article-title":"A combinatorial approach to planar non-colliding robot arm motion planning","author":"Streinu","year":"2000"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB033","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02711495","article-title":"Folding rulers inside triangles","volume":"15","author":"van Kreveld","year":"1996","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00133-5_BIB034","doi-asserted-by":"crossref","unstructured":"C.-H. Wang, Manufacturability-driven decomposition of sheet metal products, PhD Thesis, Carnegie Mellon University, The Robotics Institute, 1997","DOI":"10.1115\/DETC97\/DFM-4328"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB035","series-title":"ASME Design Engineering Technical Conference, Sacramento","article-title":"Concurrent decomposition for sheet metal products","author":"Wang","year":"1997"},{"key":"10.1016\/S0925-7721(02)00133-5_BIB036","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00177069","article-title":"Bendcad: A design system for concurrent multiple representations of parts","volume":"7","author":"Wang","year":"1996","journal-title":"J. Intelligent Manufacturing"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001335?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001335?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T21:00:58Z","timestamp":1733950858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0925772102001335"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00133-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}