English

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area

Computational Geometry 2025-06-12 v1

Abstract

We resolve a conjecture posed by Covella, Frati and Patrignani by proving the straight-line orthogonal drawing of the complete ternary tree with nn nodes satisfying the subtree separation property with smallest area has area Ω(n1.031)\Omega(n^{1.031}). We also improve the upper bound of this area to O(n1.032)O(n^{1.032}).

Keywords

Cite

@article{arxiv.2506.09269,
  title  = {Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area},
  author = {Hong Duc Bui},
  journal= {arXiv preprint arXiv:2506.09269},
  year   = {2025}
}

Comments

7 pages, 4 figures