Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D

Authors:
Takao Ito;Kazuo Misue;Jiro Tanaka
Affiliations:
Department of Computer Science, University of Tsukuba, Tennodai, Tsukuba, Japan 305-8577;Department of Computer Science, University of Tsukuba, Tennodai, Tsukuba, Japan 305-8577;Department of Computer Science, University of Tsukuba, Tennodai, Tsukuba, Japan 305-8577
Venue:
Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques
Year:
2009

Citing 8
Cited 1

Evaluating stereo and motion cues for visualizing information nets in three dimensions

ACM Transactions on Graphics (TOG)
Two New Heuristics for Two-Sided Bipartite Graph Drawing

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
H3: laying out large directed graphs in 3D hyperbolic space

INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
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
Overview of Network Information by Using Anchored Maps

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Drawing bipartite graphs on two curves

GD'06 Proceedings of the 14th international conference on Graph drawing
Drawing clustered graphs in three dimensions

GD'05 Proceedings of the 13th international conference on Graph Drawing

Extracting a keyword network of flood disaster measures

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the readability decreases when large-scale graphs are drawn. To maintain the readability in drawing large-scale graphs, we developed "sphere anchored maps," in which nodes in one set are arranged on a sphere. We describe the layout method for sphere anchored maps and the results of our user study. The results of our study revealed that more clusters of free nodes can be found using sphere anchored maps than using circular anchored maps. Thus, our maps have high readability, particularly around anchors.