# The Maximum Cover with Rotating Field of View

arXiv: https://arxiv.org/abs/2309.15573 · HTML: https://mlsanity.com/paper/2309.15573/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 37 references that are in the map.
- First posted on arXiv 27 Sep 2023.

## Builds on (most cited first, 5 of 5)

- [Covering Polygons is Even Harder](https://mlsanity.com/paper/2106.02335/) (2021)
- [Approximating the Maximum Overlap of Polygons under Translation](https://mlsanity.com/paper/1406.5778/) (2014)
- [Capturing points with a rotating polygon (and a 3D extension)](https://mlsanity.com/paper/1805.02570/) (2018)
- [Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility](https://mlsanity.com/paper/2007.08368/) (2020)
- [A Geometric Approach to Passive Localisation](https://mlsanity.com/paper/2207.13396/) (2022)

## Abstract (arXiv)

Imagine a polygon-shaped platform P and only one static spotlight outside P; which direction should the spotlight face to light most of P? This problem occurs in maximising the visibility, as well as in limiting the uncertainty in localisation problems. 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 φ; find the direction (an angle of rotation θ) of the FOV such that the intersection between the FOV and P has the maximum area". In this paper, we provide the theoretical foundation for the analysis of the maximum cover with a rotating field of view. The main challenge is that the function of the area Aφ(θ), with the angle of rotation θ and the fixed inner angle φ, cannot be approximated directly. We found an alternative way to express it by various compositions of a function Aθ(φ) (with a restricted inner angle φ and a fixed direction θ). We show that Aθ(φ) has an analytical solution in the special case of a two-sector intersection and later provides a constrictive solution for the original problem. Since the optimal solution is a real number, we develop an algorithm that approximates the direction of the field of view, with precision varepsilon, and complexity O(n(logn+(logvarepsilon)/φ)).