Rectilinear-Crossing-Number-using-simulated-annealing
Layout of complete planar graph in 2D space with minumum rectilinear intersections (crossing edges) - NP problem. Solving using simulated annealing. Graphs (avg,stddev) and visualization of graph in space available.