rect_tree_node_sort()

static void rect_tree_node_sort ( RECT_NODE *  n1, RECT_NODE *  n2  )

static

Definition at line 1248 of file lwtree.c.

{
        int i;
        RECT_NODE *n;
        POINT2D c1, c2, c;
        if (!rect_node_is_leaf(n1) && ! n1->i.sorted)
        {
                rect_node_to_p2d(n2, &c2);
                /* Distance of each child from center of other node */
                for (i = 0; i < n1->i.num_nodes; i++)
                {
                        n = n1->i.nodes[i];
                        rect_node_to_p2d(n, &c);
                        n->d = distance2d_sqr_pt_pt(&c2, &c);
                }
                /* Sort the children by distance */
                n1->i.sorted = 1;
                qsort(n1->i.nodes,
                         n1->i.num_nodes,
                         sizeof(RECT_NODE*),
                         rect_tree_node_sort_cmp);
        }
        if (!rect_node_is_leaf(n2) && ! n2->i.sorted)
        {
                rect_node_to_p2d(n1, &c1);
                /* Distance of each child from center of other node */
                for (i = 0; i < n2->i.num_nodes; i++)
                {
                        n = n2->i.nodes[i];
                        rect_node_to_p2d(n, &c);
                        n->d = distance2d_sqr_pt_pt(&c1, &c);
                }
                /* Sort the children by distance */
                n2->i.sorted = 1;
                qsort(n2->i.nodes,
                         n2->i.num_nodes,
                         sizeof(RECT_NODE*),
                         rect_tree_node_sort_cmp);
        }
}

References rect_node::d, distance2d_sqr_pt_pt(), rect_node::i, RECT_NODE_INTERNAL::nodes, RECT_NODE_INTERNAL::num_nodes, rect_node_is_leaf(), rect_node_to_p2d(), rect_tree_node_sort_cmp(), and RECT_NODE_INTERNAL::sorted.

Referenced by rect_tree_distance_tree_recursive().

Here is the call graph for this function:

Here is the caller graph for this function: