Universal point sets for planar three-trees
نویسندگان
چکیده
منابع مشابه
Universal Point Sets for Planar Three-Trees
For every n ∈ N, we present a set Sn of O(n log n) points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of Sn. This is the first subquadratic upper bound on the size of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.
متن کاملUniversal point sets for planar three-tree
For every n ∈ N, we present a set Sn of O(n log n) points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of Sn. This is the first subquadratic upper bound on the size of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.
متن کاملOn Universal Point Sets for Planar Graphs
A set P of points in R is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n 15. Conversely, we use a computer program to show that there exist universal point sets for all n 10 and to enumerate all corresponding order types. Finally, we describe a col...
متن کاملUniversal Line-Sets for Drawing Planar 3-Trees
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 se...
متن کاملUniversal Point Sets for Planar Graph Drawings with Circular Arcs
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2014.12.005