CONSTRAINED VISIBILITY REPRESENTATIONS OF GRAPHS

被引：18
作者：
DIBATTISTA, G
TAMASSIA, R
TOLLIS, IG
机构：
[1] BROWN UNIV,DEPT COMP SCI,PROVIDENCE,RI 02912
[2] UNIV TEXAS,DEPT COMP SCI,RICHARDSON,TX 75083
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 41卷 / 01期
关键词：
COMPUTATIONAL GEOMETRY; AUTOMATIC GRAPH DRAWING; PLANARITY; CRITICAL PATHS; DISJOINT PATHS; VISIBILITY REPRESENTATIONS; PERT DIAGRAMS;
D O I：
10.1016/0020-0190(92)90072-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We describe techniques for constructing constrained visibility representations of planar graphs and show how to use them to obtain graph drawings such that the edges of given paths are vertically aligned.
引用
收藏
页码：1 / 7
页数：7
相关论文
共 10 条
  • [1] di Battista G., 1989, Proceedings of the Fifth Annual Symposium on Computational Geometry, P51, DOI 10.1145/73833.73839
  • [2] ALGORITHMS FOR PLANE REPRESENTATIONS OF ACYCLIC DIGRAPHS
    DIBATTISTA, G
    TAMASSIA, R
    [J]. THEORETICAL COMPUTER SCIENCE, 1988, 61 (2-3) : 175 - 198
  • [3] RECTILINEAR PLANAR LAYOUTS AND BIPOLAR ORIENTATIONS OF PLANAR GRAPHS
    ROSENSTIEHL, P
    TARJAN, RE
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (04) : 343 - 353
  • [4] AUTOMATIC GRAPH DRAWING AND READABILITY OF DIAGRAMS
    TAMASSIA, R
    DIBATTISTA, G
    BATINI, C
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1988, 18 (01): : 61 - 79
  • [5] A UNIFIED APPROACH TO VISIBILITY REPRESENTATIONS OF PLANAR GRAPHS
    TAMASSIA, R
    TOLLIS, IG
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (04) : 321 - 341
  • [6] PLANAR GRID EMBEDDING IN LINEAR TIME
    TAMASSIA, R
    TOLLIS, IG
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (09): : 1230 - 1234
  • [7] TAMASSIA R, 1991, SIAM J DISCRETE MATH, V4, P1239
  • [8] [No title captured]
  • [9] [No title captured]
  • [10] [No title captured]
1