{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225664","sets":["1164:2592:11085:11247"]},"path":["11247"],"owner":"44499","recid":"225664","title":["Optimal Simple Fold-and-Cut of a Polygonal Line"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-05-03"},"_buckets":{"deposit":"3155911a-9fbe-4cc7-a71d-dc8ae99dcc94"},"_deposit":{"id":"225664","pid":{"type":"depid","value":"225664","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Optimal Simple Fold-and-Cut of a Polygonal Line","author_link":["597625","597626"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Optimal Simple Fold-and-Cut of a Polygonal Line"},{"subitem_title":"Optimal Simple Fold-and-Cut of a Polygonal Line","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-05-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Japan Advanced Institute of Science and Technology"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"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/225664/files/IPSJ-AL23193013.pdf","label":"IPSJ-AL23193013.pdf"},"date":[{"dateType":"Available","dateValue":"2025-05-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23193013.pdf","filesize":[{"value":"1.3 MB"}],"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":"49689351-fe12-446c-97b0-4dfdf6b8ee90","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryuhei, Uehara"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and a polygonal line, which consists of a sequence of line segments, drawn on P. We cut all the line segments by one complete straight cut after overlapping all of them by a sequence of simple foldings. Our goal is to minimize the number of simple foldings to do that. When the polygonal line satisfies some certain geometric conditions, we can find a shortest sequence of simple foldings for the given polygonal line that consists of n line segments in O(n3) time and O(n2) space.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-05-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"13","bibliographicVolumeNumber":"2023-AL-193"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:25:10.137734+00:00","updated":"2025-01-19T12:43:26.098974+00:00","id":225664}