add_answer bbox_contains_span bbox_contains_stbox bbox_contains_tbox bbox_expand_span bbox_expand_stbox bbox_expand_tbox bbox_overlaps_span bbox_overlaps_stbox bbox_overlaps_tbox box_area box_largest_axis get_axis_length get_axis_span get_axis_stbox get_axis_tbox is_power_of_two node_box_calculate node_choose node_choose_least_enlargement node_free node_insert node_make node_move_box_at_index_into node_qsort node_search node_sort_axis node_split node_swap rtree_create rtree_create_bigintspan rtree_create_datespan rtree_create_floatspan rtree_create_intspan rtree_create_stbox rtree_create_tbox rtree_create_tstzspan rtree_free rtree_insert rtree_search unioned_area

node_choose() static int node_choose ( const RTree *  rtree, const void *  box, const RTreeNode *  node  ) static Returns the best child node for inserting a new bounding box in an RTree. The function determines the most suitable child node within a node for inserting a new bounding box. It first checks if the new box can be added to any child node without requiring the expansion of its bounding box. If none of the child nodes can accommodate the new bounding box without expansion, the function falls back to selecting the node that requires the least enlargement. Parameters [in] rtree Pointer to the RTree structure, providing access to the overall RTree configuration [in] box Pointer to the bounding box that is being inserted [in] node Pointer to the node containing the child nodes Returns The index of the chosen child node for insertion