Faster ray packets-triangle intersection through vertex culling

IEEE/ EG Symposium on Interactive Ray Tracing 2007 Proceedings, IRT

Volumn , Issue , 2007, Pages 105-112

  Reshetov, Alexander ^a  

^a INTEL CORPORATION   (United States)

Author keywords

Computational complexity; Ray tracing; Ray triangle intersection

Indexed keywords

ELEMENTARY PARTICLE SOURCES; INTERSECTIONS; TESTING; TRIANGULATION;

DYNAMIC SCENES; INTERACTIVE RAY TRACING; LEAF NODE; TRIANGLE (CO);

RAY TRACING;

EID: 47249126233     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2007.4342597     Document Type: Conference Paper

References (23)

1. Badouel D. An Efficient Ray-Polygon Intersection. In Graphics gems, Academic Press Professional Inc., San Diego, CA, 390-393, 1990.
2. Benthin C. Realtime Ray Tracing on current CPU Architectures. Ph.D. thesis, Saarland University, 2006.
3. Benthin C., Wald I., Scherbaum M., and Friedrich H. Ray Tracing on the CELL processor. In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 15-23, 2006.
4. Boulos S., Wald I., and Shirley P. Geometric and Arithmetic Culling Methods for Entire Ray Packets, Technical Report UUCS-06-10, SCI Institute, University of Utah, 2006.
5. Dmitriev K., Havran V., and Seidel H.-P. Faster Ray Tracing with SDMD Shaft Culling. Research report MPI-I-2004-4-006, Max-Planck Institut für Informatik, 2004.
6. Goldsmith J. and Salmon J. Automatic creation of object hierarchies for ray tracing. In IEEE Comput. Graph. Appl., 7(5), 14-20, 1987.
7. Havran V. Heuristic Ray Shooting Algorithms, Ph.D. Thesis, Czech Technical University, 2000.
8. Hunt W., Mark W., and Stoll G. Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, 81-88, 2006.
9. Hunt W., Mark W., and Fussell D. Fast and Lazy Build of Acceleration Structures from Scene Hierarchies. To appear in Proceedings of the IEEE/EG Symposium on Interactive Ray Tracing, 2007.
10. Kensler. A. and Shirley P. Optimizing Ray-Triangle Intersection via Automated Search. In Proceedings of the IEEE Symposium on Interactive Ray Tracing. 33-38, 2006.
11. Lauterbach C., Chandak A., and Manocha D. Interactive Sound Propagation in Dynamic Scenes Using Frustum Tracing. To appear in Proceedings of the IEEE Visualization, 2007.
12. Lauterbach C., Yoon S.-E., Manocha D., and Tuft D. RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, 39-46, 2006.
13. Möller T. and Trumbore B. Fast, minimum storage ray triangle intersection. In Journal of Graphics Tools, 2(1), 21-28, 1997.
14. Purcell T., Buck I., Mark W., and Hanrahan P. Ray Tracing on Programmable Graphics Hardware. In ACM Transactions on Graphics (Proceeding of SIGGRAPH 2002), 21(6), 703-712.
15. Reshetov A. Omnidirectional Ray Tracing Traversal Algorithm for kdtrees. In Proceedings of the IEEE Symposium on Interactive Ray Tracing, 57-60, 2006.
16. Reshetov A., Soupikov A., and Hurley J. Multi-Level Ray Tracing Algorithm. In ACM Transactions on Graphics (Proceeding of SIGGRAPH 2005), 24(3), 1176-1185.
17. Shevtsov M., Soupikov A., and Kapustin A. Interactive Ray-tracing of Massive Dynamic Geometry. To appear in Proceedings of Eurographics, 2007.
18. Snyder J. and Barr A. Ray tracing complex models containing surface tessellations. In Computer Graphics (Proceeding of SIGGRAPH 1987), 21(4), 119-128.
19. th Eurographics Symposium on Rendering, 139-149, 2006.
20. Wald I. and Havran V. On building fast kd-trees for ray tracing, and on doing that in O(N log N). In Proceedings of the IEEE Symposium on Interactive Ray Tracing, 61 -69, 2006.
21. Wald I. Realtime Ray Tracing and Interactive Global Illumination, Ph.D. thesis, Saarland University, 2004
22. Wald I., Boulos S., and Shirley P. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. In ACM Transactions on Graphics, 26(1), 1-18, 2007.
23. Wald I., Ize T., Kensler A., Knoll A., and Parker S. Ray Tracing Animated Scenes using Coherent Grid Traversal. In ACM Transactions on Graphics (Proceeding of SIGGRAPH2006). 25(3), 485-493.