rect_tree_contains_point()

int rect_tree_contains_point	(	RECT_NODE *	node,
		const POINT2D *	pt
	)

Definition at line 398 of file lwtree.c.

{
        int i, c;
 
        /* Object cannot contain point if bounds don't */
        if (!rect_node_bounds_point(node, pt))
                return 0;
 
        switch (node->geom_type)
        {
                case POLYGONTYPE:
                case CURVEPOLYTYPE:
                        return rect_tree_area_contains_point(node, pt) > 0;
 
                case MULTIPOLYGONTYPE:
                case MULTISURFACETYPE:
                case COLLECTIONTYPE:
                {
                        for (i = 0; i < node->i.num_nodes; i++)
                        {
                                c = rect_tree_contains_point(node->i.nodes[i], pt);
                                if (c) return LW_TRUE;
                        }
                        return LW_FALSE;
                }
 
                default:
                        return LW_FALSE;
        }
}

References COLLECTIONTYPE, CURVEPOLYTYPE, rect_node::geom_type, rect_node::i, LW_FALSE, LW_TRUE, MULTIPOLYGONTYPE, MULTISURFACETYPE, RECT_NODE_INTERNAL::nodes, RECT_NODE_INTERNAL::num_nodes, POLYGONTYPE, rect_node_bounds_point(), and rect_tree_area_contains_point().

Referenced by rect_tree_distance_tree(), rect_tree_intersects_tree(), and tree_pt().

Here is the call graph for this function:

Here is the caller graph for this function: