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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bachmaier, C., Fischer, F., & Forster, M. (2005). Radial coordinate assignment for level graphs. In Lecture Notes in Computer Science (Vol. 3595, pp. 401–410). Springer Verlag. https://doi.org/10.1007/11533719_41
Mendeley helps you to discover research relevant for your work.