Navigation

You are here: Home / Members / Bernhard Kainz / Efficient Ray Casting of Volumetric Datasets With Polyhedral Boundaries on Manycore GPUs

Efficient Ray Casting of Volumetric Datasets With Polyhedral Boundaries on Manycore GPUs

Authors Kainz Bernhard, Grabner Markus, Bornik Alexander, Hauswiesner Stefan, Mühl Judith, Schmalstieg Dieter
Appeared in

ACM Trans. Graph.

Volume 28
Number 5
Pages

TOG Article 152

Date December 2009
Abstract We present a new algorithm for hardware-accelerated ray casting of multiple volumes. Our approach supports a large number of volumes, complex translucent and concave polyhedral objects as well as CSG intersections of volumes and geometry in any combination. It is implemented as a software renderer in CUDA without any fixed function portions, which allows full control over the use of memory bandwidth. High depth complexity, which is problematic for conventional approaches based on depth peeling, can be successfully handled. As far as we know, our approach is the first framework for multi-volume rendering which provides interactive frame rates when concurrently rendering more than 50 arbitrarily overlapping volumes on current graphics hardware.
Link

PDF Video BibTeX

[Powered by Plone]