DocumentCode :
2262509
Title :
Low complexity subdivision algorithm to approximate Phong shading using forward difference
Author :
Sheu, Teng-Yao ; Van, Lan-Da ; Jung, Tzung-Rung ; Lin, Cheng-Wei ; Chang, Ting-Wei
Author_Institution :
Dept. of Comput. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
2009
fDate :
24-27 May 2009
Firstpage :
2373
Lastpage :
2376
Abstract :
In this paper, we proposed a low complexity subdivision algorithm to approximate Phong shading. It is a combination of a subdivision scheme using forward difference and a recovery scheme to prevent rasterization anomaly. Dual space subdivision, triangle filtering and variable sharing schemes are also proposed to reduce the computation. Compared with the conventional recursive subdivision shading algorithm, the proposed algorithm reduces 46.6% memory access, 80% projective transformations and perspective division, 93.75% clipping/culling tests and 60% 3 times 3 matrix multiplications for setup operation.
Keywords :
computational geometry; matrix multiplication; Phong shading; dual space subdivision; forward difference; low complexity subdivision algorithm; matrix multiplications; rasterization anomaly; recovery scheme; recursive subdivision shading algorithm; subdivision scheme; triangle filtering; variable sharing schemes; Acceleration; Computer science; Costs; Filtering; Graphics; Hardware; Interpolation; Optical reflection; Rendering (computer graphics); Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on
Conference_Location :
Taipei
Print_ISBN :
978-1-4244-3827-3
Electronic_ISBN :
978-1-4244-3828-0
Type :
conf
DOI :
10.1109/ISCAS.2009.5118277
Filename :
5118277
Link To Document :
بازگشت