Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Footprint evaluation for volume rendering
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Segmented ray casting for data parallel volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Integrating volume data analysis and rendering on distributed memory architectures
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Parallel volume-rendering algorithm performance on mesh-connected multicomputers
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Fast volume rendering using a shear-warp factorization of the viewing transformation
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
PRS '97 Proceedings of the IEEE symposium on Parallel rendering
ICS '98 Proceedings of the 12th international conference on Supercomputing
Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers
IEEE Transactions on Visualization and Computer Graphics
PVR: High-Performance Volume Rendering
IEEE Computational Science & Engineering
Parallel Volume Rendering Using Binary-Swap Compositing
IEEE Computer Graphics and Applications
Scalable Rendering on PC Clusters
IEEE Computer Graphics and Applications
Implementation and Evaluation of the Parallel Mesa Library
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
An image compositing solution at scale
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Hi-index | 0.00 |
Sort-last parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binary-swap (BS) method, which is an efficient image compositing algorithm for sort-last parallel rendering. Our compositing method uses three acceleration techniques, compared to the original BS method. Through the use of the three techniques, our method balances the compositing load among processors, exploits more sparsity of the image, and reduces the cost of communication. We also show some experimental results on a PC cluster. The results show that our method completes the image compositing faster than the original BS method, and its speedup to the original increases with the number of processors.