A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency

Masato Edahiro*, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano

*この研究の対応する著者

研究成果: Article査読

3 被引用数 (Scopus)

抄録

The orthogonal segment intersection search problem is stated as follows: given a set S of n orthogonal segments in the plane, report all the segments of S that intersect a given orthogonal query segment. For this problem, we propose a simple and practical algorithm based on bucketing techniques. It constructs, in O(n) time preprocessing, a search structure of size O(n) so that all the segments of S intersecting a query segment can be reported in O(k) time in the average case, where k is the number of the reported segments. The proposed algorithm as well as existing algorithms is implemented in FORTRAN, and their practical efficiencies are investigated through computational experiments. It is shown that our O(k) search time, O(n) space, and O(n) preprocessing time algorithm is in practice the most efficient among the algorithms tested.

本文言語English
ページ(範囲)61-76
ページ数16
ジャーナルAlgorithmica
4
1-4
DOI
出版ステータスPublished - 1989 6
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • コンピュータ サイエンスの応用
  • 応用数学

フィンガープリント

「A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル