The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (2010 vol. 16)
ISSN: 1077-2626
pp: 261-272
Jag Mohan Singh , International Institute of Information Technology (IIIT), Hyderabad
P.J. Narayanan , International Institute of Information Technology (IIIT), Hyderabad
Compact representation of geometry using a suitable procedural or mathematical model and a ray-tracing mode of rendering fit the programmable graphics processor units (GPUs) well. Several such representations including parametric and subdivision surfaces have been explored in recent research. The important and widely applicable category of the general implicit surface has received less attention. In this paper, we present a ray-tracing procedure to render general implicit surfaces efficiently on the GPU. Though only the fourth or lower order surfaces can be rendered using analytical roots, our adaptive marching points algorithm can ray trace arbitrary implicit surfaces without multiple roots, by sampling the ray at selected points till a root is found. Adapting the sampling step size based on a proximity measure and a horizon measure delivers high speed. The sign test can handle any surface without multiple roots. The Taylor test that uses ideas from interval analysis can ray trace many surfaces with complex roots. Overall, a simple algorithm that fits the SIMD architecture of the GPU results in high performance. We demonstrate the ray tracing of algebraic surfaces up to order 50 and nonalgebraic surfaces including a Blinn's blobby with 75 spheres at better than interactive frame rates.
Ray tracing, implicit surfaces, GPU rendering.

P. Narayanan and J. M. Singh, "Real-Time Ray Tracing of Implicit Surfaces on the GPU," in IEEE Transactions on Visualization & Computer Graphics, vol. 16, no. , pp. 261-272, 2009.
91 ms
(Ver 3.3 (11022016))