HDU 5130（计算几何+圆与多边形相交)

最新推荐文章于 2021-09-01 15:32:26 发布

wust_cyl

最新推荐文章于 2021-09-01 15:32:26 发布

阅读量823

点赞数

分类专栏：计算几何文章标签： HDU 5130

本文链接：https://blog.csdn.net/wust_cyl/article/details/77855583

版权

该问题描述了两个国家A-Land和B-Land之间的战争，其中A-Land建立了一个无线电塔A。为了干扰A-Land的通信，B-Land计划建立另一个无线电塔B。如果点P到B的距离不超过P到A的0.2到0.8倍，那么点P无法从A接收到清晰信号。任务是计算A-Land领土中受B-Land干扰的区域面积。输入包含多边形的顶点数、比例k以及每个顶点的坐标，最后给出A和B的坐标。输出要求精确到10^-6。解决方案涉及找到临界点并计算多边形与圆相交的面积。

摘要由CSDN通过智能技术生成

问题描述:

Two countries A-Land and B-Land are at war. The territory of A-Land is a simple polygon with no more than 500 vertices. For military use, A-Land constructed a radio tower (also written as A), and it's so powerful that the whole country was under its signal. To interfere A-Land's communication, B-Land decided to build another radio tower (also written as B). According to an accurate estimation, for any point P, if the euclidean distance between P and B is no more than k (0.2 ≤ k < 0.8) times of the distance between P and A, then point P is not able to receive clear signals from A, i.e. be interfered. Your task is to calculate the area in A-Land's territory that are under B-Land's interference.

Input

There are no more than 100 test cases in the input.

In each test case, firstly you are given a positive integer N indicating the amount of vertices on A-Land's territory, and an above mentioned real number k, which is rounded to 4 digits after the decimal point.

Then N lines follow. Each line contains two integers x and y (|x|, |y| ≤ 1000), indicating a vertex's coordinate on A's territory, in counterclockwise or clockwise order.

The last two lines of a test case give radio tower A and B's coordinates in the same form as vertexes