{"created":"2023-07-27T06:58:19.462412+00:00","id":56532,"links":{},"metadata":{"_buckets":{"deposit":"6e72e1f3-5d20-46da-a98b-9fed85cf911e"},"_deposit":{"created_by":18,"id":"56532","owners":[18],"pid":{"revision_id":0,"type":"depid","value":"56532"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00056532","sets":["934:935:936"]},"author_link":["97040"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1985-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicPageEnd":"559","bibliographicPageStart":"557","bibliographicVolumeNumber":"E68","bibliographic_titles":[{"bibliographic_title":"Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E"}]}]},"item_4_creator_33":{"attribute_name":"著者別表示","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"浅野, 哲夫"}],"nameIdentifiers":[{"nameIdentifier":"97040","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"90113133","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=90113133"}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"We are given a polygonal region P with holes and one point q is specified in the region. The problem is how fast we can find the portion of the boundary of P that is visible from q. For this problem an efficient algorithm is presented which runs in time O(n log h) in the worst case and in time O(n plus h log h) if every hole is a convex polygon, where n is the total number of vertices of P and h is the number of holes.","subitem_description_type":"Abstract"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学","subitem_description_type":"Other"}]},"item_4_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.24517/00062806","subitem_identifier_reg_type":"JaLC"}]},"item_4_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEICE 電子情報通信学会"}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"Copyright © IEICE 電子情報通信学会"}]},"item_4_source_id_11":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AA0086650X","subitem_source_identifier_type":"NCID"}]},"item_4_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0387-236X","subitem_source_identifier_type":"ISSN"}]},"item_4_version_type_25":{"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":"Asano, Tetsuo"}],"nameIdentifiers":[{"nameIdentifier":"97040","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"90113133","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=90113133"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2022-09-15"}],"displaytype":"detail","filename":"TE-PR-ASANO-T-68-9-557-559.pdf","filesize":[{"value":"1.2 MB"}],"format":"application/pdf","licensetype":"license_11","mimetype":"application/pdf","url":{"label":"TE-PR-ASANO-T-68-9-557-559.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/56532/files/TE-PR-ASANO-T-68-9-557-559.pdf"},"version_id":"e483ff28-2b74-4469-99a9-ec203d8b5081"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Efficient algorithm for finding the visibility polygon for a polygonal region with holes","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Efficient algorithm for finding the visibility polygon for a polygonal region with holes"}]},"item_type_id":"4","owner":"18","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-15"},"publish_date":"2022-09-15","publish_status":"0","recid":"56532","relation_version_is_last":true,"title":["Efficient algorithm for finding the visibility polygon for a polygonal region with holes"],"weko_creator_id":"18","weko_shared_id":-1},"updated":"2024-06-20T06:41:23.214079+00:00"}