Fang Liu
ABSTRACT
Efficient rendering of multi-fragment effects has long been a great challenge in computer graphics. The classical depth peeling algorithm [Everitt 2001] provides a simple but robust solution by peeling off one layer per pass, but multi rasterizations will lead to performance bottleneck for large and complex scenes. The k-buffer [Bavoil et al. 2007] captures k fragments in a single pass but suffers from read-modify-write(RMW) hazards which can be alleviated by multi passes [Liu et al. 2006]. Our approach exploits multiple render targets (MRT) as bucket array per pixel. Fragments are scattered into different buckets and sorted by a bucket sort. We describe two efficient schemes to reduce collisions when multiple fragments are routed to the same bucket. Our algorithm shows up to 32 times speedup to depth peeling especially for large scenes and the results are visually faithful. Also it has no requirement of pre-sorting geometries or post-sorting fragments, and is free of RMW hazards.
Supplemental Material
- Bavoil, L., Callahan, S. P., Lefohn, A., Comba, J. a. L. D., and Silva, C. T. 2007. Multi-fragment effects on the gpu using the k-buffer. In Proceedings of the 2007 symposium on Interactive 3D graphics and games, ACM, 97--104. Google Scholar
Digital Library
- Everitt, C. 2001. Interactive order-independent transparency. Tech. rep., NVIDIA Corporation.Google Scholar
- Liu, B.-Q., Wei, L.-Y., and Xu, Y.-Q. 2006. Multi-layer depth peeling via fragment sort. Tech. rep., Microsoft Research Asia.Google Scholar
Index Terms
- Bucket depth peeling
Recommendations
Efficient depth peeling via bucket sort
HPG '09: Proceedings of the Conference on High Performance Graphics 2009In 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 ...
Single pass depth peeling via CUDA rasterizer
SIGGRAPH '09: SIGGRAPH 2009: TalksMulti-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 ...
Fast soft shadow by depth peeling
SIGGRAPH '10: ACM SIGGRAPH 2010 PostersSoft shadow generation is a challenging problem in realistic rendering. Previous methods using shadow map or shadow volume work well for point light sources but are difficult to be extended to area lights. This paper presents a new method for fast soft ...
Comments