A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio

Graph layouts and visualizations have been at the forefront of graph drawing research for decades, consequently leading to aesthetic heuristics that not only generate better visualizations and aesthetically appealing graphs but also improve readability and understanding of the graphs. A variety of approaches examines aesthetics of nodes, edges, or graph layout, and related readability metrics. Improving the known bounds on two aesthetic requirements (area and aspect ratio) for planar straight-line order-preserving grid drawings of binary trees is presented in an algorithm that uses a separation approach. The new bounds are optimal in area and aspect ratio, where the optimum values are linear and 1:1 respectively.