Counting the Number of Crossings in Geometric Graphs
share
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an O(n^2 log n) algorithm to compute the number of pairs of edges that cross in a geometric graph on n points. For layered, and convex geometric graphs the algorithm takes O(n^2) time.
READ FULL TEXT