Chapter

Algorithms and Data Structures

Volume 2748 of the series Lecture Notes in Computer Science pp 281-293

Drawing Graphs with Large Vertices and Thick Edges

  • Gill BarequetAffiliated withCenter for Graphics and Geometric Computing, Dept. of Computer Science, The Technion, Israel Institute of Technology
  • , Michael T. GoodrichAffiliated withDept. of Information and Computer Science, Univ. of California
  • , Chris RileyAffiliated withCenter for Algorithm Engineering, Dept. of Computer Science, Johns Hopkins University

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.