Hexagonal grid drawings: Algorithms and lower bounds

被引：0
|
作者：
Aziza, S [1 ]
Biedl, T [1 ]
机构：
[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
GRAPH DRAWING | 2004年 / 3383卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n + 3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K-7, and give asymptotic lower bounds for graph classes of varying connectivity.
引用
收藏
页码：18 / 24
页数：7
相关论文
共 50 条
  • [1] Tree Drawings on the Hexagonal Grid
    Bachmaier, Christian
    Brandenburg, Franz J.
    Brunner, Wolfgang
    Hofmeier, Andreas
    Matzeder, Marco
    Unfried, Thomas
    [J]. GRAPH DRAWING, 2009, 5417 : 372 - 383
  • [2] Algorithms and bounds for overloaded orthogonal drawings
    [J]. 2016, Brown University (20)
  • [3] New lower bounds for orthogonal graph drawings
    Biedl, TC
    [J]. GRAPH DRAWING, 1996, 1027 : 28 - 39
  • [4] Bounds for codes identifying vertices in the hexagonal grid
    Cohen, GD
    Honkala, I
    Lobstein, A
    Zémor, G
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2000, 13 (04) : 492 - 504
  • [5] LOWER BOUNDS FOR PLANAR ORTHOGONAL DRAWINGS OF GRAPHS
    TAMASSIA, R
    TOLLIS, IG
    VITTER, JS
    [J]. INFORMATION PROCESSING LETTERS, 1991, 39 (01) : 35 - 40
  • [6] Algorithms and Bounds for L-Drawings of Directed Graphs
    Angelini, Patrizio
    Da Lozzo, Giordano
    Di Bartolomeo, Marco
    Di Donato, Valentino
    Patrignani, Maurizio
    Roselli, Vincenzo
    Tollis, Ioannis G.
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (04) : 461 - 480
  • [7] Lower bounds for the number of inlets of hexagonal systems
    Cruz, Roberto
    Duque, Frank
    Rada, Juan
    [J]. INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 2020, 120 (19)
  • [8] DLP in semigroups: Algorithms and lower bounds
    Han, Jiao
    Zhuang, Jincheng
    [J]. JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2022, 16 (01) : 278 - 288
  • [9] Propositional lower bounds: Generalization and algorithms
    Cadoli, M
    Palopoli, L
    Scarcello, F
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 355 - 367
  • [10] Lower bounds on generic algorithms in groups
    Maurer, U
    Wolf, S
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 72 - 84
12345