{"created":"2025-01-18T22:48:53.155608+00:00","updated":"2025-01-23T00:24:24.250140+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00015297","sets":["581:846:847"]},"path":["847"],"owner":"1","recid":"15297","title":["段階的クラスタを用いた描線順序の効率化"],"pubdate":{"attribute_name":"公開日","attribute_value":"1988-12-15"},"_buckets":{"deposit":"3c3e2728-8db4-45ba-a82a-117eb0767306"},"_deposit":{"id":"15297","pid":{"type":"depid","value":"15297","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":"Efficient Drawing Sequence by Stepwise Clustering Method","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1988-12-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"関西学院大学情報処理研究センター"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information Processing Research Center, Kwansei Gakuin University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/15297/files/IPSJ-JNL2912001.pdf"},"date":[{"dateType":"Available","dateValue":"1990-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL2912001.pdf","filesize":[{"value":"784.9 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":"91f63a49-977e-451a-8bed-a38f4f5b77d7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1988 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"雄山, 真弓"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mayumi, Oyama","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":"一般に作図は 2つの端点を持つ直線分 または連続する直線分からなる折れ線が複数個組み合わされて構成されると考えることができる.これを一筆書きでその描線軌跡が最短になる経路を求める問題は 組合せ最適化問題として扱うことができる線分の数が増加することによって その組合せ数は増大し 計算量が指数関数的に増大するため 最適解は実用的には解けない場合が多いしたがってこれにかかわる近似解を求めることは重要である.本論文は クラスタを段階的に行って近似解を求める方法を提案し そのアルゴリズム 計算機実験の結果 2次元データについては 既に行われている方法との比較を行う.本方法の最大の特長は 3次元空間への適用ができることであるが そのほかにも作図データを点 直線分からなる単純な構成として捉えていること 時間計算量 領域計算量について効率的方法であること さらに 高性能な近似解が得られることを述べる.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1100","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1091","bibliographicIssueDates":{"bibliographicIssueDate":"1988-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"29"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"図形・情報処理"}]},"weko_creator_id":"1"},"id":15297,"links":{}}