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

  • Authors:

  • M. Edahiro;K. Tanaka;T. Hoshino;T. Asano

  • Affiliations:

  • C&C System Research Laboratories, NEC Corporation, Kawasaki, Japan 213;Microelectronics Research Laboratories, NEC Corporation, Kawasaki, Japan 213;Faculty of Science and Technology, Sophia University, Tokyo, Japan 102;Faculty of Science and Technology, Sophia University, Tokyo, Japan 102

  • Venue:
  • SCG '87 Proceedings of the third annual symposium on Computational geometry
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 &Ogr;(n) time preprocessing, a search structure of size &Ogr;(n) so that all the segments of S intersecting a query segment can be reported in &Ogr;(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 &Ogr;(k) search time, &Ogr;(n) space and &Ogr;(n) preprocessing time algorithm is practically the most efficient among the tested algorithms.