Computer Graphics Forum · 2008 · 59 citations · 32 references
ComputingComputer ScienceHigh-performance ComputingComputational GeometryComputer GraphicsRenderingGeometry ProcessingGraphics Processing UnitsRay TracingShader ProgrammingSurface IntersectionsSurface RenderingAlgebraic Surface IntersectionsAlgebraic SurfacesImplicit Surface RenderingImplicit SurfacesMetaprogrammingReal-time Ray TracingShader MetaprogrammingVector Instructions
Abstract Existing techniques for rendering arbitrary‐form implicit surfaces are limited, either in performance, correctness or flexibility. Ray tracing algorithms employing interval arithmetic (IA) or affine arithmetic (AA) for root‐funding are robust and general in the class of surfaces they support, but traditionally slow. Nonetheless, implemented efficiently using a stack‐driven iterative algorithm and SIMD vector instructions, these methods can achieve interactive performance for common algebraic surfaces on the CPU. A similar algorithm can also be implemented stacklessly, allowing for efficient ray tracing on the GPU. This paper presents these algorithms, as well as an inclusion‐preserving reduced affine arithmetic (RAA) for faster ray‐surface intersection. Shader metaprogramming allows for immediate and automatic generation of symbolic expressions and their interval or affine extensions. Moreover, we are able to render even complex forms robustly, in real‐time at high resolution .
32
Data structure forsoft objects
Geoff Wyvill, Craig McPheeters, Brian Wyvill · The Visual Computer · 1986 · 765 citations
Ray tracing on programmable graphics hardware
Timothy J. Purcell, Ian Buck, William R. Mark et al. · 2005 · 509 citations
Using particles to sample and control implicit surfaces
Andrew Witkin, Paul S. Heckbert · 2005 · 359 citations
Architecture, Physics, 3D Modeling +16