中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 计算机科学国家重点实验室  > 会议论文
题名:
efficient depth peeling via bucket sort
作者: Liu Fang ; Huang Meng-Cheng ; Liu Xue-Hui ; Wu En-Hua
会议文集: Proceedings of the HPG 2009: Conference on High-Performance Graphics 2009
会议名称: HPG 2009: Conference on High-Performance Graphics 2009
会议日期: August 1,
出版日期: 2009
会议地点: New Orleans, LA, United states
关键词: Blending ; Geometry ; Pixels ; Targets ; Transparency
出版地: United States
ISBN: 9781605586038
部门归属: (1) Institute of Software, Chinese Academy of Sciences; (2) University of Macau
主办者: ACM SIGGRAPH; Eurographics Association
英文摘要: In this paper we present an efficient algorithm for multi-layer depth peeling via bucket sort of fragments on GPU, which makes it possible to capture up to 32 layers simultaneously with correct depth ordering in a single geometry pass. We exploit multiple render targets (MRT) as storage and construct a bucket array of size 32 per pixel. Each bucket is capable of holding only one fragment, and can be concurrently updated using the MAX/MIN blending operation. During the rasterization, the depth range of each pixel location is divided into consecutive subintervals uniformly, and a linear bucket sort is performed so that fragments within each subintervals will be routed into the corresponding buckets. In a following fullscreen shader pass, the bucket array can be sequentially accessed to get the sorted fragments for further applications. Collisions will happen when more than one fragment is routed to the same bucket, which can be alleviated by multi-pass approach. We also develop a two-pass approach to further reduce the collisions, namely adaptive bucket depth peeling. In the first geometry pass, the depth range is redivided into non-uniform subintervals according to the depth distribution to make sure that there is only one fragment within each subinterval. In the following bucket sorting pass, there will be only one fragment routed into each bucket and collisions will be substantially reduced. Our algorithm shows up to 32 times speedup to the classical depth peeling especially for large scenes with high depth complexity, and the experimental results are visually faithful to the ground truth. Also it has no requirement of pre-sorting geometries or post-sorting fragments, and is free of read-modify-write (RMW) hazards. Copyright © 2009 by the Association for Computing Machinery, Inc.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8406
Appears in Collections:计算机科学国家重点实验室 _会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Liu Fang,Huang Meng-Cheng,Liu Xue-Hui,et al. efficient depth peeling via bucket sort[C]. 见:HPG 2009: Conference on High-Performance Graphics 2009. New Orleans, LA, United states. August 1,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Liu Fang]'s Articles
[Huang Meng-Cheng]'s Articles
[Liu Xue-Hui]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Liu Fang]‘s Articles
[Huang Meng-Cheng]‘s Articles
[Liu Xue-Hui]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace