{"id":92125,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00092125","sets":["581:7002:7170"]},"path":["7170"],"owner":"11","recid":"92125","title":["A Picturesque Maze Generation Algorithm with Any Given Endpoints"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-05-15"},"_buckets":{"deposit":"c8b7f345-6637-4809-aee3-86a8e7ceb5ac"},"_deposit":{"id":"92125","pid":{"type":"depid","value":"92125","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"A Picturesque Maze Generation Algorithm with Any Given Endpoints","author_link":["358454","358453"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Picturesque Maze Generation Algorithm with Any Given Endpoints"},{"subitem_title":"A Picturesque Maze Generation Algorithm with Any Given Endpoints","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：パズルの数理] picturesque maze, 2-edge-connectivity, given endpoints","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2013-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTT Secure Platform Laboratories"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Secure Platform Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/92125/files/IPSJ-JNL5405004.pdf","label":"IPSJ-JNL5405004"},"date":[{"dateType":"Available","dateValue":"2015-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5405004.pdf","filesize":[{"value":"975.3 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d0dc99d1-fa89-4d56-87e3-1256145479b7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koki, Hamada"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koki, Hamada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"A picturesque maze is a kind of maze in which the solution path reveals a hidden black-and-white raster image. We propose here an algorithm to generate a picturesque maze of a given black-and-white raster image. Okamoto and Uehara proposed an algorithm to generate a picturesque maze by turning each original pixel into a 2-by-2 set of pixels. One drawback of the method is that the entrance and the exit are always adjacent. We propose a simple algorithm to generate a picturesque maze with any given endpoints for a 2-edge-connected input image.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.21(2013) No.3 (online)\nDOI http://dx.doi.org/10.2197/ipsjjip.21.393\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A picturesque maze is a kind of maze in which the solution path reveals a hidden black-and-white raster image. We propose here an algorithm to generate a picturesque maze of a given black-and-white raster image. Okamoto and Uehara proposed an algorithm to generate a picturesque maze by turning each original pixel into a 2-by-2 set of pixels. One drawback of the method is that the entrance and the exit are always adjacent. We propose a simple algorithm to generate a picturesque maze with any given endpoints for a 2-edge-connected input image.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.21(2013) No.3 (online)\nDOI http://dx.doi.org/10.2197/ipsjjip.21.393\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2013-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"54"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T06:48:26.202074+00:00","created":"2025-01-18T23:41:08.791019+00:00","links":{}}