A bounding volume hierarchy traversal visits only nodes whose ancestors passed a conservative enclosure test. It can use depth-first search; its time complexity depends on how many nodes pass, not just the height of a binary tree.
// Target: optics.bigb

Ancestors (8)

  1. Bounding volume hierarchy
  2. Bounding volume
  3. Computer aided geometric design
  4. Numerical analysis
  5. Analysis
  6. Area of mathematics
  7. Mathematics
  8. Home

Incoming links (2)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version