On Point-sets that Support Planar Graphs


International audienceA universal point-set supports a crossing-free drawing of any planar graph. For a planar graph with nn vertices, if bends on edges of the drawing are permitted, universal point-sets of size nn 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 nn vertices can be drawn on a universal set S\cal S of O(n2/logn)O(n^2/\log n) points with at most one bend per edge and with the vertices and the bend points in S\cal S. If two bends per edge are allowed, we show that O(nlogn)O(n\log n) points are sufficient, and if three bends per edge are allowed, O(n)O(n) points are sufficient. When no bends on edges are permitted, no universal point-set of size o(n2)o(n^2) is known for the class of planar graphs. We show that a set of nn points in balanced biconvex position supports the class of maximum-degree-3 series-parallel lattices

Similar works

Full text


INRIA a CCSD electronic archive server

Provided a free PDF
oaioai:HAL:hal-00684510v1Last time updated on 11/9/2016View original full text link

This paper was published in INRIA a CCSD electronic archive server.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.