One Graph, Multiple Drawings - Archive ouverte HAL
Communication Dans Un Congrès Année : 2013

One Graph, Multiple Drawings

Résumé

Being able to produce a wide variety of layouts for a same graphs may prove useful when users have no preferred visual encoding for their data. The first contribution of this paper is a enhanced force-directed layout capable of producing different layouts of a same graph. We turn a well known force-directed algorithm (GEM) into a highly parametrizable layout and control it from a genetic algorithm framework. The genetic algorithm allows to efficiently explore the parameter space of this highly parametrisable layout. The search process relies on the capability of the system to evaluate the similarity between two drawings. The second contribution of this paper is a similarity metric used as a fitness function for the genetic algorithm. Its main features are its computational cost and its insensitivity to planar homotheties.
Fichier non déposé

Dates et versions

hal-01002406 , version 1 (06-06-2014)

Identifiants

Citer

Maurin Nadal, Guy Melançon. One Graph, Multiple Drawings. 2013 17th International Conference Information Visualisation (IV), Jul 2013, London, United Kingdom. pp.416 - 421, ⟨10.1109/IV.2013.55⟩. ⟨hal-01002406⟩
66 Consultations
0 Téléchargements

Altmetric

Partager

More