题解：Transmitters（几何，叉积）

最新推荐文章于 2020-03-01 23:08:45 发布

嘘......

最新推荐文章于 2020-03-01 23:08:45 发布

阅读量261

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/98954224

版权

该问题探讨无线网络中多个使用相同频率的发射器如何避免信号重叠。通过限制发射器的覆盖范围，特别是使用半圆形覆盖的屏蔽发射器，可以实现信号不冲突。给定一个位于1000平方米网格上的发射器，计算在旋转一定角度后，其半圆形覆盖区域内能同时达到的最大点数。输入包含发射器坐标、半径以及网格上的多个点坐标，目标是找到最大覆盖点数。

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

In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don’t overlap, or at least that they don’t conflict. One way of accomplishing this is to restrict a transmitter’s coverage area. This problem uses a shielded transmitter that only broadcasts in a semicircle.
transmitter T is located somewhere on a 1,000 square meter grid. It broadcasts in a semicircular area of radius r. The transmitter may be rotated any amount, but not moved. Given N points anywhere on the grid, compute the maximum number of points that can be simultaneously reached by the transmitter’s signal. Figure 1 shows the same data points with two different transmitter rotations.
input coordinates are integers (0-1000). The radius is a positive real number greater than 0. Points on the boundary of a semicircle are considered within that semicircle. There are 1-150 unique points to examine per transmitter. No points are at the same location as