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

Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano

研究成果: Conference contribution

2 被引用数 (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 its implemented in FORTRAN, and their practical officiencies are investigated through computational experiments. It is shown that our O(k) search time, O(n) space and O(n) preprocessing time algorithm is practically the most efficient among the tested algorithms.

本文言語English
ホスト出版物のタイトルProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987
編集者D. Soule
出版社Association for Computing Machinery, Inc
ページ258-267
ページ数10
ISBN(電子版)0897912314, 9780897912310
DOI
出版ステータスPublished - 1987 10 1
外部発表はい
イベント3rd Annual Symposium on Computational Geometry, SCG 1987 - Waterloo, Canada
継続期間: 1987 6 81987 6 10

出版物シリーズ

名前Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Conference

Conference3rd Annual Symposium on Computational Geometry, SCG 1987
国/地域Canada
CityWaterloo
Period87/6/887/6/10

ASJC Scopus subject areas

  • 幾何学とトポロジー
  • 計算数学

フィンガープリント

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

引用スタイル