Bounding Volume Hierarchy

Course: CS350 (Space Partitioning)
Used Tech: Self-made Native C++ and OpenGL engine.

This is a project I did for my CS350 class (Space Partitioning) at Digipen Bilbao. It showcases different methods to build a Dynamic Bounding Volume Hierarchy.(BVH) The shown methods are:

  • Top Down: Root node is calculated first and then divided until individual BV are reached.
  • Bottom Up: Individual BV are the leaf nodes and then are merged trying to create the smaller bounding volume possible after the addition.
  • Insertion: Objects are inserted to the tree one by one placing them on the tree to make it grow as little as possible. Not as optimal but faster for moving objects in static environments.

Leave a Reply

Your email address will not be published. Required fields are marked *