Strictly-upward drawings of ordered search trees
نویسندگان
چکیده
منابع مشابه
Strictly-upward Drawings of Ordered Search Trees
We prove that any logarithmic binary tree admits a linear-area straight-line strictly-upward planar grid drawing (in short, strictly-upward drawing), that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. Informally, a logarit...
متن کاملLinear area upward drawings of AVL trees
We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. © 1998 Elsevier Science B.V.
متن کاملMinimum-Layer Upward Drawings of Trees
An upward drawing of a rooted tree T is a planar straight-line drawing of T where the vertices of T are placed on a set of horizontal lines, called layers, such that for each vertex u of T , no child of u is placed on a layer vertically above the layer on which u has been placed. In this paper we give a linear-time algorithm to obtain an upward drawing of a given rooted tree T on the minimum nu...
متن کاملOn Upward Drawings of Trees on a Given Grid
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algo...
متن کاملOptimum-width upward drawings of trees I: Rooted pathwidth
An upward drawing of a rooted tree is a drawing such that no parents are below their children. It is ordered if the edges to children appear in prescribed order around each vertex. It is well-known that any tree has an upward (unordered) drawing with width log(n+ 1). For ordered drawings, the best-known bounds for the width for binary trees is O(logn), while for arbitrary trees it is O(2 √ ). W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00287-9