Radial coordinate assignment for level graphs

Radial coordinate assignment for level graphs (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Christian Bachmaier , Florian Fischer , Michael Forster

Venue:	Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS
Citations:	6 - 3 self

BibTeX

@INPROCEEDINGS{Bachmaier05radialcoordinate,
    author = {Christian Bachmaier and Florian Fischer and Michael Forster},
    title = {Radial coordinate assignment for level graphs},
    booktitle = {Proc. Computing and Combinatorics, COCOON 2005, volume 3595 of LNCS},
    year = {2005},
    pages = {401--410},
    publisher = {Springer}
}

Bookmark

OpenURL

Abstract

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. 1

Citations

292	Methods for visual understanding of hierarchical system structures - Sugiyama, Tagawa, et al. - 1981
54	Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44(1):1–32 - Eades, Feng, et al. - 2006
30	Drawing free trees - Eades - 2013
27	Communicating centrality in policy network drawings - Brandes - 2003
18	Fast and simple horizontal coordinate assignment - Brandes, Köpf - 2002
17	Radial level planarity testing and embedding in linear time - Bachmaier, Brandenburg, et al. - 2005
10	Drawing Graphs, volume 2025 of LNCS - Kaufmann, Wagner - 2001
8	A proposed method for representing hierarchies - Reggiani, Marchetti - 1988
1	Graph Visualization Toolkit. http://www.gravisto.org - Gravisto