add_answer box_area box_unioned_area get_axis_length get_axis_stbox is_power_of_two node_box_calculate node_choose node_choose_least_enlargement node_free node_insert node_move_box_at_index_into node_new node_qsort node_search node_sort_axis node_split node_swap rtree_create rtree_create_stbox rtree_free rtree_insert rtree_search rtree_set_dims rtree_set_functions stbox_largest_axis

node_search() void node_search ( const RTreeNode *  node, const STBox *  query, int **  ids, int *  count  ) Searches recursively a node looking for hits with a query. Parameters [in] node The node to be searched [in] query The STBox that serves as query [in] ids The array with the list of answers. [in] count Total of elements found