### 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 language | English |
---|---|

Title of host publication | Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987 |

Editors | D. Soule |

Publisher | Association for Computing Machinery, Inc |

Pages | 258-267 |

Number of pages | 10 |

ISBN (Electronic) | 0897912314, 9780897912310 |

DOIs | |

Publication status | Published - 1987 Oct 1 |

Externally published | Yes |

Event | 3rd Annual Symposium on Computational Geometry, SCG 1987 - Waterloo, Canada Duration: 1987 Jun 8 → 1987 Jun 10 |

### Publication series

Name | Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987 |
---|

### Conference

Conference | 3rd Annual Symposium on Computational Geometry, SCG 1987 |
---|---|

Country | Canada |

City | Waterloo |

Period | 87/6/8 → 87/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

*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