TY - GEN
T1 - Efficient parallel rendering on hypercube
AU - Jenq, John
PY - 2006
Y1 - 2006
N2 - 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) .
AB - 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) .
UR - http://www.scopus.com/inward/record.url?scp=84883290773&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84883290773
SN - 9781604234961
T3 - 21st International Conference on Computers and Their Applications, CATA 2006
SP - 152
EP - 157
BT - 21st International Conference on Computers and Their Applications, CATA 2006
T2 - 21st International Conference on Computers and Their Applications, CATA 2006
Y2 - 23 March 2006 through 25 March 2006
ER -