RA-004 Constant-space Data Structure for Farthest-point Voronoi Diagram
スポンサーリンク
概要
- 論文の詳細を見る
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].
- FIT(電子情報通信学会・情報処理学会)運営委員会の論文
- 2011-09-07
著者
関連論文
- 任意の作業領域で効率よく線分交差を列挙するアルゴリズム
- RA-004 Constant-space Data Structure for Farthest-point Voronoi Diagram
- 単純多角形内部の最短経路発見のためのメモリ調節可能アルゴリズム (Theoretical Foundations of Computing)