Constrained Graph Layout

He, Weiqing and Marriott, Kim (1997) Constrained Graph Layout. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 217-232(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_50).

Full text not available from this repository.

Abstract

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 layed out. We describe three implementaions of layout modules which are based on the constrained graph layout model. The first two implementations are for undirected graph layout and the third 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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_50
Classifications: M Methods > M.300 Dynamic / Incremental / Online
M Methods > M.200 Animation
URI: http://gdea.informatik.uni-koeln.de/id/eprint/130

Actions (login required)

View Item View Item