A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Universal Line-Sets for Drawing Planar 3-Trees
[chapter]
2012
Lecture Notes in Computer Science
A set S of lines is universal for drawing planar graphs with n vertices if every planar graph G with n vertices can be drawn on S such that each vertex of G is drawn as a point on a line of S and each edge is drawn as a straight-line segment without any edge crossing. It is known that 2(n−1) 3 parallel lines are universal for any planar graph with n vertices. In this paper we show that a set of n−3 2 + 3 parallel lines or a set of n+3 4 concentric circles are universal for drawing planar
doi:10.1007/978-3-642-28076-4_15
fatcat:oeaxafsnqbfnhlphusp5pijtlm