BIT Numerical Mathematics

, Volume 28, Issue 2, pp 227–241

Scanline algorithms on a grid

Authors

  • Rolf G. Karlsson
    • Dept. of Computer ScienceLinköping University
    • Dept. of Computer ScienceUniversity of Utrecht
  • Mark H. Overmars
    • Dept. of Computer ScienceLinköping University
    • Dept. of Computer ScienceUniversity of Utrecht
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

Abstract

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.

CR-categories

E.2F.2.2

Keywords and phrases

scanline techniquesgrid geometrymaximal elementsrectangle problemsconnected componentsline segment intersection

Copyright information

© BIT Foundations 1988