Theory of 2-structures. Part I: clans, basic subclasses, and morphisms
Theoretical Computer Science
Theory of 2-structures. Part II: representation through labeled tree families
Theoretical Computer Science
Clans and regions in 2-structures
Theoretical Computer Science
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Directed Graphs by Clan-Based Decomposition
GD '95 Proceedings of the Symposium on Graph Drawing
GD '95 Proceedings of the Symposium on Graph Drawing
CG: a Graph Drawing System Using Graph-Grammar Parsing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Graph Parsing Algorithm and Implementation
A Graph Parsing Algorithm and Implementation
Stability and topology in graph drawing
Stability and topology in graph drawing
Using graph parsing for automatic graph drawing
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Visual navigation of compound graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
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.