Constrained graph layout

被引：18

作者：

Weiqing H.E. ^{[1
]}

Marriott K. ^{[1
]}

机构：

[1] Department of Computer Science, Monash University, Clayton

来源：

Constraints | 1998年 / 3卷 / 4期

关键词：

Active set method; Constraints; Graph layout; InteractionGraphics;

D O I：

10.1023/A:1009771921595

中图分类号：

学科分类号：

摘要：

Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.

引用

页码：289 / 314

页数：25

共 48 条

[1]

Battisa, G.D., Eades, P., Tamassia, R., Tollis, I.G., Algorithms for drawing graphs: An annotated bibliography (1994) Computational Geometry: Theory and Applications, 4, pp. 235-282

[2]

Böhringer, K., Paulisch, F.N., Using constraints to achieve stability in automatic graph layout algorithms (1990) Proc. of Conference on Human Factors in Computing Systems, CHI'90, pp. 43-51

[3]

Borning, A., The programming language aspects of ThingLab, a constraint-oriented simulation laboratory (1981) ACM Transactions on Programming Languages and Systems, 3 (4), pp. 252-387

[4]

Box, M.J., Davies, D., Swann, W.H., (1969) Non-linear Optimization Techniques, , Oliver & Boyd

[5]

Brandenburg, F.J., Designing graph drawings by layout graph grammars (1994) Proceedings of DIMACS International Workshop. GD'94, LNCS, 894, pp. 416-427. , Princeton, New Jersey, USA. Springer-Verlag

[6]

Brandenburg, F.J., Himsolt, M., Rohrer, C., An experimental comparison of force-directed and randomized graph drawing algorithms (1995) Symposium on Graph Drawing, GD'95, LNCS, 1027, pp. 76-87. , Passau, Germany. Springer-Verlag

[7]

Cattermole, K.W., Graph theory and communications networks (1979) Applications of Graph Theory, pp. 17-57. , R. J. Wilson and L. W. Beineke, editors, Academic Press

[8]

Chok, S.S., Marriott, K., Automatic construction of user interfaces from constraint multiset grammars (1995) IEEE Symposium on Visual Languages, pp. 242-249

[9]

Kikusts, P., Ručevskis, P., Layout algorithm of graph-like diagrams for grade windows graphic editors (1995) Symposium on Graph Drawing, GD'95, LNCS, 1027, pp. 361-364. , Passau, Germany. Springer-Verlag

[10]

Cruz, I.F., Garg, A., Drawing graphs by example efficiently: Trees and planar acyclic digraphs (1994) Proceedings of DIMACS International Workshop, GD'94, Princeton, New Jersey, USA, October 1994, LNCS, 894, pp. 404-415. , Springer-Verlag

← 1 2 3 4 5 →