将求线段的交点转化为求直线的交点,判断直线的交点是否在线段之间即可。
#include <iostream>
#include <algorithm>
using namespace std;
struct segment //线段
{
double x1, y1; //起点坐标
double x2, y2; //终点坐标
}s[110];
double k[110], b[110]; //斜率,截距(y=kx+b)
int main()
{
int N;
double x; //交点横坐标
double x1, y1, x2, y2;
while (cin >> N)
{
if (N == 0)
break;
for (int i = 0; i < N; i++)
{
cin >> x1 >> y1 >> x2 >> y2;
if (x1 > x2) //保证(x1,y1)为线段起点(左端点)
{
swap(x1, x2);
swap(y1, y2);
}
s[i].x1 = x1; s[i].y1 = y1;
s[i].x2 = x2; s[i].y2 = y2;
k[i] = (s[i].y1 - s[i].y2) / (s[i].x1 - s[i].x2);
b[i] = s[i].y1 - k[i] * s[i].x1;
}
int total = 0; //总交点数
for (int i = 0; i < N; i++)
{
for (int j = i + 1; j < N; j++)
{
if (k[i] != k[j]) //两条线段斜率不同,其直线必有交点
{
x = (b[j] - b[i]) / (k[i] - k[j]); //交点横坐标
//判断交点是否在线段之间
if (x >= s[i].x1 && x <= s[i].x2 && x >= s[j].x1 && x <= s[j].x2)
++total;
}
}
}
cout << total << endl;
}
return 0;
}
继续加油。