{"id":32402,"updated":"2025-01-22T16:11:27.950545+00:00","links":{},"created":"2025-01-18T23:01:30.088949+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032402","sets":["1164:2592:2686:2688"]},"path":["2688"],"owner":"1","recid":"32402","title":["動的凸包算法の高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"1994-09-21"},"_buckets":{"deposit":"41c95658-1775-453a-95ae-02677bf4fb8a"},"_deposit":{"id":"32402","pid":{"type":"depid","value":"32402","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"動的凸包算法の高速化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"動的凸包算法の高速化"},{"subitem_title":"A Fast Algorithm for Dynamic Convex Hull Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1994-09-21","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神戸大学工学部電子工学科"},{"subitem_text_value":"神戸大学工学部電子工学科"},{"subitem_text_value":"神戸大学工学部電子工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electronics Engineering Faculty of Engineering, Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Department of Electronics Engineering Faculty of Engineering, Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Department of Electronics Engineering Faculty of Engineering, Kobe University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/32402/files/IPSJ-AL94041013.pdf"},"date":[{"dateType":"Available","dateValue":"1996-09-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL94041013.pdf","filesize":[{"value":"1.2 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":"15a6df00-e2ca-4f63-909d-7c27f880fc0f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1994 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"永井, 靖"},{"creatorName":"太田有三"},{"creatorName":"羽根田, 博正"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasushi, Nagai","creatorNameLang":"en"},{"creatorName":"Yuzo, Ohta","creatorNameLang":"en"},{"creatorName":"Hiromasa, Haneda","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":"高次元の凸包問題の動的凸包算法としては、Beneath?Beyonod定理に基づくBeneath?Beyond法が提案されている。この方法はすべてのフェイスの情報を利用するため構成するポリトープの次元が高い場合多くの記憶容量を必要とし、その更新のための時間が長くなるという欠点があった。本報告では、高次元の動的凸包算法においてポリトープを表現するのにファセットとサブファセットとその包含関係だけで十分であることを示し、それに基づいた動的凸包算法を提案する。そして、インプリメントにおいて有用ないくつかの結果を導出し、それらに基づいた動的凸包算法を提案している。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The Beneath-Beyond method is well known as one of the dynamic convex hull maintenance methods, which based on Beneath-Beyond Theorem. In case the dimension of the polytop is high, Beneath-Beyond method requires very long computing time and huge storage, because the method needs all faces. The purpose of this paper is to propose a dynamic convex hull maintenance method for high dimensions. This method uses the information of facets and subfacets of the polytope and subsfacets contained by each facet. Moreover, several useful results relating the implementation of the method are derived. An algorithm based on these obatined results is presented.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"104","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"97","bibliographicIssueDates":{"bibliographicIssueDate":"1994-09-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"82(1994-AL-041)","bibliographicVolumeNumber":"1994"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}