Let Gbe a connected undirected graph, and let Rbe the minimum axis-parallel rectangle that includes all the vertices of a drawing of G. Herein, we consider the problem of drawing Gcontaining one particularly important notable vertex. It is desirable that this notable vertex, which we call the focus vertex, be placed as close to the center of rectangle Ras possible. We present an algorithm that appropriately draws Gwith a focus vertex, and show the effectiveness of our algorithm by computational experiments that compare our results with that of Kawanishi’s algorithm.

graph drawing algorithm, force-directed method, focus vertex.