Sorted Pipeline Image Composition

dc.contributor.authorRoth, Marcusen_US
dc.contributor.authorReiners, Dirken_US
dc.contributor.editorAlan Heirich and Bruno Raffin and Luis Paulo dos Santosen_US
dc.date.accessioned2014-01-26T16:30:49Z
dc.date.available2014-01-26T16:30:49Z
dc.date.issued2006en_US
dc.description.abstractThe 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.en_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US
dc.identifier.isbn3-905673-40-1en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV06/119-126en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.2 [Computer Graphics]: Graphics SystemsDistributed/ networked graphics;en_US
dc.titleSorted Pipeline Image Compositionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
119-126.pdf
Size:
184.73 KB
Format:
Adobe Portable Document Format