{"updated":"2025-01-22T16:17:31.130949+00:00","links":{},"id":32176,"created":"2025-01-18T23:01:19.808027+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032176","sets":["1164:2592:2659:2662"]},"path":["2662"],"owner":"1","recid":"32176","title":["分散メモリMIMD型並列計算機を用いた3次元物体の衝突面検出"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-07-22"},"_buckets":{"deposit":"3945a0cf-bb41-4342-b76c-f22ecac709db"},"_deposit":{"id":"32176","pid":{"type":"depid","value":"32176","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"分散メモリMIMD型並列計算機を用いた3次元物体の衝突面検出","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"分散メモリMIMD型並列計算機を用いた3次元物体の衝突面検出"},{"subitem_title":"A Parallel Colliding Face Detection of 3D Objects Using a Distributed - Memory MIMD Computer","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-07-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"茨城大学工学部情報工学科"},{"subitem_text_value":"茨城大学工学部情報工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Dept. of Computer and Information Sciences, Faculty of Engineering, Ibaraki University","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Computer and Information Sciences, Faculty of Engineering, Ibaraki 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/32176/files/IPSJ-AL98063007.pdf"},"date":[{"dateType":"Available","dateValue":"2000-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL98063007.pdf","filesize":[{"value":"630.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b6754868-8da1-42ec-9a69-ba6d96775890","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"二宮, 茂樹"},{"creatorName":"渋沢, 進"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shigeki, Nimiya","creatorNameLang":"en"},{"creatorName":"Susumu, Shibusawa","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":"3次元物体の衝突面検出アルゴリズムとして、衝突する可能性をもつ面を絞っていき、最後に正確に面ペアの衝突検査をする方法がこれまで提案されてきた。逐次処理の実験結果より、最後の処理がこのアルゴリズムで大きな比重を占めていることが分かった。そこで本研究では、分散メモリMIMD型並列計算機を用いて、面の衝突検査を並列化する実験を行った計その際、ホストプロセッサから各セルプロセッサに順次一定数の面ペアを送り、各セルで送られてきた面ペアの衝突を並列に検査する方法を用いた。送る面ペア数として、5・10・15・20・25・30の場合を実験した。この結果、10台のセルを用いて各セルに30個の面ベアを送ったとき、逐次処理の58.5％の実行時間で面ペアの衝突が検査できた。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For the colliding face detection of 3D Objects, an algorithm is proposed which decreases the search range of colliding faces using octree. From the sequential implementation of algorithm, the collision check of pair-faces takes the major part of execution time. In this paper, we test the Parallel check of pair-face collision using a distributed-memory MIMD computer. The host processor sends the fixed number of pair-faces to cell processors in older, and each cell processor checks the collision of pair-faces. As the result of experiment, the execution time of parallel collision check of pair-faces is reduce to 58.5% of that of sequential processing for two pheres with each 162 faces, 30 pair-faces to be sent and 10 cell processors.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"56","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"1998-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"62(1998-AL-063)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}