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.
Chapter PDF
Similar content being viewed by others
References
Misue, K.: Drawing Bipartite Graphs as Anchored Maps. In: Proceedings of Asia-Pacific Symposium on Information Visualization (APVIS 2006), pp. 169–177 (2006)
Misue, K.: Overview of Network Information by Using Anchored Maps. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 1269–1276. Springer, Heidelberg (2007)
Zheng, L., Song, L., Eades, P.: Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. In: Proceedings of Asia-Pacific Symposium on Information Visualization (APVIS 2005), pp. 33–38 (2005)
Giacomo, E.D., Grilli, L., Liotta, G.: Drawing Bipartite Graphs on Two Curves. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 380–385. Springer, Heidelberg (2007)
Newton, M., Sykora, O., Vrto, I.: Two New Heuristics for Two-Sided Bipartite Graph Drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 312–319. Springer, Heidelberg (2002)
Munzner, T.: H3: Laying out large directed graphs in 3d hyperbolic space. In: Proceedings of the 1997 IEEE Symposium on Information Visualization, pp. 2–10 (1997)
Ho, J., Hong, S.H.: Drawing Clustered Graphs in Three imensions. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 492–502. Springer, Heidelberg (2006)
Eades, P.: A heuristic for graph drawing. Congressus Numeranitium 42, 149–160 (1984)
Ito, T., Misue, K., Tanaka, J.: Drawing of Spherical Anchored Map in 3D Space for Bipartite Graphs and Interactive Browsing Techniques. In: Proc. 70th Conf. Inf. Proc. Soc. Jpn, pp. 4-317–4-318 (2008) (in Japanese)
Ware, C., Franck, G.: Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions. In: ACM Transactions on Graphics, pp. 121–140 (1996)
Saff, E.B., Kuijlaars, A.B.J.: Distributing many points on the sphere. Mathematical Intelligencer 19(1), 5–11 (1997)
Katanforoush, A., Shahshahani, M.: Distributing Points on the Sphere. I. Experiment. Math. 12(2), 199–209 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, T., Misue, K., Tanaka, J. (2009). Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D. In: Jacko, J.A. (eds) Human-Computer Interaction. Novel Interaction Methods and Techniques. HCI 2009. Lecture Notes in Computer Science, vol 5611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02577-8_89
Download citation
DOI: https://doi.org/10.1007/978-3-642-02577-8_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02576-1
Online ISBN: 978-3-642-02577-8
eBook Packages: Computer ScienceComputer Science (R0)