Generalized LR-drawings of trees
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio, Montecchiani

TL;DR
This paper extends the LR-drawing method, originally for binary trees, to trees of higher arity by proving the existence of special root-to-leaf paths and using them for generalized drawings.
Contribution
It introduces a generalized LR-drawing technique applicable to trees of arbitrary arity, building on existing binary tree methods.
Findings
Existence of special root-to-leaf paths in higher arity trees
Generalized LR-drawings for arbitrary arity trees
Method preserves properties of original LR-drawings
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Data Management and Algorithms · Data Visualization and Analytics
