I got an idea: in the moment entities like pickups are bruteforcing the player list to check for collisions
13:59
so I thought it might make sense to organize the players in a kd tree
13:59
the problem is players move and the tree needs to updated after each position update
14:00
but what if we organize all pickups in kdtrees and let the players check for collisions? We could get rid of the update tick on at least all of the pickups
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g....
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data a...
I have been looking for a quadtree/quadtree node implementation on the net for ages. There is some basic stuff but nothing that I would be able to really use it a game.
My purpose is to store obje...
1
1
4
2
