该博客主要分析了如何解决POJ 1410问题，即判断线段是否与矩形相交。内容包括线段与矩形相交的两种情况分析：线段与矩形边相交或线段完全在矩形内。还强调了需要对矩形的顶点进行排序，以确保正确判断。
Intersection
Description
You are to write a program that has to decide whether a given line segment intersects a given rectangle.
An example:
line: start point: (4,9)
end point: (11,2)
rectangle: left-top: (1,5)
right-bottom: (7,1)
Figure 1: Line segment does not intersect rectangle
The line is said to intersect the rectangle if the line and the rectangle have at least one point in common. The rectangle consists of four straight lines and the area in between. Although all input values are integer numbers, valid intersection points do not have to lay on the integer grid.
An example:
line: start point: (4,9)
end point: (11,2)
rectangle: left-top: (1,5)
right-bottom: (7,1)
Figure 1: Line segment does not intersect rectangle
The line is said to intersect the rectangle if the line and the rectangle have at least one point in common. The rectangle consists of four straight lines and the area in between. Although all input values are integer numbers, valid intersection points do not have to lay on the integer grid.
Input
The input consists of n test cases. The first line of the input file contains the number n. Each following line contains one test case of the format:
xstart ystart xend yend xleft ytop xright ybottom
where (xstart, ystart) is the start and (
xstart ystart xend yend xleft ytop xright ybottom
where (xstart, ystart) is the start and (
最低0.47元/天 解锁文章
扫一扫
1000
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
