Optimal Design of Sensors via Geometric Criteria

We consider a convex set Omega and look for the optimal convex sensor omega subset of Omega of a given measure that minimizes the maximal distance to the points of Omega. This problem can be written as follows [GRAPHICS] . where c is an element of (0, |Omega|), d(H) being the Hausdorff distance. We show that the parametrization via the support functions allows us to formulate the geometric optimal shape design problem as an analytic one. By proving a judicious equivalence result, the shape optimization problem is approximated by a simpler minimization problem of a quadratic function under linear constraints. We then present some numerical results and qualitative properties of the optimal sensors and exhibit an unexpected symmetry breaking phenomenon.