Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.09269 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909645819346944 |
|---|---|
| author | Bui, Hong Duc |
| author_facet | Bui, Hong Duc |
| contents | We resolve a conjecture posed by Covella, Frati and Patrignani by proving the straight-line orthogonal drawing of the complete ternary tree with $n$ nodes satisfying the subtree separation property with smallest area has area $Ω(n^{1.031})$. We also improve the upper bound of this area to $O(n^{1.032})$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09269 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area Bui, Hong Duc Computational Geometry We resolve a conjecture posed by Covella, Frati and Patrignani by proving the straight-line orthogonal drawing of the complete ternary tree with $n$ nodes satisfying the subtree separation property with smallest area has area $Ω(n^{1.031})$. We also improve the upper bound of this area to $O(n^{1.032})$. |
| title | Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2506.09269 |