Finding the intersection points of networks

Abstract

Two algorithms have been constructed that find the intersections between two sets of line segments in practical networks used for planning and routing, solving the implementation issues of existing algorithms. One of the algorithms is a generalisation of the Bentley-Ottmann-algorithm, relaxing the assumptions in the original algorithm, the other is a smart brute force algorithm. In this article the algorithms are elaborated and will be tested, using real data sets constructed from street networks and trench networks. Both algorithms find all the intersections but with a difference in calculation time.