.png){kind=icon}
.png){kind=icon}
Return
The Maximum Cover for Passive Localisation
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-04731-1_18.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 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. In this paper, we provide the theoretical foundation for the analysis of the maximum cover with a rotating field of view. Since the optimal solution is a real number, we develop an algorithm that approximates the direction of the field of view, with precision epsilon, and complexity O(n(logn+(log epsilon)/phi)).
Keywords:
Computational Geometry
Area Optimisation
Rotated Field Of View
Maximum Cover
Journal
D
IF:
0
Papers:
27
Citations:
0