Please use this identifier to cite or link to this item:
|Title:||A comparison of pixel complexity in composition techniques for sort-last rendering||Authors:||Tay, Y.C.||Keywords:||Computer graphics
|Issue Date:||2002||Citation:||Tay, Y.C. (2002). A comparison of pixel complexity in composition techniques for sort-last rendering. Journal of Parallel and Distributed Computing 62 (1) : 152-171. ScholarBank@NUS Repository. https://doi.org/10.1006/jpdc.2001.1771||Abstract:||Sort-last rendering is a method of parallelizing compute-intensive computer graphics; specifically, the primitives that describe a scene are first allocated to a set of renderers, and the rendered images are then composited to give the final image. This paper surveys six such techniques and compares their performance with active pixels, i.e., pixels that are covered by at least one primitive. Active pixels offer a uniform way of accounting for the time, space, and bandwidth costs in sort-last rendering. The comparison highlights the strengths of each technique. For example, tree composition has minimum work, binary-swap (hypercube) has minimum composition latency, direct pixel forwarding (mesh) has minimum bandwidth latency, and snooping (bus) has minimum bandwidth volume; binary-swap's bandwidth and composition latencies decrease, whereas the bandwidth volumes for direct pixel forwarding and snooping are constant, when the number of renderers increase; etc. © 2001 Elsevier Science.||Source Title:||Journal of Parallel and Distributed Computing||URI:||http://scholarbank.nus.edu.sg/handle/10635/102622||ISSN:||07437315||DOI:||10.1006/jpdc.2001.1771|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.