rect_tree_distance_tree()

double rect_tree_distance_tree	(	RECT_NODE *	n1,
		RECT_NODE *	n2,
		double	threshold
	)

Return the distance between two RECT_NODE trees.

Definition at line 1354 of file lwtree.c.

{
        double distance;
        RECT_TREE_DISTANCE_STATE state;
 
        /*
        * 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 0.0;
        }
 
        if (rect_tree_is_area(n2) &&
                rect_tree_contains_point(n2, rect_tree_get_point(n1)))
        {
                return 0.0;
        }
 
        state.threshold = threshold;
        state.min_dist = FLT_MAX;
        state.max_dist = FLT_MAX;
        distance = rect_tree_distance_tree_recursive(n1, n2, &state);
        // *p1 = state.p1;
        // *p2 = state.p2;
        return distance;
}

References distance(), rect_tree_distance_state::max_dist, rect_tree_distance_state::min_dist, rect_tree_contains_point(), rect_tree_distance_tree_recursive(), rect_tree_get_point(), rect_tree_is_area(), and rect_tree_distance_state::threshold.

Referenced by ST_DistanceRectTree(), ST_DistanceRectTreeCached(), and test_rect_tree_distance_tree_case().

Here is the call graph for this function:

Here is the caller graph for this function: