Data Structures and Problem Solving Using Java
Data Structures and Problem Solving Using Java
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Simple and Efficient Bilayer Cross Counting
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Case Study: Visualizing Sets of Evolutionary Trees
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Dendrogram seriation using simulated annealing
Information Visualization
Extending the WilmaScope 3D graph visualisation system: software demonstration
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Visualization of Barrier Tree Sequences
IEEE Transactions on Visualization and Computer Graphics
Exploring Multiple Trees through DAG Representations
IEEE Transactions on Visualization and Computer Graphics
Drawing (Complete) Binary Tanglegrams
Graph Drawing
Generalized Binary Tanglegrams: Algorithms and Applications
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Untangling Tanglegrams: Comparing Trees by Their Drawings
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Comparing trees via crossing minimization
Journal of Computer and System Sciences
Untangling Tanglegrams: Comparing Trees by Their Drawings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A survey of multiple tree visualisation
Information Visualization
Comparing trees via crossing minimization
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.01 |
Two and a half dimensional graph visualisation is the stacking of a set of related graphs, each drawn in a plane, into the third dimension to support visual comparison. A new aesthetic criterion is introduced for the 2 1/2D visualisation of sets of related phylogenetic trees. This aesthetic requires that the number of crossings between edges linking similar nodes in adjacent trees is minimised allowing a user to easily track the position of a particular species through its lifetime in the stack. We introduce an algorithm for efficiently minimising such crossings and discuss its complexity. Finally, we suggest a new "barrel" layout style which benefits from such crossing minimisation.