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
基金
欧盟地平线“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 条
  • [21] From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
    Di Battista, Giuseppe
    Frati, Fabrizio
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2025, 27 (02):
  • [22] Straight-Line Rectangular Drawings of Clustered Graphs
    Angelini, Patrizio
    Frati, Fabrizio
    Kaufmann, Michael
    ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 25 - +
  • [23] Straight-Line Rectangular Drawings of Clustered Graphs
    Angelini, Patrizio
    Frati, Fabrizio
    Kaufmann, Michael
    DISCRETE & COMPUTATIONAL GEOMETRY, 2011, 45 (01) : 88 - 140
  • [24] Straight-line drawings of outerplanar graphs in O (dn log n) area
    Frati, Fabrizio
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2012, 45 (09): : 524 - 533
  • [25] Straight-Line Rectangular Drawings of Clustered Graphs
    Patrizio Angelini
    Fabrizio Frati
    Michael Kaufmann
    Discrete & Computational Geometry, 2011, 45 : 88 - 140
  • [26] PLANAR STRAIGHT-LINE AND THE PRIMARY PLANE
    SAXON, E
    ARTFORUM, 1979, 17 (08): : 36 - 41
  • [27] Planar straight-line point-set embedding of trees with partial embeddings
    Bagheri, Alireza
    Razzazi, Mohammadreza
    INFORMATION PROCESSING LETTERS, 2010, 110 (12-13) : 521 - 523
  • [28] A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
    Hong, SH
    Eades, P
    GRAPH DRAWING, 2004, 3383 : 307 - 317
  • [29] PERCEPTUAL SAMPLING OF ORTHOGONAL STRAIGHT-LINE FEATURES
    TOWNSEND, JT
    HU, GG
    ASHBY, FG
    PSYCHOLOGICAL RESEARCH-PSYCHOLOGISCHE FORSCHUNG, 1981, 43 (03): : 259 - 275
  • [30] 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