A multi-scale algorithm for drawing graphs nicely

被引：52

作者：

Hadany, R ^{[1
]}

Harel, D ^{[1
]}

机构：

[1] Weizmann Inst Sci, Dept Comp Sci & Appl Math, IL-76100 Rehovot, Israel

来源：

DISCRETE APPLIED MATHEMATICS | 2001年 / 113卷 / 01期

关键词：

D O I：

10.1016/S0166-218X(00)00389-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe a multi-scale approach to the problem of drawing undirected graphs "nicely", with the straight-line edge convention. In contrast to conventional global-dynamic algorithms, we employ increasingly coarser-scale representations of the graph, together with a simple local organization scheme, without imposing formal criteria on the quality of the picture at large. Our algorithm can deal quite easily with very large graphs; some of our examples contain over 1000 vertices, (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：3 / 21

页数：19

共 12 条

[1]

Brandt A., 1992, Nuclear Physics B, Proceedings Supplements, V26B, P137, DOI 10.1016/0920-5632(92)90234-J

[2] MULTILEVEL COMPUTATIONS OF INTEGRAL-TRANSFORMS AND PARTICLE INTERACTIONS WITH OSCILLATORY KERNELS [J].

BRANDT, A .

COMPUTER PHYSICS COMMUNICATIONS, 1991, 65 (1-3) :24-38

[3] Drawing graphs nicely using simulated annealing [J].

Davidson, R ;

Harel, D .

ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (04) :301-331

[4]

Di Battista G., 1999, Graph Drawing: Algorithms for the Visualization of Graphs

[5]

Eades Peter, 1984, Congressus Numerantium, V42, P149, DOI DOI 10.1007/3-540-63938-1_

[6] GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].

FRUCHTERMAN, TMJ ;

REINGOLD, EM .

SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164

[7] RANDOMIZED GRAPH DRAWING WITH HEAVY-DUTY PREPROCESSING [J].

HAREL, D ;

SARDAS, M .

JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 1995, 6 (03) :233-253

[8]

HAREL D, 2000, IN PRESS P GRAPH DRA

[9] AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS [J].

KAMADA, T ;

KAWAI, S .

INFORMATION PROCESSING LETTERS, 1989, 31 (01) :7-15

[10]

MUSSEY WS, 1997, BASIC COURSE ALGEBRA, V127

← 1 2 →