Radial drawings of graphs: geometric constraints and trade-offs

Authors:
Emilio Di Giacomo;Walter Didimo;Giuseppe Liotta
Affiliations:
Dip. Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia;Dip. Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia;Dip. Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 6
Cited 1

Automatic graph drawing and readability of diagrams

IEEE Transactions on Systems, Man and Cybernetics
Advances in the theory and practice of graph drawing

Theoretical Computer Science
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Communicating Centrality in Policy Network Drawings

IEEE Transactions on Visualization and Computer Graphics
Curve-constrained drawings of planar graphs

Computational Geometry: Theory and Applications
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

A new concentric-circle visualization of multi-dimensional data and its application in network security

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies how to compute radial 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 vertex radial distribution. Trade-offs among these requirements and efficient drawing algorithms are presented.