Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.16697 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911690808885248 |
|---|---|
| author | Wald, Ingo |
| author_facet | Wald, Ingo |
| contents | We look at the problem of Ordered Front-To-Back Any-Hit Traversal (FTB); i.e., a traversal that iterates through successive hits along a ray in a guaranteed front to back-sorted order, and without skip- ping any intersections even if they occur at the same distance. We describe multiple different ways of solving this problem within the constraints of the existing ray tracing pipeline, and evaluate the different realizations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_16697 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Ordered Front-to-back Any-Hit Traversal in RTX Wald, Ingo Graphics Computational Geometry We look at the problem of Ordered Front-To-Back Any-Hit Traversal (FTB); i.e., a traversal that iterates through successive hits along a ray in a guaranteed front to back-sorted order, and without skip- ping any intersections even if they occur at the same distance. We describe multiple different ways of solving this problem within the constraints of the existing ray tracing pipeline, and evaluate the different realizations. |
| title | Ordered Front-to-back Any-Hit Traversal in RTX |
| topic | Graphics Computational Geometry |
| url | https://arxiv.org/abs/2605.16697 |