Hi, I checked your Quadtree code. It is a really good Quadtree design and implementation. I just found a simple bug in the code about the for loop indices. You are using 'i' instead of 'j' in the second for loop??
vnet\client\Quadtree.cpp - Line : 79
for (int i = 0; i < 3; i++)
{
for (int j = 0; i < 3; i++)
{
if ((*(*it))[j][i] < min_v[i])
min_v[i] = (*(*it))[j][i];
if ((*(*it))[j][i] > max_v[i])
max_v[i] = (*(*it))[j][i];
}
}
}