Maintaining the Mental Map for Circular Drawings

Authors:
Michael Kaufmann;Roland Wiese
Affiliations:
-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 7
Cited 5

On-line graph algorithms with SPQR-trees

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Drawing clusters and hierarchies

Drawing graphs
Dynamic graph drawing

Drawing graphs
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Circular Layout in the Graph Layout Toolkit

GD '96 Proceedings of the Symposium on Graph Drawing
Graph Clustering 1: Circles of Cliques

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Mental map preserving graph drawing using simulated annealing

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Group-Level Analysis and Visualization of Social Networks

Algorithmics of Large and Complex Networks
Improved circular layouts

GD'06 Proceedings of the 14th international conference on Graph drawing
Multi-circular layout of micro/macro graphs

GD'07 Proceedings of the 15th international conference on Graph drawing
Mental map preserving graph drawing using simulated annealing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present new ideas to extend the framework for circular drawing of networks by Six and Tollis [15] bysome new concepts which makes the framework suitable for user interaction. The original approach displays each biconnected component in a circular way, and the blocktree of the graph as a tree drawn radially [9]. We introduce the concept of hicircular drawings, a hierarchical extension of the mentioned framework replacing the circles of single vertices by circles of circular or star-like structures. This concept is inspired by the works of Brandenburg on graph clustering, and the recursive concepts of series-parallel graphs, PQ- resp. SPQR-trees.