On Point-sets that Support Planar Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computational Geometry Year : 2013

On Point-sets that Support Planar Graphs


A universal point-set supports a crossing-free drawing of any planar graph. For a planar graph with $n$ vertices, if bends on edges of the drawing are permitted, universal point-sets of size $n$ are known, but only if the bend points are in arbitrary positions. If the locations of the bend points must also be specified as part of the point set, we prove that any planar graph with $n$ vertices can be drawn on a universal set $\cal S$ of $O(n^2/\log n)$ points with at most one bend per edge and with the vertices and the bend points in $\cal S$. If two bends per edge are allowed, we show that $O(n\log n)$ points are sufficient, and if three bends per edge are allowed, $O(n)$ points are sufficient. When no bends on edges are permitted, no universal point-set of size $o(n^2)$ is known for the class of planar graphs. We show that a set of $n$ points in balanced biconvex position supports the class of maximum-degree-3 series-parallel lattices.
Vignette du fichier
2013 On Point-sets that Support Planar Graphs.png (39.42 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
journalversion.pdf (476.86 Ko) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)

Dates and versions

hal-00684510 , version 1 (02-04-2012)



Vida Dujmović, Will Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, et al.. On Point-sets that Support Planar Graphs. Computational Geometry, 2013, 43 (1), pp.29--50. ⟨10.1016/j.comgeo.2012.03.003⟩. ⟨hal-00684510⟩
327 View
168 Download



Gmail Facebook Twitter LinkedIn More