A LAYOUT ALGORITHM FOR THE VISUALIZATION OF MULTIPLE RELATIONS IN GRAPHS

Géraldine Bous

Abstract

Many recent applications involve data models that rely on heterogeneous graphs (multiple node and relation types). Drawing these graphs is more difficult than drawing standard graphs, as it is desirable to take into account the heterogeneity of graphs in the form of constraints, possibly stemming from user preferences, to compute the layout. In this paper we propose a method for hierarchical graph drawing that is based on structural constraint modeling. These constraints are combined with crossing minimization algorithms to yield the desired visual effect. Three types of constraints are considered and illustrated, giving special attention to the drawing of multiple relations for interactive graph visualization.

References

  1. Battista, G. D., Eades, P., Tamassia, R., and Tollis, I. G. (1999). Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River.
  2. Bertault, F. and Miller, M. (1999). An algorithm for drawing compound graphs. In Proceedings of the 7th International Symposium on Graph Drawing (GD'99), pages 197-204.
  3. Burch, M. and Diehl, S. (2008). Timeradartrees: Visualizing dynamic compound digraphs. In Proceedings Eurographics/ IEEE-VGTC Symposium on Visualization 2008, volume 27, pages 823-830.
  4. Burch, M., Fritz, M., Beck, F., and Diehl, S. (2010). Timespidertrees: A novel visual metaphor for dynamic compound graphs. In Hundhausen, C. D., Pietriga, E., Daz, P., and Rosson, M. B., editors, Proceedings of the IEEE Symposium on Visual Languages and HumanCentric Computing VL/HCC 2010, pages 168-175.
  5. Cuvelier, E., Bous, G., Aufaure, M.-A., and Kleser, G. (2012). ARSA: Analyse des Réseaux Sociaux pour les Administrations - une expérience d'intégration de réseaux sociaux internes et externes dans une administration. Ingénierie des Systèmes d'Information. To appear.
  6. Fekete, J.-D., Wang, D., Dang, N., and Plaisant, C. (2003). Overlaying graph links on treemaps. In IEEE Symposium on Information Visualization Conference Compendium (demonstration).
  7. Forster, M. (2002). Applying crossing reduction strategies to layered compound graphs. In Proceedings of the 10th International Symposium on Graph Drawing (GD'02), pages 276-284.
  8. Herman, I., Melanon, G., and Marshall, S. (2000). Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6:24-43.
  9. Holten, D. (2006). Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12:741-748.
  10. Misue, K., Eades, P., Lai, W., and Sugiyama, K. (1995). Layout adjustments and the mental map. Journal of Visual Languages and Computing, 6:183-210.
  11. Muelder, C. and Ma, K.-L. (2008). A treemap based method for rapid layout of large graphs. In Proceedings of Visualization Symposium, 2008. PacificVIS 7808. IEEE Pacific, pages 231 -238.
  12. Purchase, H. (2000). Effective information visualization: a study of graph drawing aesthetics and algorithms. Interacting with Computers, 13:147-162.
  13. Purchase, H., Hoggan, E., and Grg, C. (2006). How important is the “mental map”? an empirical investigation of a dynamic graph layout algorithm. In Proceedings of 14th International Symposium on Graph Drawing (GD'06), pages 184-195.
  14. Raitner, M. (2004). Visual navigation of compound graphs. In Proceedings of the 12th International Symposium on Graph Drawing (GD'04), pages 403-413.
  15. Roman, S. (2008). Lattices and Ordered Sets. Springer, New York.
  16. Saffrey, P. and Purchase, H. (2008). The “mental map” versus “static aesthetic” compromise in dynamic graphs: a user study. In Proceedings of the 9th Conference on Australasian User Interface, pages 85-93.
  17. Shen, Z., Ma, K.-L., and Eliassi-Rad, T. (2006). Visual analysis of large heterogeneous social networks by semantic and structural abstraction. IEEE Transactions on Visualization and Computer Graphics, 12:1427 - 1439.
  18. Sugiyama, K. and Misue, K. (1991). Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21:876-892.
  19. Sugiyama, K., Tagawa, S., and Toda, M. (1981). Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11:109-125.
Download


Paper Citation


in Harvard Style

Bous G. (2012). A LAYOUT ALGORITHM FOR THE VISUALIZATION OF MULTIPLE RELATIONS IN GRAPHS . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012) ISBN 978-989-8565-02-0, pages 690-700. DOI: 10.5220/0003865106900700


in Bibtex Style

@conference{ivapp12,
author={Géraldine Bous},
title={A LAYOUT ALGORITHM FOR THE VISUALIZATION OF MULTIPLE RELATIONS IN GRAPHS},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012)},
year={2012},
pages={690-700},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003865106900700},
isbn={978-989-8565-02-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2012)
TI - A LAYOUT ALGORITHM FOR THE VISUALIZATION OF MULTIPLE RELATIONS IN GRAPHS
SN - 978-989-8565-02-0
AU - Bous G.
PY - 2012
SP - 690
EP - 700
DO - 10.5220/0003865106900700