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

Loads a previous index from a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so the index object must be const

sets linearization point.

operator[]

* Subdivide the list of points by a plane perpendicular on axe corresponding * to the 'cutfeat' dimension at 'cutval' position. * * On ret

Usage: * Called once for each tracked frame, with the real-time, low-delay frame pose. * * Calling: * Always calle

Usage: * Called once after each new Keyframe is inserted & optimized. * [connectivity] contains for each frame-frame pair the numb

Usage: * Called after each new Keyframe is inserted & optimized, with all keyframes that were part of the active window during * tha

called once after a new keyframe is created, with the color-coded, forward-warped inverse depthmap for that keyframe, * which is used for ini

Usage: * Called once for each new frame, before it is tracked (i.e., it doesn't have a pose yet). * * Calling: * A

Query for the \a num_closest closest points to a given point (entered as query_point[0:dim-1]). * Note that this is a short-cut method for index-

* Find all the neighbors to \a query_point[0:dim-1] within a maximum radius. * The output is given as a vector of pairs, of which the first elemen

check range (may be private because it is static)

call on reset */

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so when loading the index object it must

Clears the result set and adjusts the search radius. */