The three-phase method: A unified approach to orthogonal graph drawing

被引：10

作者：

Biedl, TC ^{[1
]}

Madden, BP

Tollis, IG

机构：

[1] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada

[2] Tom Sawyer Software, Albany, CA 94710 USA

[3] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA

来源：

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 2000年 / 10卷 / 06期

关键词：

graph visualization; orthogonal graph drawing; high-degree graphs; three-phase method; interactive drawing;

D O I：

10.1142/S0218195900000310

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.

引用

页码：553 / 580

页数：28

共 30 条

[1]

Battista G.D., 1998, Graph Drawing: Algorithms for the Visualization of Graphs

[2]

BHATT SN, 1984, ADV COMPUTING RES, V2, P95

[3] A better heuristic for orthogonal graph drawings [J].

Biedl, T ;

Kant, G .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 9 (03) :159-180

[4]

BIEDL T, 1988, IN PRESS COMPUTATION

[5]

BIEDL T, 1997, THESIS RUTCOR RUTGER

[6]

Biedl TC, 1998, LECT NOTES COMPUT SC, V1547, P30

[7]

BIEDL TC, 1997, LECT NOTES COMPUTER, V1284, P37

[8]

BOSE P, RECTANGLE VISIBILITY, P25

[9]

Fossmeier U, 1996, LECT NOTES COMPUT SC, V1027, P254, DOI 10.1007/BFb0021809

[10]

FOSSMEIER U, NORTH, P155

← 1 2 3 →