Quadtrees (Pt II), K-D Trees, BSP Trees, AABBs vs OBBs
Channel:
Subscribers:
2,700
Published on ● Video Link: https://www.youtube.com/watch?v=Ff_fYdFb3Ds
You can skip forward if you want to pass over some debugging, but it's kind of an interesting exercise debugging a data structure, so it might be worth watching.
The second half of class we talk about two refinements of quadtrees, the k-d tree and the binary space partition.
Review of AABBs (axis-aligned bounding boxes) and OBBs (oriented bounding boxes).
Other Videos By Bill Kerney
2022-05-06 | Automation and the Chip Shortage |
2022-05-04 | C++ Trivia Quiz |
2022-05-04 | Threads II: Atomics, Mutexes, Thread-Specific Variables |
2022-05-04 | Binary Representations + Digital Ownership |
2022-05-02 | C++ Threads in 11 minutes |
2022-05-02 | Consciousness |
2022-04-29 | Tries Part II, Huffman Coding |
2022-04-29 | Python in 50 minutes |
2022-04-27 | Tries |
2022-04-27 | Set Theory: Different Sized Infinities; Brief intro to Python |
2022-04-26 | Quadtrees (Pt II), K-D Trees, BSP Trees, AABBs vs OBBs |
2022-04-25 | Composite Data Structures |
2022-04-25 | Symbolism and Semantics |
2022-04-23 | Shapes (Linear Algebra review), Bitwise Operations Part II, Vim Macros |
2022-04-22 | Sea Shanty Workshop |
2022-04-21 | Operator() and [], Writing Tests, Bitwise Operations |
2022-04-20 | Set Theory Part I |
2022-04-19 | Quadtrees in 30 minutes |
2022-04-18 | Inheritance Part VI, Constexpr, Inline |
2022-04-18 | Corporate Censorship + Qualifiers |
2022-04-08 | Inheritance Part V; Heaps |
Tags:
is50b
axis-aligned bounding box
quadtree
debugging
k-d tree