Anchored Map: Graph Drawing Technique to Support Network Mining

Authors:
Kazuo Misue
Affiliations:
-
Venue:
IEICE - Transactions on Information and Systems
Year:
2008

Citing 8
Cited 0

Algorithms for plane representations of acyclic digraphs

Theoretical Computer Science
Visual Who: animating the affinities and activities of an electronic community

Proceedings of the third ACM international conference on Multimedia
Two New Heuristics for Two-Sided Bipartite Graph Drawing

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Nice Drawings for Planar Bipartite Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Crossing minimization problems of drawing bipartite graphs in two clusters

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Drawing bipartite graphs as anchored maps

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Analysis and Visualization of Co-authorship Networks for Understanding Academic Collaboration and Knowledge Domain of Individual Researchers

CGIV '06 Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation
Drawing bipartite graphs on two curves

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because network diagrams drawn using the spring embedder are not easy to read, this paper proposes the use of “anchored maps” in which some nodes are fixed as anchors. The readability of network diagrams is discussed, anchored maps are proposed, and a method for drawing anchored maps is explained. The method uses indices to decide the orders of anchors because those orders markedly affect the readability of the network diagrams. Examples showing the effectiveness of the anchored maps are also shown.