Drawing Clustered Graphs as Topographic Maps

Gronemann, Martin and J√ľnger, Michael (2013) Drawing Clustered Graphs as Topographic Maps.
Published In: Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, Lecture Notes in Computer Science. 7704 Springer 2013, pp. 426-438.

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


Actions:
Download: [img] PDF - Preprinted Version
Download (17Mb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Proceedings article
Citations: No citation data.
Uncontrolled Keywords:
Subjects:
  • 05-XX Combinatorics > 05Cxx Graph theory > 05C99 None of the above, but in this section

  • Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Martin Gronemann
    Date Deposited: 12 Jun 2012 12:37
    Last Modified: 08 May 2013 14:12
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/682