Quad Trees for Static Spatial Acceleration - Part 1
Offered By: javidx9 via YouTube
Course Description
Overview
Explore the implementation of a simple quad tree for efficient spatial partitioning and object searching in this 44-minute video tutorial. Learn about static spatial acceleration techniques, starting with an introductory example and progressing through the basic quad tree implementation. Discover the requirements, template structure, and essential functions like resize, clear, and search. Examine the use of recursion, address potential problems, and understand the concept of a static quad tree container. Gain insights into optimizing space partitioning for faster object searches, with source code available on GitHub for hands-on practice.
Syllabus
Intro
Example
Dynamic Quad Trees
Basic Quad Tree Implementation
Quad Tree Requirements
Quad Tree Template
Resize Function
Clear Function
Recursion
Search Function
Problems
Static Quad Tree Container
Summary
Taught by
javidx9
Related Courses
Creative Programming for Digital Media & Mobile AppsUniversity of London International Programmes via Coursera Online Games: Literature, New Media, and Narrative
Vanderbilt University via Coursera Game Design Concepts
Canvas Network General Game Playing
Stanford University via Coursera Program Arcade Games - Learn Computer Science
Independent