itree_point_in_ring()

static IntervalTreeResult itree_point_in_ring ( const IntervalTree *  itree, uint32_t  ringNumber, const POINT2D *  pt  )

static

Definition at line 435 of file intervaltree.c.

{
        int winding_number = 0;
        const IntervalTreeNode *node = itree->indexes[ringNumber];
        const POINTARRAY *pa = itree->indexArrays[ringNumber];
        IntervalTreeResult rslt = itree_point_in_ring_recursive(node, pa, pt, &winding_number);
 
        /* Boundary case is separate from winding number */
        if (rslt == ITREE_BOUNDARY) return rslt;
 
        /* Not boundary, so evaluate winding number */
        if (winding_number == 0)
                return ITREE_OUTSIDE;
        else
                return ITREE_INSIDE;
}

References IntervalTree::indexArrays, IntervalTree::indexes, ITREE_BOUNDARY, ITREE_INSIDE, ITREE_OUTSIDE, and itree_point_in_ring_recursive().

Referenced by itree_point_in_multipolygon().

Here is the call graph for this function:

Here is the caller graph for this function: