Volume Rendering on Multicomputers

نویسنده

  • Ulrich Neumann
چکیده

Taxonomy and Algorithms for Volume Rendering on Multicomputers

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rotate-Tiling Image Composition Method for Parallel Volume Rendering on Distributed Memory Multicomputers

The binary-swap and the parallel-pipelined methods are two popular image composition methods for volume rendering on distributed memory multicomputers. However, these methods either restrict the number of processors to a power of two or require many steps to transform image data that results in high communication overheads. In this paper, we present an efficient image composition method, the ro...

متن کامل

Comparison of Two Image-Space Subdivision Algorithms for Direct Volume Rendering on Distributed-Memory Multicomputers

Direct Volume Rendering (DVR) is a powerful technique for visualizing volumetric data sets. However, it involves intensive computations. In addition, most of the volumetric data sets consist of large number of 3D sampling points. Therefore, visualization of such data sets also requires large computer memory space. Hence, DVR is a good candidate for parallelization on distributed-memory multicom...

متن کامل

A Rotate-Tiling Image Compositing Method for Sort-Last Parallel Volume Rendering Systems on Distributed Memory Multicomputers

The binary-swap (BS) and the parallel-pipelined (PP) methods are two well-known image compositing methods for sort-last parallel volume rendering systems. However, these two methods either restrict the number of processors to a power-of-two or require many communication steps to transform image data that results in high data communication overheads. In this paper, we present an efficient image ...

متن کامل

CellFlow: A Parallel Rendering Scheme for Distributed Memory Architectures

CellFlow is an animation system that exploits frame coherency to implement a lookahead scheme of object dataflow. The implementation of this scheme uses the communication features of modern scalable multicomputers to achieve good speedup by means of latency hiding. We demonstrate the performance of our approach in the field of volume rendering by implementing incremental rotation of the volumet...

متن کامل

A Comparison of Spatial Subdivision Algorithms for Sort-First Rendering

This paper describes and experimentally evaluates three adap-tive spatial subdivision heuristics for sort-rst parallel graphics rendering on distributed-memory multicomputers. In sort-rst rendering, image-space, or screen, is divided into regions. Each processor is assigned one or multiple regions to render. Primitives in the scene are redistributed among the processors according to region assi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010