Name
Abstract | ||
|---|---|---|
Procedural shaders are a vital part of modern rendering systems. Despite their prevalence, however, procedural shaders remain sensitive to aliasing any time they are sampled at a rate below the Nyquist limit. Antialiasing is typically achieved through numerical techniques like supersampling or precomputing integrals stored in mipmaps. This paper explores the problem of analytically computing a band-limited version of a procedural shader as a continuous function of the sampling rate. There is currently no known way of analytically computing these integrals in general. We explore the conditions under which exact solutions are possible and develop several approximation strategies for when they are not. Compared to supersampling methods, our approach produces shaders that are less expensive to evaluate and closer to ground truth in many cases. Compared to mipmapping or precomputation, our approach produces shaders that support an arbitrary bandwidth parameter and require less storage. We evaluate our method on a range of spatially-varying shader functions, automatically producing antialiased versions that have comparable error to 4x4 multisampling but can be over an order of magnitude faster. While not complete, our approach is a promising first step toward this challenging goal and indicates a number of interesting directions for future work. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1111/cgf.12747 | COMPUTER GRAPHICS FORUM |
Field | DocType | Volume |
Computer vision,Mipmap,Volume rendering,Precomputation,Computer science,Algorithm,Aliasing,Supersampling,Artificial intelligence,Rendering (computer graphics),Render Target,Shader | Journal | 34.0 |
Issue | ISSN | Citations |
7.0 | 0167-7055 | 1 |
PageRank | References | Authors |
0.35 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan Dorn | 1 | 112 | 4.47 |
| Connelly Barnes | 2 | 1729 | 59.07 |
| Jason Lawrence | 3 | 186 | 8.69 |
| Westley Weimer | 4 | 3510 | 162.27 |