BIT Numerical Mathematics

, Volume 28, Issue 2, pp 227–241

Scanline algorithms on a grid

  • Rolf G. Karlsson
  • Mark H. Overmars
Part I Computer Science

DOI: 10.1007/BF01934088

Cite this article as:
Karlsson, R.G. & Overmars, M.H. BIT (1988) 28: 227. doi:10.1007/BF01934088


A number of important problems in computational geometry are solved efficiently on 2- or 3-dimensional grids by means of scanline techniques. In the time complexity of solutions to the maximal elements and closure problems, a factor logn is substituted by loglogn, wheren is the number of elements. Next, by using a data structure introduced in the paper, the interval trie, previous solutions to the rectangle intersection and connected component problems are improved upon. Finally, a fast intersection finding algorithm for arbitrarily oriented line segments is presented.


E.2 F.2.2 

Keywords and phrases

scanline techniques grid geometry maximal elements rectangle problems connected components line segment intersection 

Copyright information

© BIT Foundations 1988

Authors and Affiliations

  • Rolf G. Karlsson
    • 1
    • 2
  • Mark H. Overmars
    • 1
    • 2
  1. 1.Dept. of Computer ScienceLinköping UniversityLinköpingSweden
  2. 2.Dept. of Computer ScienceUniversity of UtrechtTA UtrechtThe Netherlands

Personalised recommendations