A Force-Directed Algorithm that Preserves Edge Crossing Properties

Bertault, François (1999) A Force-Directed Algorithm that Preserves Edge Crossing Properties. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 351-358(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_36).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_36
Classifications: J Applications > J.999 Others
M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.420 Crossings
M Methods > M.400 Force-directed / Energy-based
URI: http://gdea.informatik.uni-koeln.de/id/eprint/378

Actions (login required)

View Item View Item