繪圖處理器中順序獨立透明畫素片段儲存系統之設計

Abstract

為了能正確且迅速繪製出場景透明度的效果，現今電腦圖學領域中提出了順序獨立透明計算之演算法，並配以額外透明畫素片段儲存系統之支援，以進一步降低演算法所需執行時間。然而，隨著現今對於高畫質場景的要求愈來愈高的情況下，場景中具透明度像素片段之數目亦日漸增加，其所需儲存空間亦日漸增大。如何能降低該儲存容量之需求，成為值得研究之議題。本論文針對順序獨立透明計算，提出一畫素片段儲存系統之設計：依畫素片段之螢幕座標位置，將畫素片段擺放至儲存系統中相對應的位址，並利用指標索引方式，將具相同螢幕座標之畫素片段串連起來，達到節省系統儲存空間、降低對儲存系統存取之次數、快速存取同螢幕座標畫素片段及之目的。

In order to correctly and fast render the transparent effect of a scene, some hardware oriented algorithms with additional transparent fragment storage supports for order-independent transparency are proposed in current computer graphics. However, as the scene complexity is constantly increasing, the number of transparent fragments and the size of transparent fragment storage support also increase significantly. To lower the demand for memory, in this thesis, we propose a transparent fragment storage system design for order-independent transparency. Within our fragment storage system, transparent fragments are stored in a corresponding location based on their x-y coordinate, and connected with the other fragments that has the same x-y coordinate by pointer indexing. The objective of our design is to reduce the memory requirement and the memory access frequency of the transparent fragment storage system.