rect_tree_ring_contains_point()

static int rect_tree_ring_contains_point ( RECT_NODE *  node, const POINT2D *  pt, int *  on_boundary  )

static

Definition at line 314 of file lwtree.c.

{
        /* Only test nodes that straddle our stabline vertically */
        /* and might be to the right horizontally */
        if (node->ymin <= pt->y && pt->y <= node->ymax && pt->x <= node->xmax)
        {
                if (rect_node_is_leaf(node))
                {
                        return rect_leaf_node_segment_side(&node->l, pt, on_boundary);
                }
                else
                {
                        int i, r = 0;
                        for (i = 0; i < node->i.num_nodes; i++)
                        {
                                r += rect_tree_ring_contains_point(node->i.nodes[i], pt, on_boundary);
                        }
                        return r;
                }
        }
        return 0;
}

References rect_node::i, rect_node::l, RECT_NODE_INTERNAL::nodes, RECT_NODE_INTERNAL::num_nodes, r, rect_leaf_node_segment_side(), rect_node_is_leaf(), POINT2D::x, rect_node::xmax, POINT2D::y, rect_node::ymax, and rect_node::ymin.

Referenced by rect_tree_area_contains_point().

Here is the call graph for this function:

Here is the caller graph for this function: