Home | Issues | About JGAA | Instructions for Authors |
DOI: 10.7155/jgaa.00078
Drawing Planar Graphs with Large Vertices and Thick Edges
Vol. 8, no. 1, pp. 3-20, 2004. Regular paper.
Abstract We consider the problem of representing size information in the edges and
vertices of a planar graph. Such information can be used, for example, to
depict a network of computers and information traveling through the
network. We present an efficient linear-time algorithm which draws edges
and vertices of varying 2-dimensional areas to represent the amount of
information flowing through them. The algorithm avoids all occlusions of
nodes and edges, while still drawing the graph on a compact integer grid.
|
Journal Supporters
|