Drawing bipartite graphs as anchored maps
Kazuo Misue · 2006
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 “anchor nodes, ” 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 anchor nodes. This article describes aesthetic criteria that are employed according to the purpose of drawing anchored maps and a method to arrange the anchor nodes so that they satisfy the criteria. The effectiveness of the proposed method is discussed in terms of the aesthetics of drawing results..