首页 | 本学科首页   官方微博 | 高级检索  
     


An optimal parallel algorithm for volume ray casting
Authors:Vineet Goel  Amar Mukherjee
Affiliation:(1) Department of Computer Science, University of Central Florida, 32816 Orlando, FL, USA
Abstract:Volume rendering by ray casting is computationally expensive. For interactive volume visualization, rendering must be done in real time (30 frames/s). Since the typical size of a 3D dataset is 2563, parallel processing is imperative. In this paper, we present anO(logn) EREW algorithm for volume rendering. We useO(n3) processors that can be optimized toO(log3n) time withO(n3/log3n) processors. We have implemented our algorithm on a MasPar MP-1. The implementation results show that a frame of size 2563 is generated in 11 s by 4096 processors. This time can be further reduced by the use of large number of processors.
Keywords:Volume visualization  Parallel computation  Volume rendering  Parallel architecture
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号