Ray Traversal Algorithms is a computational method in ray tracing that determines the path of rays through a hierarchical spatial data structure to efficiently identify ray–scene intersections by minimizing redundant geometric tests.
476
Publications
28K
Citations
906
Authors
364
Institutions
Publications per year
2017–2026
33
Parents
Publications
476
Fast, Minimum Storage Ray-Triangle Intersection
Tomas Möller, Ben Trumbore · Journal of Graphics Tools · 1997 · 1K citations
A Fast Voxel Traversal Algorithm for Ray Tracing
John Amanatides, Andrew Woo · 1987 · 670 citations · Full text
Steven G. Parker, James Bigler, Andreas Dietrich et al. · ACM Transactions on Graphics · 2010 · 669 citations
1–5 of 476
Authors
906
- IW
19
h-index
- VH
14
h-index
- PS
12
h-index
- SG
11
h-index
- DMDinesh Manocha
University of North Carolina at Chapel Hill, United States
9 publications · 356 citations
9
h-index
1–5 of 906
Institutions
364
University of Utah
Salt Lake City, United States
19 h-index
58 publications
3.9K citations
Intel (United States)
Santa Clara, United States
16 h-index
27 publications
1.4K citations
Czech Technical University in Prague
Prague, Czechia
14 h-index
26 publications
930 citations
Saarland University
Saarbrücken, Germany
13 h-index
33 publications
2K citations
Intel (United Kingdom)
Swindon, United Kingdom
13 h-index
23 publications
1.7K citations
Stony Brook University
Stony Brook, United States
11 h-index
14 publications
2.6K citations
Nvidia (United Kingdom)
Reading, United Kingdom
11 h-index
38 publications
8.7K citations
Tel Aviv University
Tel Aviv, Israel
9 h-index
12 publications
709 citations
1–8 of 364
Venues
- Computer Graphics Forum
39 publications · 1.6K citations
22
h-index
- The Visual Computer
24 publications · 1.3K citations
19
h-index
- ACM Transactions on Graphics
TOG · 16 publications · 2.3K citations
16
h-index
- Computers & Graphics
14 publications · 349 citations
13
h-index
- Eurographics
Repository · 12 publications · 203 citations
11
h-index
1–5