rect_tree_intersects_tree_recursive()

static int rect_tree_intersects_tree_recursive ( RECT_NODE *  n1, RECT_NODE *  n2  )

static

Definition at line 936 of file lwtree.c.

{
        int i, j;
#if POSTGIS_DEBUG_LEVEL >= 4
        char *n1_str = rect_node_to_str(n1);
        char *n2_str = rect_node_to_str(n2);
        LWDEBUGF(4,"n1 %s  n2 %s", n1_str, n2_str);
        lwfree(n1_str);
        lwfree(n2_str);
#endif
        /* There can only be an edge intersection if the rectangles overlap */
        if (rect_node_intersects(n1, n2))
        {
                LWDEBUG(4," interaction found");
                /* We can only test for a true intersection if the nodes are both leaf nodes */
                if (rect_node_is_leaf(n1) && rect_node_is_leaf(n2))
                {
                        LWDEBUG(4,"  leaf node test");
                        /* Check for true intersection */
                        return rect_leaf_node_intersects(&n1->l, &n2->l);
                }
                else if (rect_node_is_leaf(n2) && !rect_node_is_leaf(n1))
                {
                        for (i = 0; i < n1->i.num_nodes; i++)
                        {
                                if (rect_tree_intersects_tree_recursive(n1->i.nodes[i], n2))
                                        return LW_TRUE;
                        }
                }
                else if (rect_node_is_leaf(n1) && !rect_node_is_leaf(n2))
                {
                        for (i = 0; i < n2->i.num_nodes; i++)
                        {
                                if (rect_tree_intersects_tree_recursive(n2->i.nodes[i], n1))
                                        return LW_TRUE;
                        }
                }
                else
                {
                        for (j = 0; j < n1->i.num_nodes; j++)
                        {
                                for (i = 0; i < n2->i.num_nodes; i++)
                                {
                                        if (rect_tree_intersects_tree_recursive(n2->i.nodes[i], n1->i.nodes[j]))
                                                return LW_TRUE;
                                }
                        }
                }
        }
        return LW_FALSE;
}

References rect_node::i, rect_node::l, LW_FALSE, LW_TRUE, LWDEBUG, LWDEBUGF, lwfree(), RECT_NODE_INTERNAL::nodes, RECT_NODE_INTERNAL::num_nodes, rect_leaf_node_intersects(), rect_node_intersects(), rect_node_is_leaf(), and rect_tree_intersects_tree_recursive().

Referenced by rect_tree_intersects_tree(), and rect_tree_intersects_tree_recursive().

Here is the call graph for this function:

Here is the caller graph for this function: