关于圆与圆的交点问题,因为求交点的算法比较多,最近在做关于三点定位的项目,搜了好多圆与圆交的程序,好多都是错误的,输入坐标输出的结果不对。要么就是考虑的不全面因此决定自己写一个关于圆与圆求交点的程序,第一次写完整的程序,有很多不规范的地方,希望有不对的地方多加指正!(关于求解算法,能看懂的就不用我多写,看不懂的话可以进一步交流)
public Point[] CircleInsect(Circle A, Circle B, Point[] points)
{
double x1 = A.Center.X;
double y1 = A.Center.Y;
double r1 = A.Radius;
double x2 = B.Center.X;
double y2 = B.Center.Y;
double r2 = B.Radius;
double Dis = distance(A.Center, B.Center); // 圆心距离
if (double_equals(x1, x2) && double_equals(y1, y2) && (double_equals(r1, r2))) // 两圆重合
{
Console.WriteLine("The two circles are the same");
}
if ((Dis > r1 + r2) || Dis < Math.Abs(r1 - r2)) // 两圆相离或者内含
{
Console.WriteLine("The two circles have no intersection");
}
if (double_equals(Dis, r1 + r2) || double_equals(Dis, Math.Abs(r1 - r2))) // 两圆有一个交点(即两圆相切[内切和外切])
{
if (double_equals(Dis, r1 + r2))// 外切
{
if (double_equals(x1, x2) && !double_equals(y1, y2))
{
if (y1 > y2)
{
points[0].X = x1 = x2;
points[0].Y = y1 - r1;
}
else
{
points[0].X = x1 = x2;
points[0].Y = y1 + r1;
}
}
else if (!double_equals(x1, x2) && double_equals(y1, y2))
{
if (x1 > x2)
{
points[0].X = x1 - r1;
points[0].Y = y1 = y2;
}
else
{
points[0].X = x1 + r1;
points[0].Y = y1 = y2;
}
}
else if (!double_equals(x1, x2) && !double_equals(y1, y2))
{
// 外切情况,两圆的交点在圆心AB连线上
double k1 = (y2 - y1) / (x2 - x1);
double k2 = -1 / k1;
points[0].X = x1 + (x2 - x1) * r1 / Dis;
//points[0].Y=y1+k2*(points[0].X-x1);
points[0].Y = y1 + (y2 - y1) * r1 / Dis;
}
}
else if (double_equals(Dis, Math.Abs(r1 - r2))) // 内切 (是否要考虑A包含B 还是B包含A,对结果是否有影响)
{
if (double_equals(x1, x2) && !double_equals(y1, y2))
{
if (r1 > r2) // A内含B
{
if (y1 > y2)
{
points[0].X = x1 = x2;
points[0].Y = y1 - r1;
}
else
{
points[0].X = x1 = x2;
points[0].Y = y1 + r1;
}
}
else // B 内含A
{
if (y1 > y2)
{
points[0].X = x1 = x2;
points[0].Y = y1 + r1;
}
else
{
points[0].X = x1 = x2;
points[0].Y = y1 - r1;
}
}
}
else if (!double_equals(x1, x2) && double_equals(y1, y2))
{
if (r1 > r2)
{
if (x1 > x2)
{
points[0].X = x1 - r1;
points[0].Y = y1 = y2;
}
else
{
points[0].X = x1 + r1;
points[0].Y = y1 = y2;
}
}
else
{
if (x1 > x2)
{
points[0].X = x1 + r1;
points[0].Y = y1 = y2;
}
else
{
points[0].X = x1 - r1;
points[0].Y = y1 = y2;
}
}
}
else if (!double_equals(x1, x2) && !double_equals(y1, y2)) // 是否要考虑内含关系(求坐标时是否有影响)
{
// 内切情况,交点在AB连线的延长线上,要考虑切点的位置
double k1 = (y2 - y1) / (x2 - x1);
double k2 = -1 / k1;
points[0].X = x1 + (x1 - x2) * r1 / Dis;
//points[0].Y = y1 + k2 * (points[0].X - x1);
points[0].Y = y1 + (y1 - y2) * r1 / Dis;
}
}
}
if ((Dis < r1 + r2) && Dis > Math.Abs(r1 - r2)) // 两圆有两个交点(内交或者外交) 【内交与外交的情况是否一样?】
{
if (double_equals(x1, x2) && !double_equals(y1, y2)) // 圆A和圆B 横坐标相等
{
double x0 = x1 = x2;
double y0 = y1 + (y2 - y1) * (r1 * r1 - r2 * r2 + Dis * Dis) / (2 * Dis * Dis);
double Dis1 = Math.Sqrt(r1 * r1 - (x0 - x1) * (x0 - x1) - (y0 - y1) * (y0 - y1));
points[0].X = x0 - Dis1;
points[0].Y = y0;
points[1].X = x0 + Dis1;
points[1].Y = y0;
}
else if (!double_equals(x1, x2) && double_equals(y1, y2)) // 圆A和圆B 纵坐标相等
{
double y0 = y1 = y2;
double x0 = x1 + (x2 - x1) * (r1 * r1 - r2 * r2 + Dis * Dis) / (2 * Dis * Dis);
double Dis1 = Math.Sqrt(r1 * r1 - (x0 - x1) * (x0 - x1) - (y0 - y1) * (y0 - y1));
points[0].X = x0;
points[0].Y = y0 - Dis1;
points[1].X = x0;
points[1].Y = y0 + Dis1;
}
else if (!double_equals(x1, x2) && !double_equals(y1, y2)) // 横纵坐标都不等
{
double k1 = (y2 - y1) / (x2 - x1);//AB的斜率
double k2 = -1 / k1; // CD的斜率
double x0 = x1 + (x2 - x1) * (r1 * r1 - r2 * r2 + Dis * Dis) / (2 * Dis * Dis);
double y0 = y1 + k1 * (x0 - x1);
double Dis1 = r1 * r1 - (x0 - x1) * (x0 - x1) - (y0 - y1) * (y0 - y1); //CE的平方
double Dis2 = Math.Sqrt(Dis1 / (1 + k2 * k2));//EF的长,过C作过E点水平直线的垂线,交于F点
points[0].X = x0 - Dis2;
points[0].Y = y0 + k2 * (points[0].X - x0);
points[1].X = x0 + Dis2;
points[1].Y = y0 + k2 * (points[1].X - x0);
}
}
return points;
}
}