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
基金
美国国家科学基金会;
关键词
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 条
  • [21] A linear algorithm for compact box-drawings of trees
    Hasan, M
    Rahman, MS
    Nishizeki, T
    NETWORKS, 2003, 42 (03) : 160 - 164
  • [22] Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
    Walter Didimo
    Michael Kaufmann
    Giuseppe Liotta
    Giacomo Ortali
    Algorithmica, 2023, 85 : 2605 - 2666
  • [23] A linear-time algorithm for the longest path problem in rectangular grid graphs
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    Asgharian-Sardroud, Asghar
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (03) : 210 - 217
  • [24] An algorithm for constructing star-shaped drawings of plane graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (02): : 191 - 206
  • [25] A simple algorithm for secure domination in proper interval graphs
    Zou, Y. H.
    Liu, J. J.
    Hsu, C. C.
    Wang, Y. L.
    DISCRETE APPLIED MATHEMATICS, 2019, 260 : 289 - 293
  • [26] A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (03): : 591 - 625
  • [27] A SIMPLE LINEAR TIME ALGORITHM FOR TRIANGULATING 3-COLORED GRAPHS
    BODLAENDER, H
    KLOKS, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 415 - 423
  • [28] A simple linear time algorithm to solve the MIST problem on interval graphs
    Li, Peng
    Shang, Jianhui
    Shi, Yi
    THEORETICAL COMPUTER SCIENCE, 2022, 930 : 77 - 85
  • [29] Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs
    Aichholzer, Oswin
    Garcia, Alfredo
    Tejel, Javier
    Vogtenhuber, Birgit
    Weinberger, Alexandra
    DISCRETE & COMPUTATIONAL GEOMETRY, 2024, 71 (01) : 40 - 66
  • [30] Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs
    Oswin Aichholzer
    Alfredo García
    Javier Tejel
    Birgit Vogtenhuber
    Alexandra Weinberger
    Discrete & Computational Geometry, 2024, 71 (1) : 40 - 66