Visibility Representation

Graphs can be used to represent relational information. This is the reason why it is often useful to draw graphs in order to visualize this relational information.

Example Visibility Representation

A visibility representation of a planar graph is a drawing such that all nodes are drawn as horizontal segments and all edges are drawn as vertical segments. The resulting drawing is planar, i.e., edges do not cross.

LEDA Function for Visibility Representation

Let G=(V,E)be a planar graph without self loops. VISIBILITY_REPRESENTATION()computes a visibility representation of G in time O(|V|). The size of the layout is at most (2n-4)x(n-1).

Example VISIBILITY_REPRESENTATION()

See also:

Graph Drawing Algorithms

Algorithms for Planar Graphs

Planar Maps

Graph Algorithms

Graphs and Related Data Types

Manual Entries:

Manual Page Graph Drawing Algorithms