Hashed Alpha Testing
"Hashed Alpha Testing"
Chris Wyman (NVIDIA), Morgan McGuire (NVIDIA), in ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D'17), Feb 2017
|Research Area:||3D Graphics|
|Author(s):||Chris Wyman (NVIDIA), Morgan McGuire (NVIDIA)|
|Abstract:||Renderers apply alpha testing to mask out complex silhouettes using alpha textures on simple proxy geometry. While widely used, alpha testing has a long-standing problem that is underreported in the literature, but observable in commercial games: geometry can entirely disappear as alpha mapped polygons recede with distance. As foveated rendering for virtual reality spreads this problem worsens, as peripheral minification and prefilitering also cause this problem for nearby objects. We introduce two algorithms, stochastic alpha testing and hashed alpha testing, that avoid this issue but add some noise. Instead of using a fixed alpha threshold, ατ, stochastic alpha testing discards fragments with alpha below randomly chosen ατ ∈ (0..1]. Hashed alpha testing uses a hash function to choose ατ procedurally, producing stable noise that reduces temporal flicker. With a good hash function and inputs, hashed alpha testing maintains distant geometry without introducing more temporal flicker than traditional alpha testing. We describe how hashed and stochastic alpha testing apply to alpha-to-coverage and screen-door transparency, and how they simplify stochastic transparency.|
ACM Copyright Notice Copyright by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM's Digital Library http://www.acm.org/dl/.