Radial drawings of graphs: Geometric constraints and trade-offs

This paper studies how to compute radially layered drawings of graphs by taking into account additional geometric constraints which correspond to typical aesthetic and semantic requirements for the visualization. The following requirements are considered: vertex centrality, edge crossings, curve complexity, and radial distribution of the vertices. Trade-offs among these requirements are discussed and different linear-time drawing algorithms are presented.