Clan-Based Incremental Drawing

Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 384-396(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_36).

Full text not available from this repository.

Abstract

The stability is an essential issue for incremental drawings. To allow stable updating, means to modify graph slightly (such as adding or deleting an edge or a node) without changing the layout dramatically from previous layout. In this paper, a method for achieving stable incremental directed graph layout by using clan-based graph decomposition is described. For a given directed graph, the clan-based decomposition generates a parse tree. The parse tree, which is used for layout, is also employed in locating changes and maintaining visual stability during incremental drawing. By using the generated parse tree, each incremental update can be done very efficiently.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_36
Classifications: M Methods > M.999 Others
M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.999 Others
M Methods > M.900 Tree
URI: http://gdea.informatik.uni-koeln.de/id/eprint/433

Actions (login required)

View Item View Item