A k-d tree is a spatial partitioning data structure used to organize points in k-dimensional space.

learn more… | top users | synonyms

0
votes
1answer
40 views

Why do KD trees put the median split exactly on a point?

I've understood that KD tree split points using the median while cycling on each axis. I've also understood that at each node traversal, a nearest search must use a sphere to store to nearest neighbor ...
7
votes
2answers
2k views

Fully dynamic KD-Tree vs. Quadtree?

Working on my game, I'm at the point where I need to track all of the units in the world so that I can do nearest-neighbor checks for combat. This is an RTS-like game, with potentially thousands of ...
1
vote
2answers
135 views

Checking which object cause most gravitational force

I'm work on a proof-of-concept space-engine, and one of it's tasks is to find the object with the greatest Sphere Of Influence towards the player - that is the mass of the object divided by the sqrt(...
5
votes
3answers
2k views

Scene graphs and spatial partitioning structures: What do you really need?

I've been fiddling with 2D games for awhile and I'm trying to go into 3D game development. I thought I should get my basics right first. From what I read scene graphs hold your game objects/entities ...
11
votes
1answer
1k views

What is the kd tree intersection logic?

I'm trying to figure out how to implement a KD tree. On page 322 of "Real time collision detection" by Ericson The text section is included below in case Google book preview doesn't let you see it ...