Efficient parallel rendering on hypercube

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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) .

Original languageEnglish
Title of host publication21st International Conference on Computers and Their Applications, CATA 2006
Pages152-157
Number of pages6
StatePublished - 1 Dec 2006
Event21st International Conference on Computers and Their Applications, CATA 2006 - Seattle, WA, United States
Duration: 23 Mar 200625 Mar 2006

Publication series

Name21st International Conference on Computers and Their Applications, CATA 2006

Other

Other21st International Conference on Computers and Their Applications, CATA 2006
CountryUnited States
CitySeattle, WA
Period23/03/0625/03/06

Fingerprint Dive into the research topics of 'Efficient parallel rendering on hypercube'. Together they form a unique fingerprint.

Cite this