Adrian Sharpe
Edwin Blake
ABSTRACT
We present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classification algorithm. Where the original algorithm evaluates intersection candidates at run-time, our solution evaluates them as a preprocess.The offline nature of our solution allows for an adaptive subdivision of ray space. The advantage being, that it allows for the placement of a user set upper bound on the number of primitives intersected.The candidate sets produced account for occlusion, thereby reducing memory requirements and accelerating the ray shooting process. A novel algorithm which exploits graphics hardware is used to evaluate the candidate sets. It is the treatment of occlusion that allows for the practical precomputation of the ray space partition. This algorithm is called aggressive since it is optimal (no invisible primitives are included), but may result in false exclusion of visible primitives. Error is minimised through the adaptive sampling.
- Arvo, J., and Kirk, D. 1987. Fast ray tracing by ray classification. In Computer Graphics, Annual Conference Series (SIGGRAPH '87 Proceedings), vol. 21, ACM, 55-64. Google Scholar
Digital Library
- Chrysanthou, Y., Cohen-Or, D., and Lischinski, D. 1998. Fast approximate quantitative visibility for complex scenes. In Computer Graphics International 1998, IEEE Computer Society, Hannover, Germany. Google ScholarDigital Library
- Cohen, M. F., and Greenberg, D. P. 1985. The hemi-cube: a radiosity solution for complex environments. In Proceedings of the 12th annual conference on Computer graphics and interactive techniques, ACM Press, 31-40. Google ScholarDigital Library
- Havran, V. 2000. Heuristic Ray Shooting Algorithms. Ph.d. thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague.Google Scholar
- Nirenstein, S., Gain, J., and Blake, E. 2001. Aggressive visibility pre-processing with adaptive sampling. Tech. Rep. CS01-01-00, Department of Computer Science, University of Cape Town, http://www.cs.uct.ac.za/Research/CVC/Techrep/CS01-01-00.pdf.Google Scholar
- Rubin, S. M., and Whitted, T. 1980. A 3-dimensional representation for fast rendering of complex scenes. In Computer Graphics, Annual Conference Series (SIGGRAPH '80 Proceedings), vol. 14, ACM, 110-116. Google ScholarDigital Library
- Simiakakis, G., and Day, A. M. 1994. Five-dimensional adaptive subdivision for ray tracing. Computer Graphics Forum 13, 2, 133-140.Google ScholarCross Ref
- Sudarsky, O., and Gotsman, C. 1999. Dynamic scene occlusion culling. IEEE Transactions on Visualization and Computer Graphics 5, 1, 13-29. ISSN 1077-2626. Google ScholarDigital Library
Index Terms
- Accelerating ray shooting through aggressive 5D visibility preprocessing
Recommendations
Ray tracing-based interactive diffuse indirect illumination
Despite great efforts in recent years to accelerate global illumination computation, the real-time ray tracing of fully dynamic scenes to support photorealistic indirect illumination effects has yet to be achieved in computer graphics. In this paper, we ...
Hierarchical Visibility for Virtual Reality
We introduce a novel primary visibility algorithm based on ray casting that provides real time performance and a feature set well suited for rendering virtual reality. The flexibility provided by our approach allows for a variety of features such as lens ...
Exploiting temporal coherence in ray casted walkthroughs
SCCG '03: Proceedings of the 19th Spring Conference on Computer GraphicsWe present a technique that aims at exploiting temporal coherence of ray casted walkthroughs. Our goal is to reuse ray/object inter sections computed in the last frame of the walkthrough for acceleration of ray casting in the current frame. In ...
Comments