Abstract

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 S of O(n2/logn) points with at most one bend per edge and with the vertices and the bend points in S. If two bends per edge are allowed, we show that O(nlogn) 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(n2) 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.