Tutte embedding

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In graph drawing and geometric graph theory, a Tutte embedding or barycentric embedding of a simple 3-vertex-connected planar graph is a crossing-free straight-line embedding with the properties that the outer face is a convex polygon and that each interior vertex is at the average (or barycenter) of its neighbors' positions. If the outer polygon is fixed, this condition on the interior vertices determines their position uniquely as the solution to a system of linear equations. Solving the equations geometrically produces a planar embedding. Tutte's spring theorem, proven by W. T. Tutte (1963), states that this unique solution is always crossing-free, and more strongly that every face of the resulting planar embedding is convex.[1] It is called the spring theorem because such an embedding can be found as the equilibrium position for a system of springs representing the edges of the graph.


Tutte embedding of the graph of a cube. The outer four vertices are fixed at the corners of a unit square and each remaining vertex is at the average of its neighbors' positions.

Let G be the graph of a cube, and (selecting one of its quadrilateral faces as the outer face) fix the four vertices of the outer face at the four corners of a unit square, the points whose x and y coordinates are all four combinations of zero and one. Then, if the remaining four vertices are placed at the four points whose x and y coordinates are combinations of 1/3 and 2/3, as in the figure, the result will be a Tutte embedding. For, at each interior vertex v of the embedding, and for each of the two coordinates, the three neighbors of v have coordinate values that are equal to v, smaller by 1/3, and larger by 1/3; the average of these values is the same as the coordinate value of v itself.

System of linear equations[edit]

The condition that a vertex v be at the average of its neighbors' positions may be expressed as two linear equations, one for the x coordinate of v and another for the y coordinate of v. For a graph with n vertices, h of which are fixed in position on the outer face, there are two equations for each interior vertex and also two unknowns (the coordinates) for each interior vertex. Therefore, this gives a system of linear equations with 2(n − h) equations in 2(n − h) unknowns, the solution to which is a Tutte embedding. As Tutte (1963) showed, for 3-vertex-connected planar graphs, this system is non-degenerate. Therefore, it has a unique solution, and (with the outer face fixed) the graph has a unique Tutte embedding. This embedding can be found in polynomial time by solving the system of equations, for instance by using Gaussian elimination.[2]

Polyhedral representation[edit]

By Steinitz's theorem, the 3-connected planar graphs to which Tutte's spring theorem applies coincide with the polyhedral graphs, the graphs formed by the vertices and edges of a convex polyhedron. According to the Maxwell–Cremona correspondence, a two-dimensional embedding of a planar graph forms the vertical projection of a three-dimensional convex polyhedron if and only if the embedding has an equilibrium stress, an assignment of forces to each edge (affecting both endpoints in equal and opposite directions parallel to the edge) such that the forces cancel at every vertex. For a Tutte embedding, assigning to each edge an attractive force proportional to its length (like a spring) makes the forces cancel at all interior vertices, but this is not necessarily an equilibrium stress at the vertices of the outer polygon. However, when the outer polygon is a triangle, it is possible to assign repulsive forces to its three edges to make the forces cancel there, too. In this way, Tutte embeddings can be used to find Schlegel diagrams of every convex polyhedron. For every 3-connected planar graph G, either G itself or the dual graph of G has a triangle, so either this gives a polyhedral representation of G or of its dual; in the case that the dual graph is the one with the triangle, polarization gives a polyhedral representation of G itself.[2]


Gortler, Gotsman & Thurston (2006) proved results analogous to Tutte's spring theorem for graphs embedded on a torus.[3]

Chilakamarri, Dean & Littman (1995) investigate three-dimensional graph embeddings of the graphs of four-dimensional polytopes, formed by the same method as Tutte's embedding: choose one facet of the polytope as being the outer face of a three-dimensional embedding, and fix its vertices into place as the vertices of a three-dimensional polyhedron in space. Let each remaining vertex of the polytope be free to move in space, and replace each edge of the polytope by a spring. Then, find the minimum-energy configuration of the system of springs. As they show, the system of equations obtained in this way is again non-degenerate, but it is unclear under what conditions this method will find an embedding that realizes all facets of the polytope as convex polyhedra.[4]

Related results[edit]

The result that every simple planar graph can be drawn with straight line edges is called Fáry's theorem.[5] The Tutte spring theorem proves this for 3-connected planar graphs, but the result is true more generally for planar graphs regardless of connectivity. Using the Tutte spring system for a graph that is not 3-connected may result in degeneracies, in which subgraphs of the given graph collapse onto a point or a line segment; however, an arbitrary planar graph may be drawn using the Tutte embedding by adding extra edges to make it 3-connected, drawing the resulting 3-connected graph, and then removing the extra edges.

A graph is k-vertex-connected, but not necessarily planar, if and only if it has an embedding into (k −1)-dimensional space in which an arbitrary k-tuple of vertices are placed at the vertices of a simplex and, for each remaining vertex v, the convex hull of the neighbors of v is full-dimensional with v in its interior. If such an embedding exists, one can be found by fixing the locations of the chosen k vertices and solving a system of equations that places each vertex at the average of its neighbors, just as in Tutte's planar embedding.[6]

In finite element mesh generation, Laplacian smoothing is a common method for postprocessing a generated mesh to improve the quality of its elements;[7] it is particularly popular for quadrilateral meshes, for which other methods such as Lloyd's algorithm for triangular mesh smoothing are less applicable. In this method, each vertex is moved to or towards the average of its neighbors' positions, but this motion is only performed for a small number of iterations, to avoid large distortions of element sizes or (in the case of non-convex mesh domains) tangled non-planar meshes.

Force-directed graph drawing systems continue to be a popular method for visualizing graphs, but these systems typically use more complicated systems of forces that combine attractive forces on graph edges (as in Tutte's embedding) with repulsive forces between arbitrary pairs of vertices. These additional forces may cause the system to have many locally stable configurations rather than, as in Tutte's embedding, a single global solution.[8]


  1. ^ Tutte, W. T. (1963), "How to draw a graph", Proceedings of the London Mathematical Society, 13: 743–767, MR 0158387, doi:10.1112/plms/s3-13.1.743 .
  2. ^ a b Rote, Günter (2012), "Realizing planar graphs as convex polytopes", Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011, Revised Selected Papers, Lecture Notes in Computer Science, 7034, Springer, pp. 238–241, doi:10.1007/978-3-642-25878-7_23 .
  3. ^ Gortler, Steven J.; Gotsman, Craig; Thurston, Dylan (2006), "Discrete one-forms on meshes and applications to 3D mesh parameterization", Computer Aided Geometric Design, 23 (2): 83–112, MR 2189438, doi:10.1016/j.cagd.2005.05.002 .
  4. ^ Chilakamarri, Kiran; Dean, Nathaniel; Littman, Michael (1995), "Three-dimensional Tutte embedding", Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), Congressus Numerantium, 107: 129–140, MR 1369261 .
  5. ^ For the relation between Tutte's and Fáry's theorem, and the history of rediscovery of Fáry's theorem, see Felsner, Stefan (2012), Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, Advanced Lectures in Mathematics, Springer, p. 37, ISBN 9783322803030 .
  6. ^ Linial, N.; Lovász, L.; Wigderson, A. (1988), "Rubber bands, convex embeddings and graph connectivity", Combinatorica, 8 (1): 91–102, MR 951998, doi:10.1007/BF02122557 .
  7. ^ Herrmann, Leonard R. (1976), "Laplacian-isoparametric grid generation scheme", Journal of the Engineering Mechanics Division, 102 (5): 749–907 .
  8. ^ Kobourov, Stephen G. (2012), Spring Embedders and Force-Directed Graph Drawing Algorithms, arXiv:1201.3011Freely accessible .