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

Therese Biedl, Timothy M. Chan, Martin Derka +2

Let $T$ be an $n$-node tree of maximum degree 4, and let $P$ be a set of $n$ points in the plane with no two points on the same horizontal or vertical line. It is an open question…