poj 1269 Intersecting Lines(计算几何)
2016-11-03 11:28
351 查看
Intersecting Lines
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
Sample Output
Source
Mid-Atlantic 1996
题解
直接判断直线是否平行/相交(还要求交点)/共线就行
具体见代码
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 14807 | Accepted: 6528 |
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
Mid-Atlantic 1996
题解
直接判断直线是否平行/相交(还要求交点)/共线就行
具体见代码
相关文章推荐
- POJ1269(KB13-D 计算几何)
- POJ 1269 Intersecting Lines(计算几何)
- 【POJ】1269 Intersecting Lines(计算几何基础)
- POJ 1269(计算几何初步——简单处理解析几何,求直线交点)
- POJ1269——Intersecting Lines(计算几何,直线关系判断)
- POJ 1269 Intersecting Lines 简单计算几何
- poj 1269 Intersecting Lines 计算几何
- POJ 1269 Intersecting Lines(简单计算几何,判断直线的关系)
- 计算两直线的交点 poj 1269 我的第一道几何题
- [POJ1269]Intersecting Lines(计算几何-叉积)
- POJ_1269_Intersecting_Lines_(计算几何基础)
- poj 1269 Intersecting Lines -----计算几何
- poj 1269 Intersecting Lines(计算几何)
- POJ 1269(计算几何+直线相交)
- poj 1269 Intersecting Lines (计算几何)
- POJ 1269 Intersecting Lines(计算几何) (两线段位置)
- (计算几何step8.1.2.2)POJ 1269 Intersecting Lines(使用叉积来计算两条直线的交点)
- POJ 1269 Intersecting Lines 计算几何基础
- POJ 1269 Intersecing Lines <计算几何>
- POJ 1269 计算几何 题解