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 ensures that two edges cross in the final drawing if and only if these edges crossed in the initial layout. Therefore no new edge crossings are introduced. We describe applications of this technique to improve classical algorithms for drawing planar graphs and for dynamic graph drawing. (C) 2000 Elsevier Science B.V. All rights reserved.
algorithms graph drawing force-directed method