Interactive Information Visualization of a Million Items
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Graph Drawing Software
Manipulating Screen Space with {\em StretchTools}: Visualizing Large Structures on Small Screens
Manipulating Screen Space with {\'em StretchTools}: Visualizing Large Structures on Small Screens
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility
ACM SIGGRAPH 2003 Papers
DOITrees revisited: scalable, space-constrained visualization of hierarchical data
Proceedings of the working conference on Advanced visual interfaces
Toolkit Design for Interactive Structured Graphics
IEEE Transactions on Software Engineering
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
PRISAD: A Partitioned Rendering Infrastructure for Scalable Accordion Drawing
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Scalable, robust visualization of very large trees
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Melange: space folding for multi-focus interaction
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
LiveRAC: interactive visual exploration of system management time-series data
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A survey of multiple tree visualisation
Information Visualization
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with guaranteed visibility for marked areas of interest. Our new rendering algorithms are based on the partitioning of screen-space, which allows us to handle dense data set regions correctly. The algorithms in previous work led to incorrect visual representations because of overculling, and to inefficiencies due to overdrawing multiple items in the same region. Our pixel-based drawing infrastructure guarantees correctness by eliminating overculling, and improves rendering performance with tight bounds on overdrawing. PRITree and PRISeq are applications built on PRISAD, with the feature sets of TreeJuxtaposer and SequenceJuxtaposer, respectively. We describe our PRITree and PRISeq data set traversal algorithms, which are used for efficient rendering, culling, and layout of data sets within the PRISAD framework. We also discuss PRITree node marking techniques, which offer order-of-magnitude improvements to both memory and time performance vs previous range storage and retrieval techniques. Our PRITree implementation features a fivefold increase in rendering speed for non-trivial tree structures, and also reduces memory requirements in some real-world data sets by up to eight times, so we are able to handle trees of several million nodes. PRISeq renders 15 times faster and handles data sets 20 times larger than previous work. The software is available as open source from http://olduvai.sourceforge.net.