java线段是否相交_java-线段之间相交的问题

我有一个存储为点的路径,位于数组列表中,我想检查线段是否相交.由于某些未知原因,它不起作用!尽管我正在绘制相交的形状,但在LogCat中没有收到任何消息.了解是否有人可以看到我做错了什么或对如何改进代码提出建议.

// Intersection control

if(touchActionUp) {

// Loop throw all points except the last 3

for (int i = 0; i < points.size()-3; i++) {

Line line1 = new Line(points.get(i), points.get(i+1));

// Begin after the line above and check all points after that

for (int j = i + 2; j < points.size()-1; j++) {

Line line2 = new Line(points.get(j), points.get(j+1));

// Call method to check intersection

if(checkIntersection(line1, line2)) {

Log.i("Intersection", "Yes!");

}

}

}

}

和方法:

// Method to check for intersection between lines

private boolean interceptionControl(Line line1, Line line2) {

int x1 = line1.pointX1;

int x2 = line1.pointX2;

int x3 = line2.pointX1;

int x4 = line2.pointX2;

int y1 = line1.pointY1;

int y2 = line1.pointY2;

int y3 = line2.pointY1;

int y4 = line2.pointY2;

// Check if lines are parallel

int denom = (y4 - y3) * (x2 - x1) - (x4 - x3) * (y2 - y1);

if(denom == 0) { // Lines are parallel

// ??

}

double a = ((x4 - x3) * (y1 - y3) - (y4 - y3) * (x1 - x3)) / denom;

double b = ((x2 - x1) * (y1 - y3) - (y2 - y1) * (x1 - x3)) / denom;

// Check for intersection

if( a >= 0.0f && a <= 1.0f && b >= 0.0f && b <= 1.0f) {

return true;

}

return false;

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值