Jump to content

Graph drawing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 130.195.196.201 (talk) at 05:20, 13 July 2004 (→External links: Duplicate link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Graphs are often represented pictorially as follows: draw a dot for every vertex, and for every edge draw an arc connecting its endpoints. If the graph is directed, indicate the endpoint of an edge by an arrow.

There are different approaches to graph layout and these are considered under a branch of graph theory termed as graph drawing.

Note that this graphical representation (a layout) should not be confused with the graph itself (the abstract, non-graphical structure). Very different layouts can correspond to the same graph (see external link #1). All that matters is which vertices are connected to which others by how many edges.

Some of the well known layouts are

  • spring layout - by using an energy function that is minimized so that nodes and edges spread out by repulsion.
  • orthogonal layout - layout with edges running horizontally or vertically, with approaches that reduce the number of edge crossovers and area covered. These are of great interest in the areas of VLSI and PCB layout design.
  • symmetric layout - these attempt to find symmetry groups within the graph
  • tree layout - these show a rooted tree-like formation, suitable for trees (ie graphs without cycles)
  • hierarchical layouts - these attempt to find a source and sink within a directed graph and arrange the nodes in layers with most edges starting from the source and flowing in the direction of the sink.

Academic Conferences

One of the top academic conferences for new research in graph drawing is the annually held International Symposium on Graph Drawing (GD).

GD 2004

See also

References

  • Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
  • Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis. Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry: Theory and Applications 4:235-282 (1994). http://www.cs.brown.edu/people/rt/gd.html
  • Isabel F. Cruz, Roberto Tamassia. Graph Drawing Tutorial. http://www.cs.brown.edu/people/rt/gd.html

Here are some examples of graph layouts:

Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph_drawing&oldid=4598848"