POJ 1269 Intersecting Lines(直线相交判断,求交点)
来源:互联网 发布:淘宝 安能小包发货 编辑:程序博客网 时间:2024/05/22 13:23
Intersecting Lines
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15911 Accepted: 6904
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.
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
题意:给出两条直线,判断相交情况
思路:模板
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<cstring>#include<string>#include<algorithm>using namespace std;#define ll long long#define ms(a,b)memset(a,b,sizeof(a))#define eps 1e-10double add(double a,double b){ if(abs(a+b)<eps*(abs(a)+abs(b))) return 0; return a+b;}struct P{ double x,y; P(){} P(double x,double y): x(x),y(y){} P operator + (P p) { return P(add(x,p.x),add(y,p.y)); } P operator - (P p) { return P(add(x,-p.x),add(y,-p.y)); } P operator *(double d) { return P(x*d,y*d); } double dot (P p) { return add(x*p.x,y*p.y); } double det(P p) { return add(x*p.y,-y*p.x); }};bool on_seg(P p1,P p2,P q){ return (p1-q).det(p2-q)==0;}P intersection(P p1,P p2,P q1,P q2){ return p1+(p2-p1)*((q2-q1).det(q1-p1)/(q2-q1).det(p2-p1));}void is(P p1,P p2,P q1,P q2) //直线p1,q1与直线p2,q2的相交情况{ if((p1-q1).det(p2-q2)==0) { if(on_seg(p1,q1,p2)||on_seg(p1,q1,q2)||on_seg(p2,q2,p1)||on_seg(p2,q2,q1)) { cout<<"LINE"<<endl; } else cout<<"NONE"<<endl; } else { P r=intersection(p1,q1,p2,q2); cout<<"POINT "; printf("%.2lf %.2lf\n",r.x,r.y); }}int main(){ P p1,p2,p3,p4; int n; cin>>n; cout<<"INTERSECTING LINES OUTPUT"<<endl; while(n--) { P p1,p2,p3,p4; cin>>p1.x>>p1.y>>p2.x>>p2.y>>p3.x>>p3.y>>p4.x>>p4.y; is(p1,p3,p2,p4); } cout<<"END OF OUTPUT"<<endl; return 0;}
阅读全文
0 0
- POJ 1269 Intersecting Lines(直线相交判断,求交点)
- poj 1269 Intersecting Lines(判断直线相交 求交点)
- POJ 1269 Intersecting Lines(直线相交判断,求交点)
- poj 1269 Intersecting Lines(直线相交判断,求相交交点)
- poj 1269Intersecting Lines (直线相交判断,求相交交点)
- POJ 1269 Intersecting Lines 判断直线关系(相交(求交点),重合,平行)
- Intersecting Lines(直线相交判断,求相交交点)
- poj 1269 Intersecting Lines(判断线段相交,并求交点)
- POJ 1269 Intersecting Lines(直线相交?平行?重合?,求交点)
- poj 1269 Intersecting Lines (求直线交点)
- POJ 1269 Intersecting Lines 判断直线相交
- POJ 1269Intersecting Lines 直线相交判断
- 判断两条直线 共线或 平行 或相交 求交点 叉乘的应用 poj 1269 Intersecting Lines
- Poj 1269 Intersecting Lines (直线交点)
- POJ 1269 Intersecting Lines(判断直线相交)
- POJ 1269 Intersecting Lines(直线相交的判断)
- poj 1269 Intersecting Lines 计算几何 直线求交点
- POJ 1269 Intersecting Lines 求两直线交点
- Playgrounds配件Parrot Education的深入发掘(一)
- LeetCode_linked-list-cycle-ii
- mysql语法
- 二分搜索——在有序数组中找到目标函数出来的最左端的位置
- 学习记录:接口功能配置之 Settings及QuickSettings
- POJ 1269 Intersecting Lines(直线相交判断,求交点)
- 111. Minimum Depth of Binary Tree
- Dubbo源码阅读之 客户端远程调用
- webpack
- 多数据速率变换中的插值和抽取
- hibernate主键生成策略---【小白系列】0基础到熟练应用hibernate框架(七)
- linux学习笔记之SSH协议与远程登录工具
- spark源码之Job执行(2)任务调度taskscheduler
- mysql主从同步原理,配置,同步延迟处理