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

被引：1

作者：

Covella, Barbara ^{[1
]}

Frati, Fabrizio ^{[1
]}

Patrignani, Maurizio ^{[1
]}

机构：

[1] Roma Tre Univ, Rome, Italy

来源：

COMBINATORIAL ALGORITHMS, IWOCA 2018 | 2018年 / 10979卷

基金：

欧盟地平线“2020”;

关键词：

D O I：

10.1007/978-3-319-94667-2_11

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：128 / 140

页数：13

共 50 条

[21] Straight-line drawings of 1-planar graphs
Brandenburg, Franz J.
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 116
[22] An experimental study on the ply number of straight-line drawings
De Luca F.
Di Giacomo E.
Didimo W.
Kobourov S.
Liotta G.
Journal of Graph Algorithms and Applications, 2019, 23 (01) : 71 - 91
[23] An Experimental Study on the Ply Number of Straight-Line Drawings
De Luca, F.
Di Giacomo, E.
Didimo, W.
Kobourov, S. G.
Liotta, G.
GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 2016, 9801 : 617 - 619
[24] Stretching Two Pseudolines in Planar Straight-Line Drawings
Mchedlidze, Tamara
Radermacher, Marcel
Rutter, Ignaz
Stumpf, Peter
GRAPH DRAWING AND NETWORK VISUALIZATION, 2019, 11904 : 590 - 592
[25] An Experimental Study on the Ply Number of Straight-Line Drawings
De Luca, Felice
Di Giacomo, Emilio
Didimo, Walter
Kobourov, Stephen
Liotta, Giuseppe
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, 10167 : 135 - 148
[26] Straight-line drawings of protein interactions - System demonstration
Basalaj, W
Eilbeck, K
GRAPH DRAWING, 1999, 1731 : 259 - 266
[27] Balancing Straight-Line Programs for Strings and Trees
Lohrey, Markus
BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020, 2020, 12098 : 296 - 300
[28] Acute Constraints in Straight-Line Drawings of Planar Graphs
Seto, Akane
Shurbevski, Aleksandar
Nagamochi, Hiroshi
Eades, Peter
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (09) : 994 - 1001
[29] ON REDUCING THE SPACE REQUIREMENTS OF A STRAIGHT-LINE ALGORITHM
CARLSON, DA
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 442 - 450
[30] Straight-line grid drawings of label-constrained outerplanar graphs with O(nlogn) area
Karim M.R.
Alam M.J.
Rahman M.S.
Journal of Graph Algorithms and Applications, 2011, 15 (03) : 437 - 456

← 1 2 3 4 5 →