VISUALIZATION OF STRUCTURAL INFORMATION - AUTOMATIC DRAWING OF COMPOUND DIGRAPHS

被引:107
作者
SUGIYAMA, K
MISUE, K
机构
[1] International Institute, Social Information Science, Fujitsu Ltd., 140 Miyamoto, Numazu
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1991年 / 21卷 / 04期
关键词
D O I
10.1109/21.108304
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An automatic method for drawing compound digraphs that contain both inclusion edges and adjacency edges are presented. In the method vertices are drawn as rectangles (areas for texts, images etc.), inclusion edges by the geometric inclusion among the rectangles, and adjacency edges by arrows connecting them. Readability elements such as drawing conventions and rules are identified and a heuristic algorithm to generate "readable" diagrams is developed. Several applications are shown to demonstrate the effectiveness of the algorithm. The utilization of curves is investigated to improve the quality of diagrams. A possible set of command primitives for progressively organizing structures within our graph formalism is also discussed. The computational time for the applications shows that the algorithm achieves satisfactory performance.
引用
收藏
页码:876 / 892
页数:17
相关论文
共 26 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER
[2]  
EVEN S., 1979, GRAPH ALGORITHMS
[3]  
FINDLER NV, 1979, ASS NETWORKS REPRESE
[4]   DAG - A PROGRAM THAT DRAWS DIRECTED-GRAPHS [J].
GANSNER, ER ;
NORTH, SC ;
VO, KP .
SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (11) :1047-1062
[5]  
Harary Frank, 1972, GRAPH THEORY
[6]   ON VISUAL FORMALISMS [J].
HAREL, D .
COMMUNICATIONS OF THE ACM, 1988, 31 (05) :514-530
[7]  
HARTSHORNE C, 1978, COLLECTED PAPERS CS, V2
[8]  
JOHNSON TH, 1982, CLIN CHEST MED, V3, P89
[9]  
Kawakita J., 1986, KJ METHOD
[10]  
Kernighan B. W., 1978, C PROGRAMMING LANGUA, V1st