Radial coordinate assignment for level graphs

Authors:
Christian Bachmaier;Florian Fischer;Michael Forster
Affiliations:
University of Konstanz, Konstanz, Germany;Projective Software GmbH, Munich, Germany;National ICT Australia, Eveleigh, Australia
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 4
Cited 3

A proposed method for representing hierarchies

IEEE Transactions on Systems, Man and Cybernetics
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

GD '96 Proceedings of the Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Communicating Centrality in Policy Network Drawings

IEEE Transactions on Visualization and Computer Graphics

Topographic Visualization of Prefix Propagation in the Internet

IEEE Transactions on Visualization and Computer Graphics
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

IEEE Transactions on Visualization and Computer Graphics
Radial drawings of graphs: Geometric constraints and trade-offs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of spiral segments with at most two bends.