IMAGE COMPOSITION SCHEMES FOR SORT-LAST POLYGON RENDERING ON 2D MESH MULTICOMPUTERS

Citation
Ty. Lee et al., IMAGE COMPOSITION SCHEMES FOR SORT-LAST POLYGON RENDERING ON 2D MESH MULTICOMPUTERS, IEEE transactions on visualization and computer graphics, 2(3), 1996, pp. 202-217
Citations number
32
Categorie Soggetti
Computer Sciences","Computer Science Software Graphycs Programming","Engineering, Eletrical & Electronic
ISSN journal
10772626
Volume
2
Issue
3
Year of publication
1996
Pages
202 - 217
Database
ISI
SICI code
1077-2626(1996)2:3<202:ICSFSP>2.0.ZU;2-8
Abstract
In a sort-last polygon rendering system, the efficiency of image compo sition is very important for achieving fast rendering. In this paper, the implementation of a sort-last rendering system on a general purpos e multicomputer system is described. A two-phase sort-last-full image composition scheme is described first, acid then many variants of it a re presented for 2D mesh message-passing multicomputers, such as the I ntel Delta and Paragon. All the proposed schemes are analyzed and expe rimentally evaluated on Caltech's Inter Delta machine for our sort-las t parallel polygon renderer. Experimental results show that sort-last- sparse strategies are better suited than sort-last-full schemes for so ftware implementation on a general purpose multicomputer system. Furth er, interleaved composition regions perform better than coherent regio ns. In a large multicomputer system, performance can be improved by ca refully scheduling the tasks of rendering and communication. Using 512 processors to render our test scenes, the peak rendering rate achieve d on a 262,144 triangle dataset is close to 4.6 million triangles per second which is comparable to the speed of current state-of-the-art gr aphics workstations.