UM  > 科技學院
Efficient Depth Peeling via Bucket Sort
Liu, Fang1; Huang, Meng-Cheng1; Liu, Xue-Hui1; Wu, En-Hua1,2
2009
Conference NameHPG 2009: Conference on High-Performance Graphics 2009
Source PublicationProceedings of the HPG 2009: Conference on High-Performance Graphics 2009
Pages51-58
Conference Date8 1, 2009 - 8 3, 2009
Conference PlaceNew Orleans, LA, United states
Author of SourceAssociation for Computing Machinery
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.

KeywordGraphics Hardware Depth Peeling Multiple Render Target (Mrt) Bucket Sort Order Independent Transparency (Oit) Max/min Blending Histogram Equalization
DOIhttps://doi.org/10.1145/1572769.1572779
Language英语
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionFaculty of Science and Technology
Affiliation1.Institute of Software, Chinese Academy of Sciences, China;
2.University of Macau
Recommended Citation
GB/T 7714
Liu, Fang,Huang, Meng-Cheng,Liu, Xue-Hui,et al. Efficient Depth Peeling via Bucket Sort[C]//Association for Computing Machinery,2009:51-58.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Liu, Fang]'s Articles
[Huang, Meng-Cheng]'s Articles
[Liu, Xue-Hui]'s Articles
Baidu academic
Similar articles in Baidu academic
[Liu, Fang]'s Articles
[Huang, Meng-Cheng]'s Articles
[Liu, Xue-Hui]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liu, Fang]'s Articles
[Huang, Meng-Cheng]'s Articles
[Liu, Xue-Hui]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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