Efficient Parallel Rendering on Hypercube
Hidden surface removal has been a fundamental problem in computer graphics applications. To speed up the process of the hidden surface removal in the applications of real time animation and scientific visualization that rendering large and complex volume of 3D dataset into 2D images, high performance parallel processing computation are always involved. In this paper, we present two efficient hypercube algorithms that use N3 and N 2 respectively. With the former run in optimal time ofO(log N) , the latter has running time of O(log 2 N) .
MSU Digital Commons Citation
Jenq, John, "Efficient Parallel Rendering on Hypercube" (2006). Department of Computer Science Faculty Scholarship and Creative Works. 247.