Drawing Clustered Graphs as Topographic Maps

Gronemann, Martin and Jünger, Michael (2013) Drawing Clustered Graphs as Topographic Maps. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 426-438(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_38
Classifications: G Algorithms and Complexity > G.350 Clusters
P Styles > P.180 Cluster
P Styles > P.300 Curved
S Software and Systems > S.120 Visualization
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:10
Last Modified: 21 Nov 2013 16:10
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1330

Actions (login required)

View Item View Item