QuadTree - Unreal Engine - C++

Quadtree Implementation is a project developed using C++ and Unreal Engine to efficiently manage and query spatial data in a 2D space. This project focuses on creating a dynamic quadtree structure to handle particle systems, optimizing performance for collision detection and spatial queries.
Core Functionality:
Implemented a quadtree data structure to partition a 2D space.
Efficient insertion, deletion, and querying of points.
Performance measurement with and without quadtree optimization.
Key Features:
Particle System: Simulated particle movements and interactions using quadtree optimization.
Dynamic Subdivision: Adaptive quadtree that subdivides based on the density of points.
Real-time Visualization: Debug visualizations to show quadtree partitions and queried points.
Performance Metrics: Measured and compared performance impacts of quadtree usage.
Repo: github.com/kha...
Portfolio: khaledelsayedzakaria.com
Email: [e-mail]
GitHub: github.com/khaled71612000
LinkedIn: linkedin.com/in/khaledelsayeddev

[@kartikpaliwal5657]

Nice 👍
Tho I didn't get anything 😅

[@KhaledZakariaGameDev]

Hahaha, one day I'll make a presentation for these showcases and stop being lazy!
On min 01:15 , you can see the red dots are trying to connect (create a black line) to the closest neighboring particle based on a specified threshold.
Normally, to see the closest cell, you would need to iterate over all the particles in the game. However, you can implement a quadtree that breaks the map into quads and you can retrieve the quad your particle exists in and just compare it to other particles in the same quad which will improve the performance by around 70%. :D