{"links":{},"id":151975,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00151975","sets":["8512:8659:8660:8552:8553"]},"path":["8553"],"owner":"1","recid":"151975","title":["A-001 内部3連結グラフの外6角格子凸描画(A分野:モデル・アルゴリズム・プログラミング,一般論文)"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-08-20"},"_buckets":{"deposit":"72629982-b2a7-42fe-89a6-32ef60efad1f"},"_deposit":{"id":"151975","pid":{"type":"depid","value":"151975","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"A-001 内部3連結グラフの外6角格子凸描画(A分野:モデル・アルゴリズム・プログラミング,一般論文)","author_link":["262909","262910"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A-001 内部3連結グラフの外6角格子凸描画(A分野:モデル・アルゴリズム・プログラミング,一般論文)"},{"subitem_title":"A-001 Outer Hexagonal Convex Grid Drawings of Internally Triconnected Plane Graphs","subitem_title_language":"en"}]},"item_type_id":"26","publish_date":"2013-08-20","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_26_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"福島大学理工学群共生システム理工学類"}]},"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/151975/files/KJ00009336258.pdf"},"date":[{"dateType":"Available","dateValue":"2013-08-20"}],"format":"application/pdf","filename":"KJ00009336258.pdf","filesize":[{"value":"145.6 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"452bf0d2-cafd-4170-be39-b3d2ca2c5363","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by IEICE,IPSJ"}]},"item_26_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"三浦, 一之"}],"nameIdentifiers":[{}]}]},"item_26_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Miura, Kazuyuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_26_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA1242354X","subitem_source_identifier_type":"NCID"}]},"item_26_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"平面グラフGの凸描画においては,全ての辺は交差しない直線分で描かれ,全ての面は凸多角形で描かれる.Gの凸描画で,各点が整数座標を持ち,外面がk角形であるものを外k角格子凸描画という.Gが凸描画を持つための必要十分条件は,Gが内部3連結であることである.nをGの点数としよう.Gが3連結であるか,あるいはGの3連結成分分解木T(G)の葉の数が3枚以下ならば,Gは大きさn×nの整数格子内に外3角格子凸描画できる.また,T(G)の葉の数がちょうど4枚ならば大きさ2n×2nの整数格子内に外4角格子凸描画できる.更に,T(G)の葉の数がちょうど5枚ならば大きさ6n×n^2の整数格子内に外5角格子凸描画できる.本論文では,T(G)の葉が6枚のとき,内部3連結グラフGは6n×n^2の大きさの整数格子内に外6角格子凸描画できることを証明すると共に,そのような描画を求める線形時間アルゴリズムを与える.","subitem_description_type":"Other"}]},"item_26_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"128","bibliographic_titles":[{"bibliographic_title":"情報科学技術フォーラム講演論文集"}],"bibliographicPageStart":"127","bibliographicIssueDates":{"bibliographicIssueDate":"2013-08-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"12"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-19T00:26:32.794443+00:00","updated":"2025-01-20T15:41:02.520686+00:00"}