Quadtree Demo
Demonstrates a quadtree for spatial indexing of triangles
This C++ demo allows users to interactively explore a quadtree's behavior.
For this purpose the demo uses a quadtree data structure based on axis-aligned bounding boxes to speed up the search for triangles in a mesh. Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown.
Quadtree creation can be parametrized by three parameters:
- Maximum tree depth.
- Maximum number of triangles per region.
- Percentage...