ISCAS OpenIR  > 基础软件与系统重点实验室
single pass depth peeling via cuda rasterizer
Liuz Fang; Huang Meng-Cheng; Liu Xue-Hui; Wuz En-Hua
2009
会议名称SIGGRAPH 2009: Talks, SIGGRAPH 09
会议录名称SIGGRAPH 2009: Talks, SIGGRAPH 09
会议日期August 3,
会议地点New Orleans, LA, United states
出版地United States
ISBN9781605588346
部门归属(1) Institute of Software, Chinese Academy of Sciences; (2) University of Macaux
摘要Multi-fragment effects play important roles on many graphics applications, which require operations on more than one fragment per pixel. The classical depth peeling algorithm [Everitt 2001] peels off one layer each pass, but the performance degrades for large scenes. We prefer to capture multiple fragments in a single pass, which is difficult because the fragments generated in graphics pipeline are not allowed to be scattered to arbitrary positions of the buffers. Compute unified device architecture (CUDA) [NVIDIA 2008] provides more flexible control over the GPU memory, but accessing of the fragments generated by graphics pipeline is not yet supported. In this work we design a CUDA rasterizer so that many graphics applications can benefit from the free control of GPU memory, especially for the multi-fragment effects. We present two efficient schemes to capture and sort multiple fragments per pixel in a single geometry pass via the atomic operations of CUDA without read-modify-write (RMW) hazards. Experimental results show significant speedup to classical depth peeling, especially for large scenes.
关键词Computer Graphics Equipment Pipelines Pixels
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/8484
专题基础软件与系统重点实验室
推荐引用方式
GB/T 7714
Liuz Fang,Huang Meng-Cheng,Liu Xue-Hui,et al. single pass depth peeling via cuda rasterizer[C]. United States,2009.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liuz Fang]的文章
[Huang Meng-Cheng]的文章
[Liu Xue-Hui]的文章
百度学术
百度学术中相似的文章
[Liuz Fang]的文章
[Huang Meng-Cheng]的文章
[Liu Xue-Hui]的文章
必应学术
必应学术中相似的文章
[Liuz Fang]的文章
[Huang Meng-Cheng]的文章
[Liu Xue-Hui]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。