On the Faithfulness of Graph Visualizations
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.
- 3.Kienreich, W., Seifert, C.: An application of edge bundling techniques to the visualization of media analysis results. In: InfoVis, pp. 375–380. IEEE (2010)Google Scholar
- 5.Nguyen, Q., Hong, S.-H., Eades, P.: TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 123–135. Springer, Heidelberg (2012)Google Scholar
- 6.Nguyen, Q., Eades, P., Hong, S.H.: On the faithfulness of graph visualizations. Tech. Rep. TR-690, University of Sydney (August 2012)Google Scholar
- 7.Van Wijk, J.: The value of visualization. In: IEEE VIS, pp. 79–86 (2005)Google Scholar