I have a 2D graph that I'm trying to lay out cleanly. Does anyone know of an algorithm that, given the x, y position of every node and the graph's edges will tell me how many edges cross. Right ...

My first idea is to split each line at each intersection point so that each line segment can be shared by at most two polygons.