Bentley-Ottmann

Java implementation of Bentley-Ottmann segments intersection finding algorithm. When operates the algorithm takes n * log(n) time complexity whenever a naive approach has n^2.