Algorithmintro
BVH traversal
Also called bounding volume hierarchy traversal.
Descends a BVH and tests children with slab tests to find hits.
Descends a BVH and tests children with slab tests to find hits.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 2KJ4A7 Edit this page History Report an error