lw_dist2d_point_curvepoly()

int lw_dist2d_point_curvepoly	(	LWPOINT *	point,
		LWCURVEPOLY *	poly,
		DISTPTS *	dl
	)

Definition at line 659 of file measures.c.

References DIST_MAX, DIST_MIN, DISTPTS::distance, getPoint2d_cp(), lw_dist2d_recursive(), LW_OUTSIDE, LW_TRUE, LWDEBUG, lwerror(), lwgeom_contains_point(), DISTPTS::mode, LWCURVEPOLY::nrings, DISTPTS::p1, DISTPTS::p2, LWPOINT::point, LWCURVEPOLY::rings, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_distribute_bruteforce().

{
        const POINT2D *p;
        int i;

        p = getPoint2d_cp(point->point, 0);

        if (dl->mode == DIST_MAX)
                lwerror("lw_dist2d_point_curvepoly cannot calculate max distance");

        /* Return distance to outer ring if not inside it */
        if ( lwgeom_contains_point(poly->rings[0], p) == LW_OUTSIDE )
        {
                return lw_dist2d_recursive((LWGEOM*)point, poly->rings[0], dl);
        }

        /*
         * Inside the outer ring.
         * Scan though each of the inner rings looking to
         * see if its inside.  If not, distance==0.
         * Otherwise, distance = pt to ring distance
         */
        for ( i = 1;  i < poly->nrings; i++)
        {
                /* Inside a hole. Distance = pt -> ring */
                if ( lwgeom_contains_point(poly->rings[i], p) != LW_OUTSIDE )
                {
                        LWDEBUG(3, " inside a hole");
                        return lw_dist2d_recursive((LWGEOM*)point, poly->rings[i], dl);
                }
        }

        LWDEBUG(3, " inside the polygon");
        if (dl->mode == DIST_MIN)
        {
                dl->distance = 0.0;
                dl->p1.x = dl->p2.x = p->x;
                dl->p1.y = dl->p2.y = p->y;
        }

        return LW_TRUE; /* Is inside the polygon */
}

Here is the call graph for this function:

Here is the caller graph for this function: