Universal point set

From HandWiki
Jump to: navigation, search

In graph drawing, a universal point set of order n is a set S of points in the Euclidean plane with the property that every n-vertex planar graph has a straight-line drawing in which the vertices are all placed at points of S.

Bounds on the size of universal point sets[edit]

Grid drawing of a nested triangles graph. In any drawing of this graph, at least half of the triangles must form a nested chain, which requires a bounding box of size at least n/3 × n/3. The layout shown here comes close to this, using size approximately n/3 × n/2

When n is ten or less, there exist universal point sets with exactly n points, but for all n ≥ 15 additional points are required.[1]

Several authors have shown that subsets of the integer lattice of size O(n) × O(n) are universal. In particular, (de Fraysseix Pach) showed that a grid of (2n − 3) × (n − 1) points is universal, and (Schnyder 1990) reduced this to a triangular subset of an (n − 1) × (n − 1) grid, with n2/2 − O(n) points. By modifying the method of de Fraysseix et al., (Brandenburg 2008) found an embedding of any planar graph into a triangular subset of the grid consisting of 4n2/9 points. A universal point set in the form of a rectangular grid must have size at least n/3 × n/3[2] but this does not rule out the possibility of smaller universal point sets of other types. The smallest known universal point sets are not based on grids, but are instead constructed from superpatterns (permutations that contain all permutation patterns of a given size); the universal point sets constructed in this way have size n2/4 − O(n).[3]

(de Fraysseix Pach) proved the first nontrivial lower bound on the size of a universal point set, with a bound of the form n + Ω(√n), and (Chrobak Karloff) showed that universal point sets must contain at least 1.098n − o(n) points. (Kurowski 2004) stated an even stronger bound of 1.235n − o(n),[4] which was further improved by (Scheucher Schrezenmaier) to 1.293n − o(n).

Closing the gap between the known linear lower bounds and quadratic upper bounds remains an open problem.[5]

Special classes of graphs[edit]

Subclasses of the planar graphs may, in general, have smaller universal sets (sets of points that allow straight-line drawings of all n-vertex graphs in the subclass) than the full class of planar graphs, and in many cases universal point sets of exactly n points are possible. For instance, it is not hard to see that every set of n points in convex position (forming the vertices of a convex polygon) is universal for the n-vertex outerplanar graphs, and in particular for trees. Less obviously, every set of n points in general position (no three collinear) remains universal for outerplanar graphs.[6]

Planar graphs that can be partitioned into nested cycles, 2-outerplanar graphs and planar graphs of bounded pathwidth, have universal point sets of nearly-linear size.[7] Planar 3-trees have universal point sets of size O(n5/3); the same bound also applies to series-parallel graphs.[8]

Other drawing styles[edit]

An arc diagram

As well as for straight-line graph drawing, universal point sets have been studied for other drawing styles; in many of these cases, universal point sets with exactly n points exist, based on a topological book embedding in which the vertices are placed along a line in the plane and the edges are drawn as curves that cross this line at most once. For instance, every set of n collinear points is universal for an arc diagram in which each edge is represented as either a single semicircle or a smooth curve formed from two semicircles.[9]

By using a similar layout, every convex curve in the plane can be shown to contain an n-point subset that is universal for polyline drawing with at most one bend per edge.[10] This set contains only the vertices of the drawing, not the bends; larger sets are known that can be used for polyline drawing with all vertices and all bends placed within the set.[11]


  1. (Cardinal Hoffmann).
  2. (Dolev Leighton); (Chrobak Karloff); (Demaine O'Rourke). A weaker quadratic lower bound on the grid size needed for planar graph drawing was given earlier by (Valiant 1981).
  3. (Bannister Cheng).
  4. (Mondal 2012) claimed that Kurowski's proof was erroneous, but later (after discussion with Jean Cardinal) retracted this claim; see Explanation Supporting Kurowski's Proof, D. Mondal, updated August 9, 2013.
  5. (Demaine O'Rourke); (Brandenburg Eppstein); (Mohar 2007).
  6. (Gritzmann Mohar).
  7. (Angelini Bruckdorfer); (Bannister Cheng).
  8. (Fulek Tóth)
  9. (Giordano Liotta).
  10. (Everett Lazard).
  11. (Dujmović Evans).


https://en.wikipedia.org/wiki/Universal point set was the original source. Read more.