glenm@mako.UUCP (Glen McCluskey) (11/13/84)
The crossed line problem is where you have a network with points (vertices) and lines (edges) connecting the points. The problem is to arrange the points in such a way that the number of crossed lines, and lines going through points, is minimized. I believe that this problem is NP-complete. Whether or not this is the case, I am wondering if anyone knows of a practical method that achieves reasonably good results in laying out the network. Glen McCluskey ..tektronix!mako!glenm