rect_tree_intersects_tree()

int rect_tree_intersects_tree	(	RECT_NODE *	n1,
		RECT_NODE *	n2
	)

Test if two RECT_NODE trees intersect one another.

Definition at line 990 of file lwtree.c.

{
        /*
        * It is possible for an area to intersect another object
        * without any edges intersecting, if the object is fully contained.
        * If that is so, then any point in the object will be contained,
        * so we do a quick point-in-poly test first for those cases
        */
        if (rect_tree_is_area(n1) &&
                rect_tree_contains_point(n1, rect_tree_get_point(n2)))
        {
                return LW_TRUE;
        }
 
        if (rect_tree_is_area(n2) &&
                rect_tree_contains_point(n2, rect_tree_get_point(n1)))
        {
                return LW_TRUE;
        }
 
        /*
        * Not contained, so intersection can only happen if
        * edges actually intersect.
        */
        return rect_tree_intersects_tree_recursive(n1, n2);
}

References LW_TRUE, rect_tree_contains_point(), rect_tree_get_point(), rect_tree_intersects_tree_recursive(), and rect_tree_is_area().

Referenced by tree_inter().

Here is the call graph for this function:

Here is the caller graph for this function: