Does anyone know/have any good K-D Tree implementation in C++/Java? I tried searching the web for some. It seems that the C++ versions all use dynamic memory allocation (which is really slow compared to memory pool).