2024-03-29T01:44:49Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:001505402017-03-31T05:33:31Z08512:08654:08655:08540:08541
RA-004 Constant-space Data Structure for Farthest-point Voronoi Diagramenghttp://id.nii.ac.jp/1001/00150506/Conference Paperhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=150540&item_no=1&attribute_id=1&file_no=1Copyright (c) 2011 by IEICE,IPSJ北陸先端大北陸先端大浅野, 哲夫小長谷, 松雄This paper presents a constant-space data structure for the farthest-point Voronoi diagram for a set of n points in the plane, which supports various operations using only a constant number of words of O(log n) bits and a read-only array to store the given point set. We show that the supported operations can be executed in O(n) time.This is an extension of our previous results [1, 2, 3, 4].AA1242354X情報科学技術フォーラム講演論文集10123282011-09-072016-02-12