PixelFlow: high-speed rendering using image composition
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Image-composition architectures for real-time image generation
Image-composition architectures for real-time image generation
Scalable distributed visualization using off-the-shelf components
PVGS '99 Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics
Hybrid sort-first and sort-last parallel rendering with a cluster of PCs
HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Sort-last parallel rendering for viewing extremely large data sets on tile displays
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers
IEEE Transactions on Visualization and Computer Graphics
Parallel Volume Rendering Using Binary-Swap Compositing
IEEE Computer Graphics and Applications
Sepia: Scalable 3D Compositing Using PCI Pamette
FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Interactive exploration of large data in hybrid visualization environments
EGVE'07 Proceedings of the 13th Eurographics conference on Virtual Environments
Multi-GPU sort-last volume visualization
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number of rendering nodes, which makes it very attractive for very large polygonal and volumetric models. The disadvantage of sort last rendering is that a final image composition step is necessary in which a huge amount of data has to be transferred between the rendering nodes. Even with gigabit or faster networks the image composition introduces an overhead that makes it impractical to use sort last parallel rendering for interactive applications on large clusters. This paper describes the Sorted Pipeline Composition algorithm that reduces the amount of data that needs to be transferred by an order of magnitude and results in a frame rate that is at least twice as high as the widely used binary swap image composition algorithm.