Radial drawings of graphs: Geometric constraints and trade-offs

Authors:
Emilio Di Giacomo;Walter Didimo;Giuseppe Liotta
Affiliations:
Dipartimento di Ingegneria Elettronica e dell'Informazione, Universití degli Studi di Perugia, Perugia, Italy;Dipartimento di Ingegneria Elettronica e dell'Informazione, Universití degli Studi di Perugia, Perugia, Italy;Dipartimento di Ingegneria Elettronica e dell'Informazione, Universití degli Studi di Perugia, Perugia, Italy
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 10
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Automatic graph drawing and readability of diagrams

IEEE Transactions on Systems, Man and Cybernetics
On the thickness of graphs of given degree

Information Sciences: an International Journal
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)
Radial coordinate assignment for level graphs

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Leftist canonical ordering

GD'09 Proceedings of the 17th international conference on Graph Drawing
The hamiltonian augmentation problem and its applications to graph drawing

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.