Drawing series-parallel graphs on a box
نویسندگان
چکیده
منابع مشابه
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملLower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملPlane 3-trees: Embeddability & Approximation
We give anO(n log n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the plane, determines whether G has a point-set embedding on S (i.e., a planar straight-line drawing of G where each vertex is mapped to a distinct point of S), improving the O(n)-time O(n)-space algorithm of Moosa and Rahman. Given an arbitrary plane graph G and a point set ...
متن کاملDrawing Graphs by Example E ciently : Trees and Planar Acyclic Digraphs ? ( Extended Abstract )
Constraint-based graph drawing systems provide expressive power and exibility. Previously proposed approaches make use of general constraint solvers, which are ineecient, and of textual speciication of constraints, which can be long and diicult to understand. In this paper we propose the use of a constraint-based visual language for constructing planar drawings of trees, series-parallel graphs,...
متن کاملA Framework for Dynamic Graph
Drawing graphs is an important problem that combines avors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002