博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 1269 Intersecting Lines(直线相交判断,求交点)
阅读量:6494 次
发布时间:2019-06-24

本文共 3767 字,大约阅读时间需要 12 分钟。

Intersecting Lines
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 8342   Accepted: 3789

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

50 0 4 4 0 4 4 05 0 7 6 1 0 2 35 0 7 6 3 -6 4 -32 0 2 27 1 5 18 50 3 4 0 1 2 2 5

Sample Output

INTERSECTING LINES OUTPUTPOINT 2.00 2.00NONELINEPOINT 2.00 5.00POINT 1.07 2.20END OF OUTPUT

Source

 
 
 
 
 
 
 
 
给出两条直线,判断直线是相交,平行,还是重合。
 
/************************************************************ * Author        : kuangbin * Email         : kuangbin2009@126.com  * Last modified : 2013-07-14 08:54 * Filename      : POJ1269IntersectingLines.cpp * Description   :  * *********************************************************/#include 
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;const double eps = 1e-8;int sgn(double x){ if(fabs(x) < eps)return 0; if(x < 0)return -1; else return 1;}struct Point{ double x,y; Point(){} Point(double _x,double _y) { x = _x;y = _y; } Point operator -(const Point &b)const { return Point(x - b.x,y - b.y); } double operator ^(const Point &b)const { return x*b.y - y*b.x; } double operator *(const Point &b)const { return x*b.x + y*b.y; }};struct Line{ Point s,e; Line(){} Line(Point _s,Point _e) { s = _s;e = _e; } pair
operator &(const Line &b)const { Point res = s; if(sgn((s-e)^(b.s-b.e)) == 0) { if(sgn((b.s-s)^(b.e-s)) == 0) return make_pair(res,0);//两直线重合 else return make_pair(res,1);//两直线平行 } double t = ((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e)); res.x += (e.x - s.x)*t; res.y += (e.y - s.y)*t; return make_pair(res,2);//有交点 }};int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int T; scanf("%d",&T); double x1,y1,x2,y2,x3,y3,x4,y4; printf("INTERSECTING LINES OUTPUT\n"); while(T--) { scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4); Line line1 = Line(Point(x1,y1),Point(x2,y2)); Line line2 = Line(Point(x3,y3),Point(x4,y4)); pair
ans = line1 & line2; if( ans.second == 2)printf("POINT %.2lf %.2lf\n",ans.first.x,ans.first.y); else if(ans.second == 0)printf("LINE\n"); else printf("NONE\n"); } printf("END OF OUTPUT\n"); return 0;}

 

 
 
 
 
 
 
 
 
 
 
 
 

转载地址:http://xpkyo.baihongyu.com/

你可能感兴趣的文章
android应用开发--------------看RadioGroup源代码,写相似单选选项卡的集成控件(如底部导航,tab等等)...
查看>>
GCD 和延时调用
查看>>
LeetCode - Binary Tree Level Order Traversal
查看>>
FTP协议完全详解
查看>>
iOS:实现图片的无限轮播
查看>>
【C语言天天练(十五)】字符串输入函数fgets、gets和scanf
查看>>
【环境配置】配置sdk
查看>>
accept()
查看>>
USB 2.0 Hub IP Core
查看>>
USB 2.0 OTG IP Core
查看>>
解读浮动闭合最佳方案:clearfix
查看>>
Charles使用
查看>>
Python GUI编程(Tkinter) windows界面开发
查看>>
linux内核netfilter模块分析之:HOOKs点的注册及调用
查看>>
P(Y|X) 和 P(X,Y)
查看>>
gf框架之grpool - 高性能的goroutine池
查看>>
dynamic关键字的使用
查看>>
iOS 音乐播放器之锁屏效果+歌词解析
查看>>
【转】Google 的眼光
查看>>
android O 蓝牙设备默认名称更改
查看>>