Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs

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.

• Type: Conference
• Year: 2007
• Where: HCI
• Authors: Kazuo Misue
• Keywords: Anchored Maps, Bipartite Graph, HCI 2007, Human Computer Interaction, Node Set