Real time discrete shading |
| |
Authors: | Daniel Cohen Arie Kaufman Reuven Bakalash Samuel Bergman |
| |
Affiliation: | (1) Department of Computer Science, State University of New York, 11794-4400 Stony Brook, NY, USA;(2) Department of Mathematics and Computer Science, Ben Gurion University, 84120 Beer Sheva, Israel;(3) Present address: Department of Computer Science, Hofstra University, 11500 Hempstead, NY, USA |
| |
Abstract: | A shading technique for voxel-based images, termedcongradient shading, is presented. As the surface information is not available in voxel representation, the surface normal must be recovered from the 3D discrete voxel map itself. The technique defines the normal as one of a finite set of neighborhood-estimated gradients and can thus employ precalculated look-up tables. Furthermore, a table-driven mechanism permits changing the light source parameters by merely redefining the look-up table. The technique uses only simple arithmetic operations and is thus suitable for hardware implementation. Since it has been implemented not as a post-processor, but as part of the projection pipeline of the cube architecture, congradient shading can be executed in real time. Two versions of the technique in real time. Two versions of the technique have been conceived and implemented:unidirectional shading, in which the gradient is estimated only from neighborhoods along the scan-lines;bidirectional shading, in which both horizontal and vertical components of the gradient are considered. In spite of the simplicity of the technique, the results are practically indistinguishable from images generated by conventional techniques.This work was supported by the National Science Foundation under grants DCR 8603603, CCR 8743478, CCR 8717016, and MIP 8805130 |
| |
Keywords: | Shading technique Congradient shading Voxel Cube architecture |
本文献已被 SpringerLink 等数据库收录! |
|