Creates multiple empty trees to handle dynamic support */

Make sure the auxiliary list \a vind has the same size than the current * dataset, and re-generate if size has changed. */

//////////////////////// Child node functions ////////////////////////

! tests if box is finite and non-empty*/

! waits until the given thread has terminated */

Must return the number of data points

* Find the "num_closest" nearest neighbors to the \a query_point[0:dim-1]. * Their indices are stored inside the result object. \sa radiusSearch,