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 conferencePaper

103 Citations (Scopus)

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.

Original languageEnglish (US)
Pages371-377
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

Other

OtherProceedings of the IEEE Visualization '99
CitySan Francisco, CA, USA
Period10/24/9910/29/99

Fingerprint

Volume rendering
Data structures
Image quality
Computational fluid dynamics
Data storage equipment

ASJC Scopus subject areas

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

Cite this

Shen, H. W., Chiang, L. J., & Ma, K-L. (1999). Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree. 371-377. Paper presented at Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, .

Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree. / Shen, Han Wei; Chiang, Ling Jen; Ma, Kwan-Liu.

1999. 371-377 Paper presented at Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, .

Research output: Contribution to conferencePaper

Shen, HW, Chiang, LJ & Ma, K-L 1999, 'Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree' Paper presented at Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, 10/24/99 - 10/29/99, pp. 371-377.
Shen HW, Chiang LJ, Ma K-L. Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree. 1999. Paper presented at Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, .
Shen, Han Wei ; Chiang, Ling Jen ; Ma, Kwan-Liu. / Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree. Paper presented at Proceedings of the IEEE Visualization '99, San Francisco, CA, USA, .7 p.
@conference{b34301851b7048b4bf37b9e0fe501c52,
title = "Fast volume rendering algorithm for time-varying fields using a Time-Space Partitioning (TSP) tree",
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.",
author = "Shen, {Han Wei} and Chiang, {Ling Jen} and Kwan-Liu Ma",
year = "1999",
month = "12",
day = "1",
language = "English (US)",
pages = "371--377",
note = "Proceedings of the IEEE Visualization '99 ; Conference date: 24-10-1999 Through 29-10-1999",

}

TY - CONF

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

AU - Shen, Han Wei

AU - Chiang, Ling Jen

AU - Ma, Kwan-Liu

PY - 1999/12/1

Y1 - 1999/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033342293&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033342293&partnerID=8YFLogxK

M3 - Paper

SP - 371

EP - 377

ER -