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_least_enlargement() static int node_choose_least_enlargement ( const RTree *  rtree, const RTreeNode *  node, const void *  box  ) static Return the child node that requires the least enlargement to accommodate a new bounding box. The function iterates through the child nodes of a given node to determine which child node's bounding box would need the least enlargement to include a new bounding box. The function calculates the area of each node's bounding box before and after union with the new bounding box and selects the one with the smallest area increase. Parameters [in] node Pointer to the node containing the child nodes [in] box Pointer to the bounding box that is being inserted or considered [in] rtree Pointer to the RTree structure, which provides the method for calculating areas Returns The index of the child node that requires the least enlargement