3-dimensional pliable surfaces: for the effective presentation of visual information
Proceedings of the 8th annual ACM symposium on User interface and software technology
A model for the visualization exploration process
Proceedings of the conference on Visualization '02
Nonlinear Magnification Fields
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
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
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
Transmogrification: causal manipulation of visualizations
Proceedings of the 26th annual ACM symposium on User interface software and technology
Hi-index | 0.00 |
We present the first scalable algorithm that supports the composition of successive rectilinear deformations.Earlier systems that provided stretch and squish navigation could only handle small datasets.More recent work featuring rubber sheet navigation for large datasets has focused on rendering and on application-specific issues. However, no algorithm has yet been presented for carrying out such navigation methods; our paper addresses this problem. For maximum flexibility with large datasets, a stretch and squish navigation algorithm should allow for millions of potentially deformable regions. However, typical usage only changes the extents of a small subset k of these n regions at a time. The challenge is to avoid computations that are linear in n, because a single deformation can affect the absolute screen-space location of every deformable region. We provide an O(k log n) algorithm that supports any application that can lay out a dataset on a generic grid, and show an implementation that allows navigation of trees and gene sequences with millions of items in sub-millisecond time.