Mortensen, J; Khanna, P; Yu, I; Slater, M; (2007) A visibility field for ray tracing. In: Computer Graphics, Imaging and Visualisation: New Advances, CGIV 2007. (pp. 54 - 61).
Full text not available from this repository.
This paper presents a type of visibility data structure for accelerated ray tracing. The visibility field is constructed by choosing a regular point subdivision over a hemisphere to obtain a set of directions. Corresponding to each direction there is then a rectangular grid of parallel beams, with each beam referencing a set of identifiers corresponding to objects that intersect it. Objects lying along a beam are sorted using a ID BSP along the beam direction. The beam corresponding to any ray can be looked up in small constant time and the set of objects corresponding to the beam can then be searched for intersection with the ray using an optimised traversal strategy. This approach trades off rendering speed for memory usage and pre-processing time. The data structure is also very suitable for hemisphere integration tasks due to its spherical nature and results for one such task Ambient Occlusion - are also presented. Results for several scenes with various rendering methods are presented and compare favourably with a well established approach, the single-ray Coherent Ray Tracing approach of Wald and Slusallek et al. © 2007 IEEE.
|Title:||A visibility field for ray tracing|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record