Efficient parallel rendering on hypercube

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-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

Other

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

Fingerprint

Data visualization
Computer graphics
Animation
Processing
Rendering (computer graphics)

Cite this

Jenq, J. (2006). Efficient parallel rendering on hypercube. In 21st International Conference on Computers and Their Applications, CATA 2006 (pp. 152-157)
Jenq, John. / Efficient parallel rendering on hypercube. 21st International Conference on Computers and Their Applications, CATA 2006. 2006. pp. 152-157
@inproceedings{9f6154f52af74d42822cb241813ec81f,
title = "Efficient parallel rendering on hypercube",
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) .",
author = "John Jenq",
year = "2006",
month = "12",
day = "1",
language = "English",
isbn = "9781604234961",
pages = "152--157",
booktitle = "21st International Conference on Computers and Their Applications, CATA 2006",

}

Jenq, J 2006, Efficient parallel rendering on hypercube. in 21st International Conference on Computers and Their Applications, CATA 2006. pp. 152-157, 21st International Conference on Computers and Their Applications, CATA 2006, Seattle, WA, United States, 23/03/06.

Efficient parallel rendering on hypercube. / Jenq, John.

21st International Conference on Computers and Their Applications, CATA 2006. 2006. p. 152-157.

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

TY - GEN

T1 - Efficient parallel rendering on hypercube

AU - Jenq, John

PY - 2006/12/1

Y1 - 2006/12/1

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

SN - 9781604234961

SP - 152

EP - 157

BT - 21st International Conference on Computers and Their Applications, CATA 2006

ER -

Jenq J. Efficient parallel rendering on hypercube. In 21st International Conference on Computers and Their Applications, CATA 2006. 2006. p. 152-157