no code implementations • 27 Sep 2023 • Igor Potapov, Jason Ralph, Theofilos Triommatis
More formally, we define the following maximum cover problem: "Given a convex polygon $P$ and a Field Of View (FOV) with a given centre and inner angle $\phi$; find the direction (an angle of rotation $\theta$) of the FOV such that the intersection between the FOV and $P$ has the maximum area".
