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

Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 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.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987
EditorsD. Soule
PublisherAssociation for Computing Machinery, Inc
Pages258-267
Number of pages10
ISBN (Electronic)0897912314, 9780897912310
DOIs
Publication statusPublished - 1987 Oct 1
Externally publishedYes
Event3rd Annual Symposium on Computational Geometry, SCG 1987 - Waterloo, Canada
Duration: 1987 Jun 81987 Jun 10

Publication series

NameProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Conference

Conference3rd Annual Symposium on Computational Geometry, SCG 1987
CountryCanada
CityWaterloo
Period87/6/887/6/10

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency'. Together they form a unique fingerprint.

  • Cite this

    Edahiro, M., Tanaka, K., Hoshino, T., & Asano, T. (1987). A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency. In D. Soule (Ed.), Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987 (pp. 258-267). (Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987). Association for Computing Machinery, Inc. https://doi.org/10.1145/41958.41986