Summary: A Comparison of Spatial Subdivision
Algorithms for SortFirst Rendering ?
Tahsin M. Kur¸c, H¨useyin Kutluca, Cevdet Aykanat, and B¨ulent ¨
Dept. of Computer Engineering and Information Sci.
Bilkent University, 06533 Ankara, TURKEY
Abstract. This paper describes and experimentally evaluates three adap
tive spatial subdivision heuristics for sortfirst parallel graphics rendering
on distributedmemory multicomputers. In sortfirst rendering, image
space, or screen, is divided into regions. Each processor is assigned one
or multiple regions to render. Primitives in the scene are redistributed
among the processors according to region assignments. The total num
ber of primitives in the system may increase due to duplication of primi
tives crossing multiple regions assigned to different processors. The com
mon characteristic of the algorithms discussed in this paper is that a
2dimensional mesh is superimposed on the screen and screen is subdi
vided using the primitive distribution on this mesh. Each processor is
assigned a single region to render. The first algorithm uses summed area
table for subdividing the screen. The second algorithm uses quadtrees for
subdivision. The third algorithm utilizes a graph partitioning approach.