基于桶内动态融合的透明现象的高效绘制

Efficient Order Independent Transparency via Dynamic Blending in Buckets

基于桶排序的顺序独立透明现象绘制算法,采用桶排序原理将投影收集到同一个像素上的多个片元并排序,当发生桶内片元冲突时会产生错误的绘制结果.为此,提出一种基于桶内动态融合的透明现象的高效绘制算法.此算法采用桶内动态融合和并发读/写的方法逐一融合落入同一个桶内的所有片元,并在后处理中按从前向后的顺序融合各个桶内的颜色值.由于同时发生桶内片元冲突和读/写冲突的概率非常小,因而可以大大提高绘制结果的准确性.实验结果表明,与基于桶排序的绘制算法相比,采用文中算法可以更准确地绘制场景,生成与真实结果非常相近的绘制效果,同时算法的效率基本保持不变.

The bucket depth peeling algorithm captures and sorts multiple fragments of each pixel via bucket sort, which may result in artifact when collision happens. This paper presents an improvement over the bucket depth peeling algorithm for efficient rendering of order independent transparency. By the improvement, fragments within each bucket are all captured and blended dynamically. In post- processing, the color in each bucket is blended in front-to-back order. Experimental results show that our algorithm can be used to generate more accurate results, while maintaining the similar performance.