lw_dist2d_line_curvepoly()

int lw_dist2d_line_curvepoly	(	LWLINE *	line,
		LWCURVEPOLY *	poly,
		DISTPTS *	dl
	)

Definition at line 796 of file measures.c.

References DIST_MIN, DISTPTS::distance, getPoint2d_cp(), lw_dist2d_recursive(), LW_FALSE, LW_OUTSIDE, LW_TRUE, lwgeom_contains_point(), DISTPTS::mode, LWCURVEPOLY::nrings, DISTPTS::p1, DISTPTS::p2, LWLINE::points, LWCURVEPOLY::rings, DISTPTS::tolerance, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_circstring_curvepoly(), lw_dist2d_circstring_poly(), and lw_dist2d_distribute_bruteforce().

{
        const POINT2D *pt = getPoint2d_cp(line->points, 0);
        int i;

        if ( lwgeom_contains_point(poly->rings[0], pt) == LW_OUTSIDE )
        {
                return lw_dist2d_recursive((LWGEOM*)line, poly->rings[0], dl);
        }

        for ( i = 1; i < poly->nrings; i++ )
        {
                if ( ! lw_dist2d_recursive((LWGEOM*)line, poly->rings[i], dl) )
                        return LW_FALSE;

                if ( dl->distance<=dl->tolerance && dl->mode == DIST_MIN )
                        return LW_TRUE;
        }

        for ( i=1; i < poly->nrings; i++ )
        {
                if ( lwgeom_contains_point(poly->rings[i],pt) != LW_OUTSIDE )
                {
                        /* Its inside a hole, then the actual */
                        return LW_TRUE;
                }
        }

        if (dl->mode == DIST_MIN)
        {
                dl->distance = 0.0;
                dl->p1.x = dl->p2.x = pt->x;
                dl->p1.y = dl->p2.y = pt->y;
        }

        return LW_TRUE; /* Not in hole, so inside polygon */
}

Here is the call graph for this function:

Here is the caller graph for this function: