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

02/28/2019
by   Barbara Covella, et al.
0

In this paper, we study the area requirements of planar straight-line orthogonal drawings of ternary trees. We prove that every ternary tree admits such a drawing in sub-quadratic area. Further, we present upper bounds, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete ternary trees. Finally, we present a polynomial lower bound on the length of the minimum side of any planar straight-line orthogonal drawing of a complete ternary tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2018

Tree Drawings Revisited

We make progress on a number of open problems concerning the area requir...
research
08/09/2019

On the Edge-Length Ratio of Planar Graphs

The edge-length ratio of a straight-line drawing of a graph is the ratio...
research
12/20/2019

Improved Upper and Lower Bounds for LR Drawings of Binary Trees

In SODA'99, Chan introduced a simple type of planar straight-line upward...
research
08/31/2017

On Upward Drawings of Trees on a Given Grid

Computing a minimum-area planar straight-line drawing of a graph is know...
research
09/16/2019

How to Morph a Tree on a Small Grid

In this paper we study planar morphs between straight-line planar grid d...
research
08/24/2021

Consistent Simplification of Polyline Tree Bundles

The Polyline Bundle Simplification (PBS) problem is a generalization of ...
research
08/26/2022

Rectilinear Planarity of Partial 2-Trees

A graph is rectilinear planar if it admits a planar orthogonal drawing w...

Please sign up or login with your details

Forgot password? Click here to reset