On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees

February 28, 2019 Β· Declared Dead Β· πŸ› Theoretical Computer Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Barbara Covella, Fabrizio Frati, Maurizio Patrignani arXiv ID 1902.11044 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CG, math.CO Citations 2 Venue Theoretical Computer Science Last Checked 4 months ago
Abstract
In this paper, we study the area requirements of planar straight-line orthogonal drawings of ternary trees. We prove that every ternary tree admits such a drawing in sub-quadratic area. Further, we present upper bounds, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete ternary trees. Finally, we present a polynomial lower bound on the length of the minimum side of any planar straight-line orthogonal drawing of a complete ternary tree.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted