A Dynamic BVH (Bounding Volume Hierarchy) using incremental refit and tree-rotations
-
Updated
May 16, 2021 - Go
A Dynamic BVH (Bounding Volume Hierarchy) using incremental refit and tree-rotations
Programa voltado ao ensino-aprendizagem de balanceamento de árvores binárias.
Generic Self-Balancing AVL Tree implementation in C# (.NET 10) supporting dynamic rotations (LL, RR, LR, RL), balanced insertions, deletions, BFS traversal, and 2D console visualization.
To associate your repository with the tree-rotations topic, visit your repo's landing page and select "manage topics."