lw_dist2d_selected_seg_seg()

int lw_dist2d_selected_seg_seg	(	const POINT2D *	A,
		const POINT2D *	B,
		const POINT2D *	C,
		const POINT2D *	D,
		DISTPTS *	dl
	)

This is the same function as lw_dist2d_seg_seg but without any calculations to determine intersection since we already know they do not intersect.

Definition at line 2159 of file measures.c.

References lw_dist2d_pt_seg(), LW_FALSE, LWDEBUGF, DISTPTS::twisted, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_pre_seg_seg().

{
        LWDEBUGF(2, "lw_dist2d_selected_seg_seg [%g,%g]->[%g,%g] by [%g,%g]->[%g,%g]",
                 A->x,A->y,B->x,B->y, C->x,C->y, D->x, D->y);

        /*A and B are the same point */
        if (  ( A->x == B->x) && (A->y == B->y) )
        {
                return lw_dist2d_pt_seg(A,C,D,dl);
        }
        /*U and V are the same point */

        if (  ( C->x == D->x) && (C->y == D->y) )
        {
                dl->twisted= ((dl->twisted) * (-1));
                return lw_dist2d_pt_seg(D,A,B,dl);
        }

        if ((lw_dist2d_pt_seg(A,C,D,dl)) && (lw_dist2d_pt_seg(B,C,D,dl)))
        {
                dl->twisted= ((dl->twisted) * (-1));  /*here we change the order of inputted geometrys and that we  notice by changing sign on dl->twisted*/
                return ((lw_dist2d_pt_seg(C,A,B,dl)) && (lw_dist2d_pt_seg(D,A,B,dl))); /*if all is successful we return true*/
        }
        else
        {
                return LW_FALSE; /* if any of the calls to lw_dist2d_pt_seg goes wrong we return false*/
        }
}

Here is the call graph for this function:

Here is the caller graph for this function: