On the Faithfulness of Graph Visualizations

Nguyen, Quan and Eades, Peter and Hong, Seok-Hee (2013) On the Faithfulness of Graph Visualizations. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 566-568(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

Introduction. 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.

Item Type: Conference Poster
Additional Information: 10.1007/978-3-642-36763-2_55
Classifications: J Applications > J.001 General
S Software and Systems > S.120 Visualization
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 13:49
Last Modified: 21 Nov 2013 13:49
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1348

Actions (login required)

View Item View Item