直线交点问题(例题:POJ1269)

该博客讨论了如何计算两条直线的交点,包括如何判断两条直线的交点类型:相交、相离或重合。通过叉积判断是否相交,并提供了计算交点坐标的方法。此外,还介绍了如何确定两条直线是否共线,即所有点共线的情况。最后,给出了程序实现的思路和参考代码。
摘要由CSDN通过智能技术生成

求直线交点

求直线交点模板,详见刘汝佳紫书。

// 判断有无交点,看Cross(v,w),为0则没有交点。
Point GetLineIntersection(Point P,Vector v,Point Q,vector w) {
   
	vector u = P-Q;
	double t = Cross(w,u) / Cross(v,w);
	return P+v*t;
}

Intersecting Lines

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 19879 Accepted: 8407

Description

We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect in a line because they are on top of one another (i.e. they are the same line), 3) intersect in a point. In this problem you will use your algebraic knowledge to create a program that determines how and where two lines intersect.
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.

Input

The first line contains an integer N between 1 and 10 describing how many pairs of lines are represented. The next N lines will each contain eight integers. These integers represent the coordinates of four points on the plane in the order x1y1x2y2x3y3x4y4. Thus each of these input lines represents two lines on the plane: the line through (x1,y1) and (x2,y2) and the line through (x3,y3) and (x4,y4). The point (x1,y1) is always distinct from (x2,y2). Likewise with (x3,y3) and (x4,y4).

Output

There should be N+2 lines of output. The first line of output should read INTERSECTING LINES OUTPUT. There will then be one line of output for each pair of planar lines represented by a line of input, describing how the lines intersect: none, line, or point. If the intersection is a point then your program should output the x and y coordinates of the point, correct to two decimal places. The final line of output should read “END OF OUTPUT”.

Sample Input

5
0 0 4 4 0 4 4 0
5 0 7 6 1 0 2 3
5 0 7 6 3 -6 4 -3
2 0 2 27 1 5 18 5
0 3 4 0 1 2 2 5

Sample Output

INTERSECTING LINES OUTPUT
POINT 2.00 2.00
NONE
LINE
POINT 2.00 5.00
POINT 1.07 2.20
END OF OUTPUT

Source

POJ1269

分析

判断两个直线是相交、相离、重合。
先判断是否相交,用叉积判断,计算Cross(v,w),若不为0则相交。
如果相交,直接套模板计算交点。
不相交,判断是相离还是重合,假设一开始输入的四个点为p1,p2,p3,p4。
判断p1,p2,p3共线,p1,p2,p4共线,如果都共线就说明两直线共线。
判断3个点共线,如p1,p2,p3可以计算(p2-p1)和(p3-p1)的叉积,如果为0则说明(p2-p1)和(p3-p1)平行,又因为有一个点共点,所以(p2-p1)和(p3-p1)共线即p1,p2,p3共线。

参考代码


                
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值