No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs

被引：0
|
作者：
Rahman, MS [1 ]
Egi, N [1 ]
Nishizeki, T [1 ]
机构：
[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
来源：
GRAPH DRAWING | 2004年 / 2912卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, called subdividions of planar triconnected cubic graphs, and give a linear-time algorithm to examine whether such a planar graph G has a no-bend orthogonal drawing and to find one if G has.
引用
下载
收藏
页码：387 / 392
页数：6
相关论文
共 50 条
  • [1] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs
    Rahman, S
    Egi, N
    Nishizeki, T
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (01): : 23 - 30
  • [2] No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract)
    Hasan, Md Manzurul
    Rahman, Md Saidur
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 254 - 265
  • [3] A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
    Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, Sendai
    980-8579, Japan
    Journal of Graph Algorithms and Applications, 1999, 3 (04): : 31 - 62
  • [4] Bend-optimal orthogonal drawings of triconnected plane graphs
    Bhatia, Siddharth
    Lad, Kunal
    Kumar, Rajiv
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2018, 15 (02) : 168 - 173
  • [5] Linear-Time Rectilinear Drawings of Subdivisions of Triconnected Cubic Planar Graphs with Orthogonally Convex Faces
    Hasan, Md Manzurul
    Mondal, Debajyoti
    Rahman, Md Saidur
    THAI JOURNAL OF MATHEMATICS, 2023, 21 (04): : 807 - 820
  • [6] No-bend orthogonal drawings of series-parallel graphs - (Extended abstract)
    Rahman, MS
    Egi, N
    Nishizeki, T
    GRAPH DRAWING, 2006, 3843 : 409 - 420
  • [7] Symmetric drawings of triconnected planar graphs
    Hong, SH
    McKay, B
    Eades, P
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 356 - 365
  • [8] On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
    Da Lozzo, Giordano
    D'Angelo, Anthony
    Frati, Fabrizio
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 435 - 447
  • [9] Smooth Orthogonal Drawings of Planar Graphs
    Alam, Muhammad Jawaherul
    Bekos, Michael A.
    Kaufmann, Michael
    Kindermann, Philipp
    Kobourov, Stephen G.
    Wolff, Alexander
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 144 - 155
  • [10] Orthogonal drawings based on the stratification of planar graphs
    Bonichon, N
    Le Saëc, B
    Mosbah, M
    DISCRETE MATHEMATICS, 2004, 276 (1-3) : 43 - 57
12345