{"created":"2023-05-15T12:20:27.104298+00:00","id":11029,"links":{},"metadata":{"_buckets":{"deposit":"aae2fc52-8665-4bee-8649-c8aa54d526f0"},"_deposit":{"created_by":1,"id":"11029","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11029"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011029","sets":["528:1538:1585"]},"author_link":["23594","23592","23593","23597","23595","23596"],"item_7_alternative_title_22":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Generation of Space Partitioning Tree using Network Voronoi Diagrams"}]},"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-04-07","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"本稿では，道路網をグラフと捉え, ネットワークボロノイ図を用いて領域分割木の確率的な生成法とそれを用いた経路探査法を提案する．提案手法では，与えられたグラフに対して, ネットワークボロノイ分割を行うことで,部分グラフに分割し, 全体領域を部分領域に分割する. 次に, 各部分グラフをノードと見て, 隣接する部分グラフ同士を融合することにより, 各領域の大きさを拡張しながら, より広い部分領域のグラフを構成する. この操作を繰り返して, 階層化することで, 上位階層の領域間の包含関係を満たす領域分割木をボトムアップに生成することができる. 続いて, 領域分割木を用いて, 再帰的な経路探査アルゴリズムを与え, その有効性について議論する. 提案手法の有効性を確認するため, 領域分割木の持つ性質や確率的な母点選択に対する生成時間などについて検討し, 国土地理院道路網データに実際に適用して, 提案アルゴリズムを用いた領域分割木の定量的な評価を行う. 提案手法により, ディジタル道路情報を有効に利用して, 道路網の密度に応じた領域分割木が構成でき, 効率的な経路探査などを行うことができる.\nThe authors propose probabilistic construction of space partitioning tree using Network Voronoi Diagram considering road map as a graph. From the given graph, to generate a Network Voronoi Diagram, we partition the entire graph and generate subgraphs. Next, considering each subgraphs as nodes, we merge with adjacent subgraphs, and extend the subgraphs. This is processed continuously to construct layers, which the higher level covers the region of lower level, resultantly generating space partitioning tree in a bottom-up manner. Then, using space partitioning tree, we provide route search algorithm and discuss the efficiency of our method. To verify the efficiency, we examine the characteristics of space partitioning tree and its time length for probabilistic selection of generators. We perform numerical simulation for rspace partitioning tree on road maps from geographical survey institute using our algorithm. We use digital road maps efficiently, generating space partitioning tree with different level of details of road network, to perform efficient route search.","subitem_description_type":"Other"}]},"item_7_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"DEWS2008 C7-6 電子情報通信学会 第19回データ工学ワークショップ 2008年3月9日～11日","subitem_description_type":"Other"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23595","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Kambara, Tomoya"}]},{"nameIdentifiers":[{"nameIdentifier":"23596","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ohnishi, Masaaki"}]},{"nameIdentifiers":[{"nameIdentifier":"23597","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ueshima, Shinichi"}]}]},"item_7_publisher_36":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_7_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(C) 電子情報通信学会　http://www.ieice.org/jpn/index.html正式版に関しては以下のURLを参照してください。http://www.ieice.org/iss/de/DEWS/DEWS2008/proceedings/program.html#c7"}]},"item_7_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"蒲原, 智也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大西, 真晶"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上島, 紳一"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20080407-01.pdf","filesize":[{"value":"685.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20080407-01.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11029/files/KU-1100-20080407-01.pdf"},"version_id":"78916e70-fcb8-4c20-b35a-8fb335a02856"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"GIS","subitem_subject_scheme":"Other"},{"subitem_subject":"ネットワークボロノイ図","subitem_subject_scheme":"Other"},{"subitem_subject":"スキップリスト","subitem_subject_scheme":"Other"},{"subitem_subject":"経路探索","subitem_subject_scheme":"Other"},{"subitem_subject":"GIS","subitem_subject_scheme":"Other"},{"subitem_subject":"NetworkVoronoiDiagram","subitem_subject_scheme":"Other"},{"subitem_subject":"SkipList","subitem_subject_scheme":"Other"},{"subitem_subject":"Routing Algorithm","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"ネットワークボロノイ図を用いた領域分割木の提案と評価","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ネットワークボロノイ図を用いた領域分割木の提案と評価"}]},"item_type_id":"7","owner":"1","path":["1585"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-09-11"},"publish_date":"2012-09-11","publish_status":"0","recid":"11029","relation_version_is_last":true,"title":["ネットワークボロノイ図を用いた領域分割木の提案と評価"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T14:40:05.587835+00:00"}