itree_point_in_multipolygon()

IntervalTreeResult itree_point_in_multipolygon	(	const IntervalTree *	itree,
		const LWPOINT *	point
	)

Definition at line 461 of file intervaltree.c.

{
        uint32_t i = 0;
        const POINT2D *pt;
        IntervalTreeResult result = ITREE_OUTSIDE;
 
        /* Empty is not within anything */
        if (lwpoint_is_empty(point))
                return ITREE_OUTSIDE;
 
        /* Non-finite point is within anything */
        pt = getPoint2d_cp(point->point, 0);
        if (!pt || !(isfinite(pt->x) && isfinite(pt->y)))
                return ITREE_OUTSIDE;
 
        /* Is the point inside any of the exterior rings of the sub-polygons? */
        for (uint32_t p = 0; p < itree->numPolys; p++)
        {
                uint32_t ringCount = itree->ringCounts[p];
 
                /* Skip empty polygons */
                if (ringCount == 0) continue;
 
                /* Check result against exterior ring. */
                result = itree_point_in_ring(itree, i, pt);
 
                /* Boundary condition is a hard stop */
                if (result == ITREE_BOUNDARY)
                        return ITREE_BOUNDARY;
 
                /* We are inside an exterior ring! Are we outside all the holes? */
                if (result == ITREE_INSIDE)
                {
                        for(uint32_t r = 1; r < itree->ringCounts[p]; r++)
                        {
                                result = itree_point_in_ring(itree, i+r, pt);
 
                                /* Boundary condition is a hard stop */
                                if (result == ITREE_BOUNDARY)
                                        return ITREE_BOUNDARY;
 
                                /*
                                 * Inside a hole => Outside the polygon!
                                 * But there might be other polygons lurking
                                 * inside this hole so we have to continue
                                 * and check all the exterior rings.
                                 */
                                if (result == ITREE_INSIDE)
                                        goto holes_done;
                        }
                        return ITREE_INSIDE;
                }
 
                holes_done:
                        /* Move to first ring of next polygon */
                        i += ringCount;
        }
 
        /* Not in any rings */
        return ITREE_OUTSIDE;
}

References getPoint2d_cp(), ITREE_BOUNDARY, ITREE_INSIDE, ITREE_OUTSIDE, itree_point_in_ring(), lwpoint_is_empty(), IntervalTree::numPolys, LWPOINT::point, r, result, IntervalTree::ringCounts, POINT2D::x, and POINT2D::y.

Referenced by itree_pip_contains(), itree_pip_covers(), itree_pip_intersects(), ST_IntersectsIntervalTree(), and test_itree_once().

Here is the call graph for this function:

Here is the caller graph for this function: