| Title: | efficient depth peeling via bucket sort |
| Author: | Liu Fang
; Huang Meng-Cheng
; Liu Xue-Hui
; Wu En-Hua
|
| Source: | Proceedings of the HPG 2009: Conference on High-Performance Graphics 2009
|
| Conference Name: | HPG 2009: Conference on High-Performance Graphics 2009
|
| Conference Date: | August 1,
|
| Issued Date: | 2009
|
| Conference Place: | New Orleans, LA, United states
|
| Keyword: | Blending
; Geometry
; Pixels
; Targets
; Transparency
|
| Publish Place: | United States
|
| ISBN: | 9781605586038
|
| Department: | (1) Institute of Software, Chinese Academy of Sciences; (2) University of Macau
|
| Sponsorship: | ACM SIGGRAPH; Eurographics Association
|
| English Abstract: | 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. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8406
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
|
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,.
|
|
|
