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 条
  • [31] Matched drawings of planar graphs
    Di Giacomo, Emilio
    Didimo, Walter
    van Kreveld, Marc
    Liotta, Giuseppe
    Speckmann, Bettina
    Journal of Graph Algorithms and Applications, 2009, 13 (03) : 423 - 445
  • [32] Planar drawings of plane graphs
    Nakano, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (03) : 384 - 391
  • [33] Monotone drawings of planar graphs
    Pach, J
    Tóth, G
    JOURNAL OF GRAPH THEORY, 2004, 46 (01) : 39 - 47
  • [34] Monotone drawings of planar graphs
    Pach, J
    Tóth, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 647 - 653
  • [35] Matched drawings of planar graphs
    Di Giacomo, Emilio
    Didimo, Walter
    Van Kreveld, Marc
    Liotta, Giuseppe
    Speckmann, Bettina
    GRAPH DRAWING, 2008, 4875 : 183 - +
  • [36] Pointed drawings of planar graphs
    Aichholzer, Oswin
    Rote, Guenter
    Schulz, Andre
    Vogtenhuber, Birgit
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2012, 45 (09): : 482 - 494
  • [37] Anchored Drawings of Planar Graphs
    Angelini, Patrizio
    Da Lozzo, Giordano
    Di Bartolomeo, Marco
    Di Battista, Giuseppe
    Hong, Seok-Hee
    Patrignani, Maurizio
    Roselli, Vincenzo
    GRAPH DRAWING (GD 2014), 2014, 8871 : 404 - 415
  • [38] Universal sets of n points for 1-bend drawings of planar graphs with n vertices
    Everett, Hazel
    Lazard, Sylvain
    Liotta, Giuseppe
    Wismath, Stephen
    GRAPH DRAWING, 2008, 4875 : 345 - +
  • [39] Convex drawings of hierarchical planar graphs and clustered planar graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (03) : 282 - 295
  • [40] Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
    Hazel Everett
    Sylvain Lazard
    Giuseppe Liotta
    Stephen Wismath
    Discrete & Computational Geometry, 2010, 43 : 272 - 288
12345