Cart (Loading....) | Create Account
Close category search window

An optimal parallel algorithm for volume ray casting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Goel, V. ; Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA ; Mukherjee, A.

Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (3D frames/sec). Since the typical 3D dataset size is at least 1283, the use of parallel processing is imperative. We present an O(log n) EREW algorithm for volume rendering using O(n3 ) processors which can be optimized to O(log3 n) time using O(n3/log3 n) processors. We have implemented our algorithm on MasPar MPl200. The implementation results show that a frame from 1233 data size is generated in about 3 seconds using 4096 processors

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.