On the area requirements of planar straight-line orthogonal drawings of ternary trees

被引：1
|
作者：
Covella, Barbara [1 ]
Frati, Fabrizio [1 ]
Patrignani, Maurizio [1 ]
机构：
[1] Roma Tre Univ, Rome, Italy
来源：
THEORETICAL COMPUTER SCIENCE | 2021年 / 852卷
基金：
欧盟地平线“2020”;
关键词：
Graph drawing; Ternary tree; Planar straight-line orthogonal drawing; Area requirements; BINARY;
D O I：
10.1016/j.tcs.2020.11.032
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码：197 / 211
页数：15
相关论文
共 50 条
  • [31] Straight-line drawings of protein interactions - System demonstration
    Basalaj, W
    Eilbeck, K
    GRAPH DRAWING, 1999, 1731 : 259 - 266
  • [32] 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
  • [33] Balancing Straight-Line Programs for Strings and Trees
    Lohrey, Markus
    BEYOND THE HORIZON OF COMPUTABILITY, CIE 2020, 2020, 12098 : 296 - 300
  • [34] Testing the planar straight-line realizability of 2-trees with prescribed edge lengths☆
    Alegria, Carlos
    Borrazzo, Manuel
    Da Lozzo, Giordano
    Di Battista, Giuseppe
    Frati, Fabrizio
    Patrignani, Maurizio
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 119
  • [35] An algorithm for straight-line drawing of planar graphs
    Harel, D
    Sardas, M
    ALGORITHMICA, 1998, 20 (02) : 119 - 135
  • [36] ON REDUCING THE SPACE REQUIREMENTS OF A STRAIGHT-LINE ALGORITHM
    CARLSON, DA
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 442 - 450
  • [37] An Algorithm for Straight-Line Drawing of Planar Graphs
    D. Harel
    M. Sardas
    Algorithmica, 1998, 20 : 119 - 135
  • [38] STRAIGHT-LINE REPRESENTATIONS OF INFINITE PLANAR GRAPHS
    THOMASSEN, C
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1977, 16 (DEC): : 411 - 423
  • [39] Searching for undiscovered planar straight-line linkages
    Luo, Zhenjun
    Dai, Jian S.
    ADVANCES IN ROBOT KINEMATICS: MECHANISMS AND MOTION, 2006, : 113 - +
  • [40] 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
12345