Visual Who: animating the affinities and activities of an electronic community
Proceedings of the third ACM international conference on Multimedia
Drawing bipartite graphs as anchored maps
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Visual Analysis Tool for Bipartite Networks
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
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
Organization Diagnosis Tools Based on Social Network Analysis
Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009
Visualizing stakeholder concerns with anchored map
HI'11 Proceedings of the 2011 international conference on Human interface and the management of information - Volume Part I
| Hi-index | 0.00 |
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipartite graph, the nodes in A, which are called "anchors," are arranged on the circumference, and the nodes in B, which are called "free nodes," are arranged at suitable positions in relation to the adjacent anchors. This article describes aesthetic criteria that are employed according to the purpose of drawing anchored maps and indices which are used to arrange the anchors so that they satisfy the criteria. It also shows an example of taking overviews of networks by using the developed technique.