On The Area Requirements Of Straight-Line Orthogonal Drawings Of Ternary Trees
COMBINATORIAL ALGORITHMS, IWOCA 2018(2018)
摘要
We prove that every n-node ternary tree has a planar straight-line orthogonal drawing in O(n(1.576)) area, improving upon the previously best known O(n(1.631)) bound. Further, we present an upper bound, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete ternary trees.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络