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.

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Christian Bachmaier, Florian Fischer, Michael Forster
• Keywords: COCOON 2005, Level Graphs, Linear Time Algorithm, Vertex Ordering