Improved Upper and Lower Bounds for LR Drawings of Binary Trees

12/20/2019
by   Timothy M. Chan, et al.
0

In SODA'99, Chan introduced a simple type of planar straight-line upward order-preserving drawings of binary trees, known as LR drawings: such a drawing is obtained by picking a root-to-leaf path, drawing the path as a straight line, and recursively drawing the subtrees along the paths. Chan proved that any binary tree with n nodes admits an LR drawing with O(n^0.48) width. In SODA'17, Frati, Patrignani, and Roselli proved that there exist families of n-node binary trees for which any LR drawing has Ω(n^0.418) width. In this note, we improve Chan's upper bound to O(n^0.437) and Frati et al.'s lower bound to Ω(n^0.429).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2021

Generalized LR-drawings of trees

The LR-drawing-method is a method of drawing an ordered rooted binary tr...
research
02/28/2019

On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees

In this paper, we study the area requirements of planar straight-line or...
research
03/19/2018

Tree Drawings Revisited

We make progress on a number of open problems concerning the area requir...
research
06/22/2018

Improved bounds for multipass pairing heaps and path-balanced binary search trees

We revisit multipass pairing heaps and path-balanced binary search trees...
research
06/18/2018

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

We consider the coordinate assignment phase of the well known Sugiyama f...
research
09/04/2023

Mutual Witness Proximity Drawings of Isomorphic Trees

A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity drawing ...
research
09/24/2019

On the edge-length ratio of 2-trees

We study planar straight-line drawings of graphs that minimize the ratio...

Please sign up or login with your details

Forgot password? Click here to reset