BIT Numerical Mathematics

, Volume 20, Issue 4, pp 426–433

The rectangle intersection problem revisited

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

DOI: 10.1007/BF01933636

Cite this article as:
Six, H.W. & Wood, D. BIT (1980) 20: 426. doi:10.1007/BF01933636

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.

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