Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
A survey of algorithms for volume visualization
ACM SIGGRAPH Computer Graphics
50 GFlops molecular dynamics on the Connection Machine 5
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Fast data parallel polygon rendering
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Parallel Volume Rendering Using Binary-Swap Compositing
IEEE Computer Graphics and Applications
Massively parallel isosurface extraction
VIS '92 Proceedings of the 3rd conference on Visualization '92
| Hi-index | 0.00 |
As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of Massively Parallel Processors (MPPs) are becoming increasingly important. For large applications rendering on the MPP tends to be preferable to rendering on a graphics workstationdue to the MPP' s abundant resources: memory, disk, and numerous processors. The challenge becomes developing algorithms that can exploit these resources while minimizing overhead, typically communication costs. This paper will describe recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume render use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 and the Cray Research Inc T3D.