完整後設資料紀錄
DC 欄位語言
dc.contributor.authorSheu, Teng-Yaoen_US
dc.contributor.authorVan, Lan-Daen_US
dc.contributor.authorJung, Tzung-Rungen_US
dc.contributor.authorLin, Cheng-Weien_US
dc.contributor.authorChang, Ting-Weien_US
dc.date.accessioned2014-12-08T15:23:27Z-
dc.date.available2014-12-08T15:23:27Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-3827-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/16422-
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.titleLow Complexity Subdivision Algorithm to Approximate Phong Shading Using Forward Differenceen_US
dc.typeProceedings Paperen_US
dc.identifier.journalISCAS: 2009 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-5en_US
dc.citation.spage2373en_US
dc.citation.epage2376en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000275929801280-
顯示於類別:會議論文