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 条
  • [41] Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
    Everett, Hazel
    Lazard, Sylvain
    Liotta, Giuseppe
    Wismath, Stephen
    DISCRETE & COMPUTATIONAL GEOMETRY, 2010, 43 (02) : 272 - 288
  • [42] Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
    Didimo, Walter
    Kaufmann, Michael
    Liotta, Giuseppe
    Ortali, Giacomo
    ALGORITHMICA, 2023, 85 (09) : 2605 - 2666
  • [43] OPTIMAL MORPHS OF PLANAR ORTHOGONAL DRAWINGS
    van Goethem, Arthur
    Speckmann, Bettina
    Verbeek, Kevin
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2022, 13 (01) : 263 - 297
  • [44] A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    ALGORITHMICA, 2010, 58 (02) : 433 - 460
  • [45] Morphing Orthogonal Planar Graph Drawings
    Lubiw, Anna
    Petrick, Mark
    Spriggs, Michael
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 222 - 230
  • [46] Morphing Orthogonal Planar Graph Drawings
    Biedl, Therese
    Lubiw, Anna
    Petrick, Mark
    Spriggs, Michael
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (04)
  • [47] Bend-Minimum Orthogonal Drawings in Quadratic Time
    Didimo, Walter
    Liotta, Giuseppe
    Patrignani, Maurizio
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018, 2018, 11282 : 481 - 494
  • [48] A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
    Seok-Hee Hong
    Hiroshi Nagamochi
    Algorithmica, 2010, 58 : 433 - 460
  • [49] Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids
    Zhou, Xiao
    Nishizeki, Takao
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 760 - 770
  • [50] Strictly convex drawings of planar graphs
    Barany, Imre
    Rote, Guenter
    DOCUMENTA MATHEMATICA, 2006, 11 : 369 - 391
12345