点到线段最短距离的算法

 

double computer(CPoint p1,CPoint p2,CPoint p0)

{

       double S;//S表示面积

       double distance1,distance2,distance3,distance;

    double sdis1,sdis2,sdis3;//距离平方

       double retValue ,temp;

       sdis1 = (p1.x-p0.x)*(p1.x-p0.x) + (p1.y-p0.y)*(p1.y-p0.y);

       sdis2 = (p2.x-p0.x)*(p2.x-p0.x) + (p2.y-p0.y)*(p2.y-p0.y);

       sdis3 = (p2.x-p1.x)*(p2.x-p1.x) + (p2.y-p1.y)*(p2.y-p1.y);

       distance1 = sqrt( sdis1 );//p1和p0之间的距离

       distance2 = sqrt( sdis2 );//p2和p0之间的距离

    distance3 = sqrt( sdis3 );//p2和p1之间的距离

 

       if( (distance1+distance2) == distance3 )//在线段内部

              distance= 0;

       else if( (distance1+distance3) == distance2 )//在p2p1的延长线上

              distance= distance1 ;

       else if( (distance2+distance3) == distance1 )//在p1p2的延长线上

              distance= distance2 ;

       else if( (sdis1+sdis3) < sdis2 )

        distance= distance1 ;

    else if( (sdis2+sdis3) < sdis1 )

        distance= distance2 ;      

       else

       {

               temp = (distance1 + distance2 +distance3)/2;

         S = sqrt(temp*(temp-distance1)*(temp-distance2)*(temp-distance3));

         distance= (2 * S) / distance3;

       }

    return distance;

      

}

浮点数比较按理是不应该用＝＝的，不过似乎没出错，所以就将就了。