Drawing Graphs with Fat Edges

Traditionally, graph drawing algorithms represent vertices as circles and edges as curves connecting the vertices. This project focusses on drawing with ``fat'' edges, i.e., with edges of variable thickness. The thickness of an edge is often used as a visualization cue, to indicate importance, or to convey some additional information.

Collaborators:

• Christian Duncan, University of Miami.
• Alon Efrat, University of Arizona.
• Stephen Kobourov, University of Arizona.

Publications:

• ``Drawing with Fat Edges'' (C.A. Duncan, A. Efrat, S.G. Kobourov, and C. Wenk), accepted to International Journal of Foundations of Computer Science (IJFCS), special issue on Graph Drawing
• ``Drawing Fat Graphs'' [avi, gzipped video, abstract ps] (A. Efrat, S.G.Kobourov, M. Stepp, and C. Wenk), Video, 18th Ann. Symp. Computational Geometry (SoCG), 2002, Barcelona, Spain
• ``Drawing with Fat Edges'' [ps.gz, pdf] (C.A. Duncan, A. Efrat, S.G. Kobourov, and C. Wenk), Proc. 9th Int. Symp. Graph Drawing (GD): 162-177, 2001, 2001, Vienna, Austria