Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T12:09:58.069Z Has data issue: false hasContentIssue false

On convex sets that minimize the averagedistance

Published online by Cambridge University Press:  16 January 2012

Antoine Lemenant
Affiliation:
UniversitéParis Diderot – Paris 7, U.F.R de Mathématiques, Site Chevaleret, Case 7012, 75205 Paris Cedex 13, France. lemenant@ann.jussieu.fr
Edoardo Mainini
Affiliation:
Dipartimento di Matematica ‘F. Casorati’, Universià degli Studi di Pavia, via Ferrata 1, 27100 Pavia, Italy; edoardo.mainini@unipv.it

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we study the compact and convex setsK ⊆ Ω ⊆ ℝ2 that minimize

\begin{equation*} \int_{\Omega} \dist(\x,K) \,{\rm d}\x +\lambda_1 {\rm Vol}(K)+\lambda_2 {\rm Per}(K) \end{equation*}
for some constants λ1 andλ2, that could possibly be zero. We compute in particularthe second order derivative of the functional and use it to exclude smooth points ofpositive curvature for the problem with volume constraint. The problem with perimeterconstraint behaves differently since polygons are never minimizers. Finally using a purelygeometrical argument from Tilli [J. Convex Anal. 17 (2010)583–595] we can prove that any arbitrary convex set can be a minimizer when both perimeterand volume constraints are considered.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2012