Robust ray intersection with interval arithmetic
Proceedings on Graphics interface '90
A language for shading and lighting calculations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Constant propagation with conditional branches
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interval analysis for computer graphics
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Measuring and modeling anisotropic reflection
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
CONDOR: constraint-based dataflow
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Error-bounded antialiased rendering of complex environments
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Sampling procedural shaders using affine arithmetic
ACM Transactions on Graphics (TOG)
A Family of Variable-Precision Interval Arithmetic Processors
IEEE Transactions on Computers
An anisotropic phong BRDF model
Journal of Graphics Tools
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Lightcuts: a scalable approach to illumination
ACM SIGGRAPH 2005 Papers
ACM SIGGRAPH 2006 Papers
Continuous collision detection for articulated models using Taylor models and temporal culling
ACM SIGGRAPH 2007 papers
PCU: the programmable culling unit
ACM SIGGRAPH 2007 papers
Efficient product sampling using hierarchical thresholding
The Visual Computer: International Journal of Computer Graphics
Comparison of Packages for Interval Arithmetic
Informatica
Automatic pre-tessellation culling
ACM Transactions on Graphics (TOG)
RTSL: a Ray Tracing Shading Language
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Automatic bounding of programmable shaders for efficient global illumination
ACM SIGGRAPH Asia 2009 papers
OpenFab: a programmable pipeline for multi-material fabrication
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Hi-index | 0.00 |
Programmable shading provides artistic control over materials and geometry, but the black box nature of shaders makes some rendering optimizations difficult to apply. In many cases, it is desirable to compute bounds of shaders in order to speed up rendering. A bounding shader can be automatically derived from the original shader by a compiler using interval analysis, but creating optimized interval arithmetic code is non-trivial. A key insight in this paper is that shaders contain metadata that can be automatically extracted by the compiler using data flow analysis. We present a number of domain-specific optimizations that make the generated code faster, while computing the same bounds as before. This enables a wider use and opens up possibilities for more efficient rendering. Our results show that on average 42–44% of the shader instructions can be eliminated for a common use case: single-sided bounding shaders used in lightcuts and importance sampling.