A Force-Directed Algorithm that Preserves Edge Crossing Properties
We present an iterative drawing algorithm for undirected graphs, based on a force-directed approach, that preserves edge crossing properties. This algorithm insures that two edges cross in the final drawing if and only if these edges crossed on the initial layout. So no new edge crossings are introduced. We describe applications of this technique to improve classical algorithms for drawing planar graphs and for interactive graph drawing.
- 5.G. Kant. Drawing planar graphs using the lmc-ordering. Proc. IEEE Symp. on Foundation of Computer Science, pages 101–110, 1992.Google Scholar
- 7.P. Mutzel. A fast linear time embedding algorithm based on the Hopcropt-Tarjan planarity test. Technical report, Institut für Informatik, universität zu Köln, 1992.Google Scholar