English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

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 whether $T$ always has a planar drawing on $P$ such thateach edge is drawn as an orthogonal path with one bend (an "L-shaped" edge). Bygiving new methods for drawing trees, we improve the bounds on the size of thepoint set $P$ for which such drawings are possible to: $O(n^{1.55})$ formaximum degree 4 trees; $O(n^{1.22})$ for maximum degree 3 (binary) trees; and$O(n^{1.142})$ for perfect binary trees.  Drawing ordered trees with L-shaped edges is harder---we give an example thatcannot be done and a bound of $O(n \log n)$ points for L-shaped drawings ofordered caterpillars, which contrasts with the known linear bound for unorderedcaterpillars.

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