LAYOUT ADJUSTMENT AND THE MENTAL MAP

被引:292
作者
MISUE, K
EADES, P
LAI, W
SUGIYAMA, K
机构
[1] UNIV NEWCASTLE, DEPT COMP SCI, CALLAGHAN, NSW 2308, AUSTRALIA
[2] EDITH COWAN UNIV, DEPT COMP SCI, MT LAWLEY, WA 6050, AUSTRALIA
关键词
D O I
10.1006/jvlc.1995.1010
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many models in software and information engineering use graph representations; examples are data flow diagrams, state transition diagrams, flow charts, PERT charts, organization charts, Petri nets and entity-relationship diagrams. The usefulness of these graph representations depends on the quality of the layout of the graphs. Automatic graph layout, which can release humans from graph drawing, is now available in several visualization systems. Most automatic layout facilities take a purely combinatorial description of a graph and produce a layout of the graph; these methods are called 'layout creation' methods. For interactive systems, another kind of layout is needed: a facility which can adjust a layout after a change is made by the user or by the application. Although layout adjustment is essential in interactive systems, most existing layout algorithms are designed for layout creation. The use of a layout creation method for layout adjustment may totally rearrange the layout and thus destroy the user's 'mental map' of the diagram; thus a set of layout adjustment methods, separate from layout creation methods, is needed. This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram. First, several models are proposed to make the concept of 'mental map' more precise. Then two kinds of layout adjustments are described. One is an algorithm for rearranging a diagram to avoid overlapping nodes, and the other is a method aimed at changing the focus of interest of the user without destroying the mental map. Next, some experience with visualization systems in which the techniques have been employed is also described.
引用
收藏
页码:183 / 210
页数:28
相关论文
共 24 条
[1]  
DAVIDSON R, 1989, DRAWING GRAPHS NICEL
[2]  
DIBATTISTA G, 1993, ALGORITHMS AUTOMATIC
[3]  
DIBATTISTA G, 1990, IEEE P WORKSHOP VISU, P60
[4]  
Eades P., 1994, Proceedings of the 4th International Conference on Computer - Aided Drafting, Design and Manufacturing Technology, P64
[5]  
Eades P., 1984, C NUMERANTIUM, V42, P149, DOI DOI 10.1007/3-540-63938-1_
[6]  
FRUCHTERMAN T, 1990, UIUCDCSR901609 U ILL
[7]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[8]  
FURNAS GW, 1986, APR CHI 86 C P BOST, P16
[9]  
HIMSOLT M, 1989, LECT NOTES COMPUT SC, V349, P532
[10]  
LAI W, 1993, THESIS U NEWCASTLE