2013 17th International Conference on Information Visualisation (2007)

Zurich, Switzerland

July 4, 2007 to July 6, 2007

ISSN: 1550-6037

ISBN: 0-7695-2900-3

pp: 757-764

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2007.65

Romain Bourqui , LaBRI, Universite Bordeaux I, France

Patrick Mary , LaBRI, Universite Bordeaux I, France

David Auber , LaBRI, Universite Bordeaux I, France

ABSTRACT

Visualization of clustered graphs has been a research area since many years. In this paper, we describe a new approach that can be used in real application where graph does not contain only topological information but also extrinsic parameters (i.e. user attributes on edges and nodes). In the case of force-directed algorithm, management of attributes corresponds to take into account edge weights. We propose an extension of the GRIP algorithm in order to manage edge weights. Furthermore, by using Voronoi diagram we constrained that algorithm to draw each cluster in a non overlapping convex region. Using these two extensions we obtained an algorithm that draw clustered weighted graphs. Experimentation has been done on data coming from biology where the network is the genesproteins interaction graph and where the attributes are gene expression values from microarray experiments.

INDEX TERMS

null

CITATION

Romain Bourqui,
Patrick Mary,
David Auber,
"How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm",

*2013 17th International Conference on Information Visualisation*, vol. 00, no. , pp. 757-764, 2007, doi:10.1109/IV.2007.65