On the faithfulness of graph visualizations

Authors:
Quan Nguyen;Peter Eades;Seok-Hee Hong
Affiliations:
School of Information Technologies, University of Sydney, Australia;School of Information Technologies, University of Sydney, Australia;School of Information Technologies, University of Sydney, Australia
Venue:
GD'12 Proceedings of the 20th international conference on Graph Drawing
Year:
2012

Citing 4
Cited 0

Graph drawing by force-directed placement

Software—Practice & Experience
An Application of Edge Bundling Techniques to the Visualization of Media Analysis Results

IV '10 Proceedings of the 2010 14th International Conference Information Visualisation
TGI-EB: a new framework for edge bundling integrating topology, geometry and importance

GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-directed edge bundling for graph visualization

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph drawing algorithms developed over the past 30 years aim to produce "readable" pictures of graphs. Here "readability" is measured by aesthetic criteria, such as few crossings or few edge bends or small grid drawing area. However, the readability criteria for visualizing graphs, though necessary, are not sufficient for effective graph visualization. This poster introduces another kind of criterion, generically called "faithfulness". Intuitively, a graph drawing algorithm is "faithful" if it maps different graphs to distinct drawings. Faithfulness criteria are especially relevant for modern methods that handle very large and complex graphs; data reduction or aggregation or generalisation are commonly exercised to enhance readability.