Generalized LR-drawings of trees

05/14/2021
by   Therese Biedl, et al.
0

The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study how to generalize this drawing-method to trees of higher arity. We first prove that (with some careful modifications) the proof of existence of a special root-to-leaf path transfers to trees of higher arity. Then we use such paths to obtain generalized LR-drawings of trees of arbitrary arity.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
01/22/2020

Drawing Prolog Search Trees: A Manual for Teachers and Students of Logic Programming

Programming in Prolog is hard for programmers that are used to procedura...
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/05/2017

Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges

Let T be an n-node tree of maximum degree 4, and let P be a set of n poi...
research
03/19/2018

Tree Drawings Revisited

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

A coefficient related to splay-to-root traversal, correct to thousands of decimal places

This paper takes another look at the cost of traversing a binary tree us...
research
07/30/2019

Overlap-free Drawing of Generalized Pythagoras Trees for Hierarchy Visualization

Generalized Pythagoras trees were developed for visualizing hierarchical...

Please sign up or login with your details

Forgot password? Click here to reset