The rectangle intersection problem revisited
- Cite this article as:
- Six, H.W. & Wood, D. BIT (1980) 20: 426. doi:10.1007/BF01933636
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.