A Study of Transfer Function Generation for Time-Varying Volume Data
The proper usage and creation of transfer functions for time-varying data sets is an often ignored problem in volume visualization. Although methods and guidelines exist for time-invariant data, little formal study for the time-varying case has been performed. This paper examines this problem, and reports the study that we have conducted to determine how the dynamic behavior of time-varying data may be captured by a single or small set of transfer functions. The criteria which dictate when more than one transfer function is needed were also investigated. Four data sets with different temporal characteristics were used for our study. Results obtained using two different classes of methods are discussed, along with lessons learned. These methods, including a new multi-resolution opacity map approach, can be used for semi-automatic generation of transfer functions to explore large-scale time-varying data sets.
KeywordsTransfer Function Volume Rendering Volume Visualization Argon Bubble IEEE Visualization
Unable to display preview. Download preview PDF.
- 2.Chandrajit L. Bajaj, Valerio Pascucci, and Daniel R. Schikore. The contour spectrum. In Proceedings of IEEE Visualization 1997, pages 167–173. IEEE, 1997.Google Scholar
- 3.Lawrence D. Bergman, Bernice E. Rogowitz, and Lloyd A. Treinish. A rule-based tool for assiting colormap selection. In Proceedings of IEEE Visualization 1995, pages 118–125. IEEE, 1996.Google Scholar
- 5.Issei Fujishiro, Taeko Azuma, and Yuriko Takeshima. Automating transfer function design for comprehensible volume rendering based on 3d field topology analysis. In Proceedings of IEEE Visualization 1999, pages 467–470. IEEE, 1999.Google Scholar
- 6.Taosong He, Lichan Hon, Aire Kaufman, and Hanspeter Pfister. Generation of transiter functions with stocastic search techniques. In Proceedings of IEEE Visualization 1996, pages 227–234. IEEE, 1996.Google Scholar
- 8.Eric LaMar, Bernd Hamann, and Kenneth I. Joy. Multiresolution techniques for interactive texture-based volume visualization. In Proceedings of IEEE Visualization 1999, pages 355–362. IEEE, 1999.Google Scholar
- 9.David Laur and Pat Hanrahan. Hierarchical splatting: A progressive refinement algorithm for volume rendering. In Proceedings of SIGGRAPH91, pages 285–287, 1991.Google Scholar
- 10.Eric B. Lum, Kwan-Liu Ma, and John Clyne. Texture hardware assisted rendering of time-varying volume data. In Proceedings of IEEE Visualization 2001. IEEE, 2001.Google Scholar
- 11.Kwan-Liu Ma and Han-Wei Shen. Compression and accelerated rendering of time-varying volume data. In Proceedings of the 2000 International Computer Symposium–Workshop on Computer Graphics and Virtual Reality, pages 82–89, December 2000.Google Scholar
- 12.J. Marks, B. Andalman, P. A. Beardsley, W. Freeman, S. Gibson, J. Hodgins, T. Kang, B. Mirtich, H. Pfister, W. Ruml, K. Ryall, J. Seims, and S. Shieber. Design galleries: A general approach to setting parameters for computer graphics and animation. In Proceedings of SIGGRAPH97, pages 389–400. ACM SIGGRAPH, August 1997.Google Scholar
- 13.Hanspeter Pfister, Jan Hardenbergh, Jim Knittel, Hugh Lauer, and Larry Seiler. The Volume-Pro real-time ray-casting system. In Proceedings of SIGGRAPH99, pages 251–260, 1999.Google Scholar
- 15.Han-Wei Shen, Ling-Jen Chaing, and Kwan-Liu Ma. A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree. In Proceedings of IEEE Visualization 1999, pages 371–377. IEEE, 1999.Google Scholar