lw_dist2d_pt_pt()

int lw_dist2d_pt_pt	(	const POINT2D *	P,
		const POINT2D *	Q,
		DISTPTS *	dl
	)

Compares incoming points and stores the points closest to each other or most far away from each other depending on dl->mode (max or min)

Definition at line 2282 of file measures.c.

{
        double hside = thep2->x - thep1->x;
        double vside = thep2->y - thep1->y;
        double dist = sqrt ( hside*hside + vside*vside );
 
        if (((dl->distance - dist)*(dl->mode))>0) /*multiplication with mode to handle mindistance (mode=1)  and maxdistance (mode = (-1)*/
        {
                dl->distance = dist;
 
                if (dl->twisted>0)      /*To get the points in right order. twisted is updated between 1 and (-1) every time the order is changed earlier in the chain*/
                {
                        dl->p1 = *thep1;
                        dl->p2 = *thep2;
                }
                else
                {
                        dl->p1 = *thep2;
                        dl->p2 = *thep1;
                }
        }
        return LW_TRUE;
}

References DISTPTS::distance, LW_TRUE, DISTPTS::mode, DISTPTS::p1, DISTPTS::p2, DISTPTS::twisted, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_arc_arc(), lw_dist2d_point_point(), lw_dist2d_pre_seg_seg(), lw_dist2d_pt_arc(), lw_dist2d_pt_ptarray(), lw_dist2d_pt_ptarrayarc(), lw_dist2d_pt_seg(), lw_dist2d_ptarray_ptarray(), lw_dist2d_seg_arc(), rect_leaf_node_distance(), and rect_leaf_node_intersects().

Here is the caller graph for this function: