Drawing Clustered Graphs as Topographic Maps

Gronemann, Martin and Jünger, Michael (2012) Drawing Clustered Graphs as Topographic Maps. [Preprint]

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (17MB) | Preview


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 visu- alization. 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 ir- regular 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 topo- graphic features of the map.

Item Type: Preprint
Classifications: G Algorithms and Complexity > G.350 Clusters
M Methods > M.900 Tree
P Styles > P.300 Curved
S Software and Systems > S.120 Visualization
Depositing User: Administration GDEA
Date Deposited: 12 Jun 2012 15:09
Last Modified: 23 Jun 2016 08:31
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1288

Actions (login required)

View Item View Item