A simple linear time algorithm for proper box rectangular drawings of plane graphs

被引：10
|
作者：
He, X [1 ]
机构：
[1] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA
来源：
JOURNAL OF ALGORITHMS | 2001年 / 40卷 / 01期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jagm.2001.1161
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we introduce a new style of drawing a plane graph G, called proper box rectangular (PBR) drawing. It is defined to be: a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a Vertical line segment, and each face is drawn as a rectangle. We establish necessary and sufficient conditions for G to have a PER drawing. We also give a simple Linear time algorithm for finding such drawings. The PER drawing is closely related to the box rectangular (BR) drawing defined by M. S. Rahman, S. Nakano and T. Nishizeki (2000, J. Algorithms 37, 363-398). Our method can he adapted to provide a new algorithm for solving the BR drawing problem. (C) 2001 Academic Press.
引用
收藏
页码：82 / 101
页数：20
相关论文
共 50 条
  • [1] A simple linear time algorithm for proper box rectangular drawings of plane graphs
    He, X
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 234 - 245
  • [2] Box-rectangular drawings of plane graphs
    Rahman, MS
    Nakano, S
    Nishizeki, T
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 37 (02): : 363 - 398
  • [3] Inner rectangular drawings of plane graphs
    Miura, K
    Haga, H
    Nishizeki, T
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2006, 16 (2-3) : 249 - 270
  • [4] Rectangular grid drawings of plane graphs
    Rahman, MS
    Nakano, S
    Nishizeki, T
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (03): : 203 - 220
  • [5] A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    ALGORITHMICA, 2010, 58 (02) : 433 - 460
  • [6] A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
    Seok-Hee Hong
    Hiroshi Nagamochi
    Algorithmica, 2010, 58 : 433 - 460
  • [7] A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs
    Lin, Min Chih
    Soulignac, Fancisco J.
    Szwarcfiter, Jayme L.
    ALGORITHM THEORY - SWAT 2008, 2008, 5124 : 355 - +
  • [8] A linear time recognition algorithm for proper interval graphs
    Panda, BS
    Das, SK
    INFORMATION PROCESSING LETTERS, 2003, 87 (03) : 153 - 161
  • [9] Inner rectangular drawings of plane graphs (extended abstract)
    Miura, K
    Haga, H
    Nishizeki, T
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 693 - 704
  • [10] Rectangular drawings of plane graphs without designated corners
    Rahman, MS
    Nakano, S
    Nishizeki, T
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 85 - 94
12345