An experiment in graphical perception
International Journal of Man-Machine Studies
The visual display of quantitative information
The visual display of quantitative information
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
InterRing: a visual interface for navigating and manipulating hierarchies
Information Visualization
IV '07 Proceedings of the 11th International Conference Information Visualization
IEEE Transactions on Software Engineering
Quantifying the space-efficiency of 2D graphical representations of trees
Information Visualization
Indented pixel tree browser for exploring huge hierarchies
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
The aesthetics of rapidly-exploring random trees
Proceedings of the Symposium on Computational Aesthetics
| Hi-index | 0.00 |
We introduce Indented Pixel Tree Plots (IPTPs): a novel pixel-based visualization technique for depicting large hierarchies. It is inspired by the visual metaphor of indented outlines, omnipresent in graphical file browsers and pretty printing of source code. Inner vertices are represented as vertically arranged lines and leaf groups as horizontally arranged lines. A recursive layout algorithm places parent nodes to the left side of their underlying tree structure and leaves of each subtree grouped to the rightmost position. Edges are represented only implicitly by the vertically and horizontally aligned structure of the plot, leading to a sparse and redundant-free visual representation. We conducted a user study with 30 subjects in that we compared IPTPs and node-link diagrams as a within-subjects variable. The study indicates that working with IPTPs can be learned in less than 10 minutes. Moreover, IPTPs are as effective as node-link diagrams for accuracy and completion time for three typical tasks; participants generally preferred IPTPs. We demonstrate the usefulness of IPTPs by understanding hierarchical features of huge trees such as the NCBI taxonomy with more than 300,000 nodes.