Universität zu Köln

Gronemann, Martin ORCID: 0000-0003-2565-090X and Jünger, Michael (2013). Drawing Clustered Graphs as Topographic Maps. In: Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, pp. 426-438. Springer.

Preview

PDF topmap.pdf - Draft Version Download (17MB) | Preview

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.

Item Type:	Book Section
Creators:	Creators Email ORCID ORCID Put Code Gronemann, Martin UNSPECIFIED https://orcid.org/0000-0003-2565-090X UNSPECIFIED Jünger, Michael UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-550292
Title of Book:	Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers
Series Name:	Lecture Notes in Computer Science
Volume:	7704
Page Range:	pp. 426-438
Date:	2013
Publisher:	Springer
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/55029