An Algorithm for Drawing Binary Trees with Less Bends
Sung-Kwon Kim · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2000
In this paper we present polyline upward order preserving grid drawing algorithm for binary trees with n vertices that achieves 0(n) height, 0(log n) width and 0(nlog n) area, matching the previously known results, and that reduces the number of bends to 0(n/log n) from 0(n)