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)
This project was partially supported by DFG-grants Ju204/7-3, Mu1 129/3-1, Na 303/1-3, Forschungsschwerpunkt “Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen”
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mutzel, P. et al. (1998). A Library of Algorithms for Graph Drawing. In: Whitesides, S.H. (eds) Graph Drawing. GD 1998. Lecture Notes in Computer Science, vol 1547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37623-2_44
Download citation
DOI: https://doi.org/10.1007/3-540-37623-2_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65473-5
Online ISBN: 978-3-540-37623-1
eBook Packages: Springer Book Archive