Fast volume rendering of compressed data

  • Authors:
  • Paul Ning;Lambertus Hesselink

  • Affiliations:
  • Stanford University, Stanford, CA;Stanford University, Stanford, CA

  • Venue:
  • VIS '93 Proceedings of the 4th conference on Visualization '93
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Volume rendering has been proposed as a useful tool for extracting information from large datasets, where non-visual analysis alone may not be feasible. The scale of these applications implies that data management is an important issue that needs to be addressed. Most volume rendering algorithms, however, process data in raw, uncompressed form. In previous work, we introduced a compressed volume format that may be volume rendered directly with minimal impact on rendering time. In this paper, we extend these ideas to a new volume format that not only reduces storage space and transmission time, but is designed for fast volume rendering as well. The volume dataset is represented as indices into a small codebook of representative blocks. With this data structure, volume shading calculations need only be performed on the codebook and image generation is accelerated by reusing precomputed block projections.