Real theorem provers deserve real user-interfaces
SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
Stretching the rubber sheet: a metaphor for viewing large layouts on small screens
UIST '93 Proceedings of the 6th annual ACM symposium on User interface software and technology
A focus+context technique based on hyperbolic geometry for visualizing large hierarchies
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
Drawing Large Graphs with H3Viewer and Site Manager
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Interactive Information Visualization of a Million Items
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility
ACM SIGGRAPH 2003 Papers
Degree-of-interest trees: a component of an attention-reactive user interface
Proceedings of the Working Conference on Advanced Visual Interfaces
O-buffer: a framework for sample-based graphics
IEEE Transactions on Visualization and Computer Graphics
PRISAD: a partitioned rendering infrastructure for scalable accordion drawing (extended version)
Information Visualization
Composite Rectilinear Deformation for Stretch and Squish Navigation
IEEE Transactions on Visualization and Computer Graphics
An adaptive resolution tree visualization of large influenza virus sequence datasets
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Scale and complexity in visual analytics
Information Visualization
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
Hi-index | 0.00 |
The TreeJuxtaposer system [MGT*03] allowed visual comparison of large trees with guaranteed visibility of landmarks and Focus+Context navigation. While that system allowed exploration and comparison of larger datasets than previous work, it was limited to a single tree of 775,000 nodes by a large memory footprint. In this paper, we describe the theoretical limitations to TreeJuxtaposer's architecture that severely restrict its scalability. We provide two scalable, robust solutions to these limitations: TJC and TJC-Q. TJC is a system that supports browsing trees up to 15 million nodes by exploiting leading-edge graphics hardware while TJC-Q allows browsing trees up to 5 million nodes on commodity platforms. Both of these systems use a fast new algorithm for drawing and culling and benefit from a complete redesign of all data structures for more efficient memory usage and reduced preprocessing time.