{"id":95744,"updated":"2025-01-21T13:37:13.203826+00:00","links":{},"created":"2025-01-18T23:42:45.225206+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00095744","sets":["1164:2592:7086:7297"]},"path":["7297"],"owner":"11","recid":"95744","title":["Bumpy Pyramid Folding Problem"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-10-30"},"_buckets":{"deposit":"b0d9ec0f-2c8d-485f-bc17-207eb3b8a7b2"},"_deposit":{"id":"95744","pid":{"type":"depid","value":"95744","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Bumpy Pyramid Folding Problem","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Bumpy Pyramid Folding Problem"},{"subitem_title":"Bumpy Pyramid Folding Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2013-10-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematics, MIT"},{"subitem_text_value":"Computer Science and Artificial Intelligence Laboratory, MIT"},{"subitem_text_value":"Computer Science and Artificial Intelligence Laboratory, MIT"},{"subitem_text_value":"School of Informatics and Engineering, The University of Electro-Communications"},{"subitem_text_value":"Department of Computer Science, The University of North Carolina"},{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematics, MIT","subitem_text_language":"en"},{"subitem_text_value":"Computer Science and Artificial Intelligence Laboratory, MIT","subitem_text_language":"en"},{"subitem_text_value":"Computer Science and Artificial Intelligence Laboratory, MIT","subitem_text_language":"en"},{"subitem_text_value":"School of Informatics and Engineering, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of North Carolina","subitem_text_language":"en"},{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/95744/files/IPSJ-AL13145019.pdf"},"date":[{"dateType":"Available","dateValue":"2015-10-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL13145019.pdf","filesize":[{"value":"715.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fd8b8f68-5dbf-4647-953e-2f100bd93915","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"ZacharyR.Abel"},{"creatorName":"ErikD.Demaine"},{"creatorName":"MartinL.Demaine"},{"creatorName":"Hiro, Ito"},{"creatorName":"Jack, Snoeyink"},{"creatorName":"Ryuhei, Uehara"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Zachary, R.Abel","creatorNameLang":"en"},{"creatorName":"Erik, D.Demaine","creatorNameLang":"en"},{"creatorName":"Martin, L.Demaine","creatorNameLang":"en"},{"creatorName":"Hiro, Ito","creatorNameLang":"en"},{"creatorName":"Jack, Snoeyink","creatorNameLang":"en"},{"creatorName":"Ryuhei, Uehara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Folding problems are investigated for a class of petal (or star-like) polygons P, with an n-polygonal base B surrounded by a sequence of triangles for which adjacent pairs of sides have equal length. Linear time algorithms using constant precision are given to determine if P can fold to a pyramid with flat base B, and to determine a triangulation of B (crease pattern) that allows folding into a bumpy pyramid that is convex. By Alexandrov's theorem, the crease pattern is unique if it exists, but the general algorithm known for this theorem is pseudo-polynomial, with very large running time; ours is the first efficient algorithm for Alexandrov's theorem for a special class of polyhedra. We also show a polynomial time algorithm that finds the crease pattern to produce the maximum volume bumpy pyramid.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Folding problems are investigated for a class of petal (or star-like) polygons P, with an n-polygonal base B surrounded by a sequence of triangles for which adjacent pairs of sides have equal length. Linear time algorithms using constant precision are given to determine if P can fold to a pyramid with flat base B, and to determine a triangulation of B (crease pattern) that allows folding into a bumpy pyramid that is convex. By Alexandrov's theorem, the crease pattern is unique if it exists, but the general algorithm known for this theorem is pseudo-polynomial, with very large running time; ours is the first efficient algorithm for Alexandrov's theorem for a special class of polyhedra. We also show a polynomial time algorithm that finds the crease pattern to produce the maximum volume bumpy pyramid.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2013-10-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19","bibliographicVolumeNumber":"2013-AL-145"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}