{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:32Z","timestamp":1725549692744},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_19","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"205-217","source":"Crossref","is-referenced-by-count":19,"title":["Hinged Dissection of Polypolyhedra"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey F.","family":"Lindy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-61332-3_144","volume-title":"Computing and Combinatorics","author":"O. Aichholzer","year":"1996","unstructured":"Aichholzer, O., Aurenhammer, F.: Straight skeletons for general polygonal figures in the plane. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 117\u2013126. Springer, Heidelberg (1996)"},{"issue":"12","key":"19_CR2","first-page":"752","volume":"1","author":"O. Aichholzer","year":"1995","unstructured":"Aichholzer, O., Aurenhammer, F., Alberts, D., G\u00e4rtner, B.: A novel type of skeleton for polygons. Journal of Universal Computer Science\u00a01(12), 752\u2013761 (1995)","journal-title":"Journal of Universal Computer Science"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-46515-7_2","volume-title":"Discrete and Computational Geometry","author":"J. Akiyama","year":"2000","unstructured":"Akiyama, J., Nakamura, G.: Dudeney dissection of polygons. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 14\u201329. Springer, Heidelberg (2000)"},{"issue":"9","key":"19_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01782475","volume":"12","author":"E.M. Arkin","year":"1996","unstructured":"Arkin, E.M., Held, M., Mitchell, J.S.B., Skiena, S.S.: Hamiltonian triangulations for fast rendering. The Visual Computer\u00a012(9), 429\u2013444 (1996)","journal-title":"The Visual Computer"},{"key":"19_CR5","unstructured":"Boltianskii, V.G.: Hilbert\u2019s Third Problem. V. H. Winston & Sons (1978)"},{"key":"19_CR6","unstructured":"Cheng, S.-W., Vigneron, A.: Motorcycle graphs and straight skeletons. In: Proc. 13th Ann. ACM-SIAM Sympos. Discrete Algorithms, pp. 156\u2013165 (2002)"},{"key":"19_CR7","unstructured":"Demaine, E.D., Demaine, M.L., Eppstein, D., Frederickson, G.N., Friedman, E.: Hinged dissection of polyominoes and polyforms. Computational Geometry: Theory and Applications (to appear) \n                    \n                      http:\/\/arXiv.org\/abs\/cs.CG\/9907018"},{"key":"19_CR8","unstructured":"Dudeney, H.E.: Puzzles and prizes. Weekly Dispatch, April 6 (1902)"},{"key":"19_CR9","unstructured":"Eppstein, D.: Hinged kite mirror dissection (June 2001), \n                    \n                      http:\/\/arXiv.org\/abs\/cs.CG\/0106032"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/PL00009479","volume":"22","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D., Erickson, J.: Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions. Discrete & Computational Geometry\u00a022(4), 569\u2013592 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR11","unstructured":"Erickson, J.: Personal communication (February 2000)"},{"key":"19_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574917","volume-title":"Dissections: Plane and Fancy","author":"G.N. Frederickson","year":"1997","unstructured":"Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge Univ. Press, Cambridge (1997)"},{"key":"19_CR13","volume-title":"Hinged Dissections: Swinging & Twisting","author":"G.N. Frederickson","year":"2002","unstructured":"Frederickson, G.N.: Hinged Dissections: Swinging & Twisting. Cambridge Univ. Press, Cambridge (2002)"},{"key":"19_CR14","unstructured":"Griffith, S.: Growing Machines. PhD thesis, MIT Media Laboratory, September 2004"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1005292125553","volume":"80","author":"E. Kranakis","year":"2000","unstructured":"Kranakis, E., Krizanc, D., Urrutia, J.: Efficient regular polygon dissections. Geometriae Dedicata\u00a080, 247\u2013262 (2000)","journal-title":"Geometriae Dedicata"},{"key":"19_CR16","unstructured":"Lowry, M.: Solution to question 269, [proposed] by Mr. W. Wallace. In: T.\u00a0Leybourn, ed., Mathematical Repository, vol.\u00a03, part\u00a01, pp.\u00a044\u201346. W. Glendinning (1814)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"14508","DOI":"10.1021\/ja021043d","volume":"124","author":"C. Mao","year":"2002","unstructured":"Mao, C., Thallidi, V.R., Wolfe, D.B., Whitesides, S., Whitesides, G.M.: Dissections: Self-assembled aggregates that spontaneously reconfigure their structures when their environment changes. J. Amer. Chemical Soc.\u00a0124, 14508\u201314509 (2002)","journal-title":"J. Amer. Chemical Soc."},{"key":"19_CR18","unstructured":"Palmer, L.: The helium stockpile: Under shifting conditions of heat and pressure. In: Installation, Radcliffe College, Cambridge, Massachusetts (April 2004)"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/504729.504752","volume":"45","author":"D. Rus","year":"2002","unstructured":"Rus, D., Butler, Z., Kotay, K., Vona, M.: Self-reconfiguring robots. Communications of the ACM\u00a045(3), 39\u201345 (2002)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:53Z","timestamp":1605643793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11534273_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}