• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

FAST VOLUME RENDERING USING A SHEAR-WARP FACTORIZATION OF THE VIEWING TRANSFORMATION (1995)

Cached

  • Download as a PDF

Download Links

  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www.cs.virginia.edu]
  • [www.cs.virginia.edu]
  • [www-graphics.stanford.edu]
  • [graphics.csie.ntu.edu.tw]
  • [graphics.csie.ntu.edu.tw]
  • [www.vis.uni-stuttgart.de]
  • [read.pudn.com]
  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [www-hci.stanford.edu]
  • [biocomp.stanford.edu]
  • [graphics.stanford.edu]
  • [www-graphics.stanford.edu]
  • [www.cg.inf.ethz.ch]
  • [graphics.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Philippe G. Lacroute
Citations:542 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lacroute95fastvolume,
    author = {Philippe G. Lacroute},
    title = { FAST VOLUME RENDERING USING A SHEAR-WARP FACTORIZATION OF THE VIEWING TRANSFORMATION},
    year = {1995}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used brute-force techniques that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a family of volume rendering algorithms that reduces rendering times to one second. First we present a scanline-order volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanline-order algorithms are fundamentally more efficient than commonly-used ray casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axis-aligned boxes). The new scanline-order algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective projections and

Keyphrases

fast volume rendering    shear-warp factorization    viewing transformation    volume rendering    early implementation    axis-aligned box    scanline-order volume    analytic geometry calculation    new scanline-order algorithm    perspective projection    medical imaging    typical data set    brute-force technique    scientific visualization    high computational expense    volume data    scanline-order algorithm    storage order    commonly-used ray casting algorithm    ten second    interactive visualization application   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University