Drawing clustered graphs as topographic maps

Authors:
Martin Gronemann;Michael Jünger
Affiliations:
Institut für Informatik, Universität zu Köln, Germany;Institut für Informatik, Universität zu Köln, Germany
Venue:
GD'12 Proceedings of the 20th international conference on Graph Drawing
Year:
2012

Citing 9
Cited 0

Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Tree-Maps: a space-filling approach to the visualization of hierarchical information structures

VIS '91 Proceedings of the 2nd conference on Visualization '91
Voronoi treemaps for the visualization of software metrics

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data

IEEE Transactions on Visualization and Computer Graphics
Visual Exploration of Complex Time-Varying Graphs

IEEE Transactions on Visualization and Computer Graphics
Topographic Visualization of Prefix Propagation in the Internet

IEEE Transactions on Visualization and Computer Graphics
The natural landscape metaphor in information visualization: The role of commonsense geomorphology

Journal of the American Society for Information Science and Technology
Treemaps with bounded aspect ratio

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Winding roads: routing edges into bundles

EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The visualization of clustered graphs is an essential tool for the analysis of networks, in particular, social networks, in which clustering techniques like community detection can reveal various structural properties. In this paper, we show how clustered graphs can be drawn as topographic maps, a type of map easily understandable by users not familiar with information visualization. Elevation levels of connected entities correspond to the nested structure of the cluster hierarchy. We present methods for initial node placement and describe a tree mapping based algorithm that produces an area efficient layout. Given this layout, a triangular irregular mesh is generated that is used to extract the elevation data for rendering the map. In addition, the mesh enables the routing of edges based on the topographic features of the map.