Drawing Graphs with Large Vertices and Thick Edges

  • Gill Barequet
  • Michael T. Goodrich
  • Chris Riley
Conference paper

DOI: 10.1007/978-3-540-45078-8_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)
Cite this paper as:
Barequet G., Goodrich M.T., Riley C. (2003) Drawing Graphs with Large Vertices and Thick Edges. In: Dehne F., Sack JR., Smid M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gill Barequet
    • 1
  • Michael T. Goodrich
    • 2
  • Chris Riley
    • 3
  1. 1.Center for Graphics and Geometric Computing, Dept. of Computer ScienceThe Technion, Israel Institute of TechnologyHaifaIsrael
  2. 2.Dept. of Information and Computer ScienceUniv. of CaliforniaIrvineUSA
  3. 3.Center for Algorithm Engineering, Dept. of Computer ScienceJohns Hopkins UniversityBaltimoreUSA

Personalised recommendations