Advertisement

BIT Numerical Mathematics

, Volume 20, Issue 4, pp 426–433 | Cite as

The rectangle intersection problem revisited

  • H. -W. Six
  • D. Wood
Part I Computer Science

Abstract

We take another look at the problem of intersecting rectangles with parallel sides. For this we derive a one-pass, time optimal algorithm which is easy to program, generalizes tod dimensions well, and illustrates a basic duality in its data structures and approach.

Keywords

Data Structure Optimal Algorithm Computational Mathematic Basic Duality Intersection Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. S. Baird,Fast algorithms for LSI artwork analysis, Journal of Design Automation and Fault-Tolerant Computing 2, 2 (1978), 179–209.Google Scholar
  2. 2.
    J. L. Bentley,Algorithms for Klee's rectangle problems, Unpublished notes, Carnegie-Mellon University (1977).Google Scholar
  3. 3.
    J. L. Bentley, D. Haken, and R. Hon,A fast program for reporting intersections among bounding boxes. In preparation (1979).Google Scholar
  4. 4.
    J. L. Bentley and H. A. Maurer,Efficient worst-case data structures for range searching, Acta Informatica 13 (1980), 155–168.Google Scholar
  5. 5.
    J. L. Bentley and Th. Ottmann,Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, C-28 (1979), 643–647.Google Scholar
  6. 6.
    J. L. Bentley and D. Wood,An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Transactions on Computers, C-29 (1980), 571–577.Google Scholar
  7. 7.
    H. Edelsbrunner,A new approach to rectangle intersections. Submitted for publication (1980).Google Scholar
  8. 8.
    H. Edelsbrunner and H. A. Maurer,On region location in the plane, TU Graz, IIG Report No. 50 (1980).Google Scholar
  9. 9.
    U. Lauther, 4-dimensional binary search trees as a means to speed up associative searchs in design rule verification of integrated circuits, Journal of Design Automation and Fault-Tolerant Computing 2, 3 (1978), 241–247.Google Scholar
  10. 10.
    J. van Leeuwen and D. Wood,The measure problem for intersecting ranges in d-space, Journal of Algorithms (1980), to appear.Google Scholar
  11. 11.
    M. I. Shamos and D. J. Hoey,Geometric intersection problems, Proc. 17th Annual IEEE FOCS (1976), 208–215.Google Scholar
  12. 12.
    V. K. Vaishnavi and D. Wood,Rectilinear line segment intersection, layered segment trees and dynamization, McMaster University Computer Science Technical Report No. 80-CS-8, (1980).Google Scholar

Copyright information

© BIT Foundations 1980

Authors and Affiliations

  • H. -W. Six
    • 1
    • 2
  • D. Wood
    • 1
    • 2
  1. 1.Institut Für Angewandte Informatik Und Formale BeschreibungsverfahrenUniversität KarlsruheKarlsruheWest Germany
  2. 2.Unit for Computer ScienceMcMaster UniversityHamiltonCanada

Personalised recommendations