• DocumentCode
    2672463
  • Title

    Fast volume rendering of compressed data

  • Author

    Ning, Paul ; Hesselink, Lambertus

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., CA, USA
  • fYear
    1993
  • fDate
    25-29 Oct 1993
  • Firstpage
    11
  • Lastpage
    18
  • 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 the data structure, volume shading calculations need only be performed on the codebook and image generation is accelerated by reusing precomputed block projections
  • Keywords
    data structures; data visualisation; rendering (computer graphics); algorithms; codebook; compressed data; data management; data structure; fast volume rendering; image generation; indices; large datasets; precomputed block projections; representative blocks; storage space; transmission time; Data analysis; Data compression; Data mining; Data visualization; Image storage; Isosurfaces; Ray tracing; Rendering (computer graphics); Speech analysis; Vector quantization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Visualization, 1993. Visualization '93, Proceedings., IEEE Conference on
  • Conference_Location
    San Jose, CA
  • Print_ISBN
    0-8186-3940-7
  • Type

    conf

  • DOI
    10.1109/VISUAL.1993.398845
  • Filename
    398845