Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree

Han Wei Shen, Ling Jen Chiang, Kwan-Liu Ma

Research output: Contribution to conferencePaperpeer-review

115 Scopus citations


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.

Original languageEnglish (US)
Number of pages7
StatePublished - Dec 1 1999
Externally publishedYes
EventProceedings of the IEEE Visualization '99 - San Francisco, CA, USA
Duration: Oct 24 1999Oct 29 1999


OtherProceedings of the IEEE Visualization '99
CitySan Francisco, CA, USA

ASJC Scopus subject areas

  • Software
  • Computer Science(all)
  • Engineering(all)
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree'. Together they form a unique fingerprint.

Cite this