A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree

  • Authors:

  • Han-Wei Shen;Ling-Jen Chiang;Kwan-Liu Ma

  • Affiliations:

  • Department of Computer and Information Science, The Ohio State University, 2015 Neil Ave. 395 Dreese Lab., Columbus, OH and MRJ Technology Solutions / NASA Ames Research Center University of Calif ...; NASA Ames Research Center, Mail Stop T27A-1, Moffett Field, CA and MRJ Technology Solutions / NASA Ames Research Center;Department of Computer Science, University of California, One Shields Avenue, Davis, CA and University of California, Davis

  • Venue:
  • VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a fast volume rendering algorithm for time-varying fields. We propose a new data structure, called Time-Space Partitioning (TSP) tree, that can effectively capture both the spatial and the temporal coherence from a time-varying field. Using the proposed data structure, the rendering speed is substantially improved. In addition, our data structure helps to maintain the memory access locality and to provide the sparse data traversal so that our algorithm becomes suitable for large-scale out-of-core applications. Finally, our algorithm allows flexible error control for both the temporal and the spatial coherence so that a trade-off between image quality and rendering speed is possible. We demonstrate the utility and speed of our algorithm with data from several time-varying CFD simulations. Our rendering algorithm can achieve substantial speedup while the storage space overhead for the TSP tree is kept at a minimum.