Low complexity subdivision algorithm to approximate Phong shading using forward difference

Teng Yao Sheu*, Lan-Da Van, Tzung Rung Jung, Cheng Wei Lin, Ting Wei Chang

*Corresponding author for this work

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

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% 3x3 matrix multiplications for setup operation.

原文English
主出版物標題2009 IEEE International Symposium on Circuits and Systems, ISCAS 2009
頁面2373-2376
頁數4
DOIs
出版狀態Published - 26 十月 2009
事件2009 IEEE International Symposium on Circuits and Systems, ISCAS 2009 - Taipei, Taiwan
持續時間: 24 五月 200927 五月 2009

出版系列

名字Proceedings - IEEE International Symposium on Circuits and Systems
ISSN(列印)0271-4310

Conference

Conference2009 IEEE International Symposium on Circuits and Systems, ISCAS 2009
國家Taiwan
城市Taipei
期間24/05/0927/05/09

指紋 深入研究「Low complexity subdivision algorithm to approximate Phong shading using forward difference」主題。共同形成了獨特的指紋。

引用此