calculates residual, Hessian and Hessian-block neede for re-substituting depth.

Helper accessor to the dataset points:

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

applies step to linearization point.

Frees the previously-built index. Automatically called within buildIndex(). */

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

call on finish */

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