Scalable Data Servers for Large Multivariate Volume Visualization
|
Volumetric datasets with multiple variables on each voxel over multiple time steps are often complex, especially when considering the exponentially large attribute space formed by the variables in combination with the spatial and temporal dimensions. It is intuitive, practical, and thus often desirable, to interactively select a subset of the data from within that high-dimensional value space for efficient visualization. This approach is straightforward to implement if the dataset is small enough to be stored entirely in-core. However, to handle datasets sized at hundreds of gigabytes and beyond, this simplistic approach becomes infeasible and thus, more sophisticated solutions are needed. In this work, we developed a system that supports efficient visualization of an arbitrary subset, selected by range-queries, of a large multivariate time-varying dataset. By employing specialized data structures and schemes of data distribution, our system can leverage a large number of networked computers as parallel data servers, and guarantees a near optimal load-balance. We demonstrate our system of scalable data servers using two large time-varying simulation datasets.
[1] 1291 C. Bajaj, V. Pascucci, and D. Schikore, Fast isocontouring for improved interactivity. In Symposium on Volume Visualization '96, pages 39–46, 1996.
[2] B. Cabral, N. Cam, and J. Foran, Accelerated volume rendering and tomographic reconstruction using texture mapping hardware. In IEEE/ACM Symposium on Volume Visualization'94, pages 91–98, 1994.
[3] P. Cignoni, P. Marino, C. Montani, E. Puppo, and R. Scopigno, Speeding up isosurface extraction using interval trees. IEEE Transactions on Visualization and Computer Graphics, 3 (2): 158–170, 1997.
[4] J. Gao, J. Huang, C. R. Johnson, S. Atchley, and J. A. Kohl, Distributed Data Management for Large Volume Visualization. In Proceedings of IEEE Visualization '05, pages 183–189, 2005.
[5] C. Gotsman and M. Lindenbaum, The metric properties of discrete spacefilling curves. IEEE Transactions on Image Processing, 5 (5): 794–797, 1996.
[6] J. Huang, K. Mueller, N. Shareef, and R. Crawfis, Fastsplats: Optimized splatting on rectilinear grids. In IEEE Visualization'00, pages 219–227, 2000.
[7] T. Itoh and K. Koyamada, Automatic isosurface propagation using an extrema graph and sorted boundary cell lists. IEEE Transactions on Visualization and Computer Graphics, 1: 319–327, 1995.
[8] J. Kniss, G. Kindlmann, and C. Hansen, Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets. In IEEE Visualization'01, pages 255–262, 2001.
[9] J. Kniss, P. McCormick, A. McPherson, J. Ahrens, J. Painter, A. Keahey, and C. Hansen, Interactive texture-based volume rendering for large data sets. IEEE Computer Graphics and Applications, 21 (4): 52–61, 2001.
[10] J. Kniss, S. Premoze, M. Ikits, A. Lefohn, C. Hansen, and E. Praun, Gaussian transfer functions for multi-field volume visualization. In IEEE Visualization'03, pages 65–73, 2003.
[11] P. Lacroute and M. Levoy, Fast volume rendering using a shear-warp factorization of the viewing transformation. In Proc. SIGGRAPH94, pages 451–458, 1994.
[12] M. Levoy, Display of surfaces from volume data. IEEE Computer Graphics and Applications, 8 (5): 29–37, 1988.
[13] Y. Livnat, H.-W. Shen, and C. Johnson, A near optimal isosurface extraction algorithm using the span space. IEEE Transactions on Visualization and Computer Graphics, 2 (1): 73–84, 1996.
[14] M. Meissner, J. Huang, D. Bartz, K. Mueller, and R. Crawfis, A practical evaluation of the four most popular volume rendering algorithms. In IEEE/ACM Symposium on Volume Visualization'00, pages 81–90, 2000.
[15] K. Mueller, N. Shareef, J. Huang, and R. Crawfis, High-quality splatting on rectilinear grids with efficient culling of occluded voxels. IEEE Transactions on Visualization and Computer Graphics, 5 (2): 116–135, 1999.
[16] V. Pascucci and R. Frank, Global static indexing for real-time exploration of very large regular grids. In ACM/IEEE Conference on Supercomputing (SC'01), pages 2–2, 2001.
[17] H. Samet, The design and analysis of spatial data structures. New York, Addison Wesley, 1990.
[18] H.-W. Shen, L.-J. Chiang, and K.-L. Ma, A fast volume rendering algorithm for time-varying fields using a time-space partitioning (tsp) tree. In IEEE Visualization'99, pages 371–377, 1999.
[19] H.-W. Shen, C. Hansen, Y. Livnat, and C. Johnson, Isosurfacing in span space with utmost efficiency (ISSUE). In IEEE Visualization '96, pages 287–294, 1996.
[20] K. Stockinger, J. Shalf, K. Wu, and W. Bethel, Query-driven visualization of large data sets. In IEEE Visualization'05, page 22, 2005.
[21] P. Sutton and C. Hansen, Accelerated isosurface extraction in time-varying fields. IEEE Transactions on Visualization and Computer Graphics, 6: 98–107, 2000.
[22] U. Tiede, T. Schiemann, and K. H. Hoehne, High quality rendering of attributed volume data. In IEEE Visualization'98, pages 255–262, 1998.
[23] M. K. Tory, S. Potts, and M. T., A parallel coordinates style interface for exploratory volume visualization. IEEE Trans. on Visualization and Computer Graphics, 11: 71–80, 2005.
[24] M. Weiss In Data Structures and Algorithm Analysis in C++, 2 edition, ISBN 0-201-36122-1, Addison-Wesley. Addison-Wesley, 1998.
[25] H. Yu, K.-L. Ma, and J. Welling, A parallel visualization pipeline for terascale earthquake simulations. In ACM/IEEE Conference on Supercomputing (SC'04), page 49, 2004.
Index Terms:
Parallel and distributed volume visualization, large data set visualization, multi-variate visualization, volume visualization.
Citation:
Markus Glatter, Jian Huang, Jinzhu Gao, Colin Mollenhour, "Scalable Data Servers for Large Multivariate Volume Visualization," IEEE Transactions on Visualization and Computer Graphics, vol. 12, no. 5, pp. 1291-1298, Sept. 2006, doi:10.1109/TVCG.2006.175
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb