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_split() static void node_split ( RTree *  rtree, RTreeNode *  node, void *  box, RTreeNode **  right_out  ) static Splits an RTree node and redistributes its bounding boxes between two nodes. The function splits an RTree node into two nodes by distributing the bounding boxes based on the axis with the largest length. The bounding boxes are moved to either the original node or a new right node, depending on their position relative to the splitting axis. After the initial split, the function ensures that both nodes have at least a minimum number of bounding boxes by redistributing the bounding boxes if necessary. If the node is a branch node, it also sorts both nodes by the first axis. Parameters [in] rtree Pointer to the RTree structure, which provides methods for retrieving axis values and determining dimensions [in] node Pointer to the node to be split [in] box Pointer to the bounding box used to guide the split [out] right_out Pointer to a pointer where the new RTreeNode (right node) will be stored