{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:21Z","timestamp":1725516801142},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_37","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"374-384","source":"Crossref","is-referenced-by-count":1,"title":["On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees"],"prefix":"10.1007","author":[{"given":"Sheung-Hung","family":"Poon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., Knauer, C., Rote, G., Whitesides, S.: The Complexity of (Un)folding. In: Proc. of 19th ACM Symp. on Comput. Geom., pp. 164\u2013170 (2003)","DOI":"10.1145\/777792.777818"},{"issue":"1-3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0166-218X(01)00229-3","volume":"117","author":"T. Biedl","year":"2002","unstructured":"Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O\u2019Rourke, J., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A Note on Reconfiguring Tree Linkages: Trees Can Lock. Disc. Appl. Math.\u00a0117(1-3), 293\u2013297 (2002)","journal-title":"Disc. Appl. Math."},{"issue":"3","key":"37_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00454-001-0038-7","volume":"26","author":"T. Biedl","year":"2001","unstructured":"Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O\u2019Rourke, J., Overmars, M., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: Locked and Unlocked Polygonal Chains in Three Dimensions. Disc. & Comput. Geom.\u00a026(3), 269\u2013281 (2001)","journal-title":"Disc. & Comput. Geom."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Cantarella, J., Demaine, E.D., Iben, H., O\u2019Brien, J.: An Energy-Driven Approach to Linkage Unfolding. In: Proc. of 20th Ann. ACM Symp. on Comput. Geom., pp. 134\u2013143 (2004)","DOI":"10.1145\/997817.997840"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0925-7721(01)00013-X","volume":"20","author":"R. Cocan","year":"2001","unstructured":"Cocan, R., O\u2019Rourke, J.: Polygonal Chains Cannot Lock in 4D. Comput. Geom.: Theory & Appl.\u00a020, 105\u2013129 (2001)","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Connelly, R., Demaine, E., Rote, G.: Infinitesimally Locked Self-Touching Linkages with Applications to Locked Trees. In: Physical Knots: Knotting, Linking, and Folding of Geometric Objects in R 3, American Mathematical Society, pp. 287\u2013311 (2002)","DOI":"10.1090\/conm\/304\/05200"},{"issue":"2","key":"37_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00454-003-0006-7","volume":"30","author":"R. Connelly","year":"2003","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Disc. & Comput. Geom.\u00a030(2), 205\u2013239 (2003)","journal-title":"Disc. & Comput. Geom."},{"key":"37_CR8","unstructured":"Damian, M., Flatland, R., Meijer, H., O\u2019Rourke, J.: Unfolding Well-Separated Orthotrees. In: Proc. of 15th Ann. Fall Workshop on Comput. Geom., pp. 23\u201325 (2005)"},{"key":"37_CR9","unstructured":"Damian, M., Flatland, R., O\u2019Rourke, J.: Unfolding Manhattan Towers. In: Proc. 17th Canadian Conference on Computational Geometry, pp. 211\u2013214 (2005)"},{"issue":"31","key":"37_CR10","doi-asserted-by":"publisher","first-page":"7133","DOI":"10.1021\/bi00483a001","volume":"29","author":"K.A. Dill","year":"1990","unstructured":"Dill, K.A.: Dominant Forces in Protein Folding. Biochemistry\u00a029(31), 7133\u20137155 (1990)","journal-title":"Biochemistry"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1511\/1998.3.216","volume":"86","author":"B. Hayes","year":"1998","unstructured":"Hayes, B.: Prototeins. American Scientist\u00a086, 216\u2013221 (1998)","journal-title":"American Scientist"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Poon, S.-H.: On Straightening Low-Diameter Unit Trees. In: Proc. of 13th Int. Symp. on Graph Drawing, pp. 519\u2013521 (2005)","DOI":"10.1007\/11618058_51"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11809678_21","volume-title":"Computing and Combinatorics","author":"S.-H. Poon","year":"2006","unstructured":"Poon, S.-H.: On Unfolding Lattice Polygons\/Trees and Diameter-4 Trees. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 186\u2013195. Springer, Heidelberg (2006)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A Combinatorial Approach for Planar Non-Colliding Robot Arm Motion Planning. In: Proc. of FOCS 2000, pp. 443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:17Z","timestamp":1605762137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}