The Libraries will be performing routine maintenance on UWSpace on October 20th, 2025, from 10:00-10:30 pm ET. UWSpace will be unavailable during this time. Service should resume by 10:30 pm ET.
 

Upward Octagonal Drawings of Ternary Trees

Loading...
Thumbnail Image

Date

2016-09-08

Authors

Lee, Seunghee

Advisor

Chan, Timothy
Biedl, Therese

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

We explore ways to embed a ternary tree in an integer coordinate grid such that the width of the drawing is minimized. We provide upper and lower bounds on the width requirement of planar, straight-line, upward, order-preserving drawings of ternary trees in an octagonal grid. We present a linear-time algorithm for constructing such octagonal grid drawings of any $n$-node ternary tree with $O(n^{0.68})$ width. (This bound can be improved to $O(n^{0.631})$ width in the so-called HVA-model.) For ideal octagonal grid drawings of complete $n$-node ternary trees, we provide an $\Omega(n^{0.411})$ width lower bound.

Description

Keywords

graph drawing, ternary trees, octagonal, tree drawing

LC Subject Headings

Citation