A Library of Algorithms for Graph Drawing

  • Petra Mutzel
  • Carsten Gutwenger
  • Ralf Brockenauer
  • Sergej Fialko
  • Gunnar Klau
  • Michael Krüger
  • Thomas Ziegler
  • Stefan Näher
  • David Alberts
  • Dirk Ambras
  • Gunter Koch
  • Michael Jünger
  • Christoph Buchheim
  • Sebastian Leipert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

This poster presents AGD, a library of Algorithms for Graph Drawing. The library offers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms. The algorithms include planar graph drawing methods such as straight-line, polyline, orthogonal, visibility, and tree drawing methods. In order to make these algorithms useful for general graphs, we provide various planarization methods ranging from heuristic to optimal algorithms. Data structures, like, e.g., PQ-trees, have been especially tailored for applications in graph drawing. Users can engineer their own hybrid methods by combining the provided tools like planarization, 2-layer crossing minimization, and various shelling orders (see Figure 1)

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Petra Mutzel
    • 1
  • Carsten Gutwenger
    • 1
  • Ralf Brockenauer
    • 1
  • Sergej Fialko
    • 1
  • Gunnar Klau
    • 1
  • Michael Krüger
    • 1
  • Thomas Ziegler
    • 1
  • Stefan Näher
    • 2
  • David Alberts
    • 2
  • Dirk Ambras
    • 2
  • Gunter Koch
    • 2
  • Michael Jünger
    • 3
  • Christoph Buchheim
    • 3
  • Sebastian Leipert
    • 3
  1. 1.Max-Planck-Institut für InformatikSaarbrücken
  2. 2.Universität HalleGermany
  3. 3.Universität zu KölnGermany

Personalised recommendations