2014-04-11 60 views
5

我有一个线段(x1,y1,x2,y2)与半径为r的圆相交。我怎样才能确定哪个交点最接近(x1,y1)?线段和圆交点

circle-line

+1

你能解释一下“最接近的交点”是什么意思?这是圆上的一个点吗?细分市场上的一个点?两件事都没有? – andand

+4

这是一个基本的数学问题,将解决方案转换为C#非常简单,并且不会使问题更具相关性。 –

+0

@andand相交点属于两条线。 – Dmitry

回答

7

要做到这一点首先找到与圆的交点,然后取最接近的一个线起点

所以检查这个代码

// CX,CY为中心圆的点

 public PointF ClosestIntersection(float cx, float cy, float radius, 
      PointF lineStart, PointF lineEnd) 
     { 
      PointF intersection1; 
      PointF intersection2; 
     int intersections = FindLineCircleIntersections(cx, cy, radius, lineStart, lineEnd, out intersection1, out intersection2); 

     if (intersections == 1) 
      return intersection1;//one intersection 

     if (intersections == 2) 
     { 
      double dist1 = Distance(intersection1, lineStart); 
      double dist2 = Distance(intersection2, lineStart); 

      if (dist1 < dist2) 
       return intersection1; 
      else 
       return intersection2; 
     } 

     return PointF.Empty;// no intersections at all 
    } 

    private double Distance(PointF p1, PointF p2) 
    { 
     return Math.Sqrt(Math.Pow(p2.X - p1.X, 2) + Math.Pow(p2.Y - p1.Y, 2)); 
    } 

    // Find the points of intersection. 
    private int FindLineCircleIntersections(float cx, float cy, float radius, 
     PointF point1, PointF point2, out PointF intersection1, out PointF intersection2) 
    { 
     float dx, dy, A, B, C, det, t; 

     dx = point2.X - point1.X; 
     dy = point2.Y - point1.Y; 

     A = dx * dx + dy * dy; 
     B = 2 * (dx * (point1.X - cx) + dy * (point1.Y - cy)); 
     C = (point1.X - cx) * (point1.X - cx) + (point1.Y - cy) * (point1.Y - cy) - radius * radius; 

     det = B * B - 4 * A * C; 
     if ((A <= 0.0000001) || (det < 0)) 
     { 
      // No real solutions. 
      intersection1 = new PointF(float.NaN, float.NaN); 
      intersection2 = new PointF(float.NaN, float.NaN); 
      return 0; 
     } 
     else if (det == 0) 
     { 
      // One solution. 
      t = -B/(2 * A); 
      intersection1 = new PointF(point1.X + t * dx, point1.Y + t * dy); 
      intersection2 = new PointF(float.NaN, float.NaN); 
      return 1; 
     } 
     else 
     { 
      // Two solutions. 
      t = (float)((-B + Math.Sqrt(det))/(2 * A)); 
      intersection1 = new PointF(point1.X + t * dx, point1.Y + t * dy); 
      t = (float)((-B - Math.Sqrt(det))/(2 * A)); 
      intersection2 = new PointF(point1.X + t * dx, point1.Y + t * dy); 
      return 2; 
     } 
    } 

路口代码的形式在这里LINK

+1

距离的顺序不会被sqrt改变,因此最好让它们平方以获得更好的速度。 – Preza8