Radial Coordinate Assignment for Level Graphs
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.
KeywordsBlock Graph Level Graph Edge Crossing Hierarchical Graph Radial Level
Unable to display preview. Download preview PDF.
- 1.Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications (2005), To appear. Preprint under http://www.infosun.fmi.uni-passau.de/~chris/
- 6.Gravisto. Graph Visualization Toolkit. University of Passau, http://www.gravisto.org/