A cognitive approach for graph drawing
Cybernetics and Systems
An algorithm for drawing general undirected graphs
Information Processing Letters
Journal of Information Processing
Graph drawing by force-directed placement
Software—Practice & Experience
Evolutionary learning of graph layout constraints from examples
UIST '94 Proceedings of the 7th annual ACM symposium on User interface software and technology
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Graph Layout Using a Genetic Algorithm
SBRN '00 Proceedings of the VI Brazilian Symposium on Neural Networks (SBRN'00)
Combining Hierarchy and Energy Drawing Directed Graphs
IEEE Transactions on Visualization and Computer Graphics
Flexible layering in hierarchical drawings with nodes of arbitrary size
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Artificial Intelligence in Medicine
Artificial Intelligence in Medicine
Hi-index | 0.00 |
Objective: Many complex pathways are described as hierarchical structures in which a pathway is recursively partitioned into several sub-pathways, and organized hierarchically as a tree. The hierarchical structure provides a natural way to visualize the global structure of a complex pathway. However, none of the previous research on pathway visualization explores the hierarchical structures provided by many complex pathways. In this paper, we aim to develop algorithms that can take advantages of hierarchical structures, and give layouts that explore the global structures as well as local structures of pathways. Methods: We present a new hierarchically organized layout algorithm to produce layouts for hierarchically organized pathways. Our algorithm first decomposes a complex pathway into sub-pathway groups along the hierarchical organization, and then partition each sub-pathway group into basic components. It then applies conventional layout algorithms, such as hierarchical layout and force-directed layout, to compute the layout of each basic component. Finally, component layouts are joined to form a final layout of the pathway. Our main contribution is the development of algorithms for decomposing pathways and joining layouts. Results: Experiment shows that our algorithm is able to give comprehensible visualization for pathways with hierarchies, cycles as well as complex structures. It clearly renders the global component structures as well as the local structure in each component. In addition, it runs very fast, and gives better visualization for many examples from previous related research.