A Force-Directed Algorithm that Preserves Edge Crossing Properties

  • François Bertault
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


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.


  1. 1.
    H. de Frayssex, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41–51, 1990.CrossRefMathSciNetGoogle Scholar
  2. 2.
    P. D. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149–160, 1984.MathSciNetGoogle Scholar
  3. 3.
    T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129–1164, 1991.CrossRefGoogle Scholar
  4. 4.
    T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7–15, 1989.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    G. Kant. Drawing planar graphs using the lmc-ordering. Proc. IEEE Symp. on Foundation of Computer Science, pages 101–110, 1992.Google Scholar
  6. 6.
    Goos Kant and Hans L. Bodlaender. Triangulating planar graphs while minimizing the maximum degree. Information and Computation, 135(1):1–14, 1997.MATHCrossRefMathSciNetGoogle Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • François Bertault
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversity of NewcastleCallaghanAustralia

Personalised recommendations