English

Average-distance problem for parameterized curves

Analysis of PDEs 2014-11-12 v1

Abstract

We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure μ\mu, for p1p \geq 1 and λ>0\lambda>0 we consider the functional E(γ)=Rdd(x,Γγ)pdμ(x)+λLength(γ) E(\gamma) = \int_{\mathbb{R}^d} d(x, \Gamma_\gamma)^p d\mu(x) + \lambda \,\textrm{Length}(\gamma) where γ:IRd\gamma:I \to \mathbb{R}^d, II is an interval in R\mathbb{R}, Γγ=γ(I)\Gamma_\gamma = \gamma(I), and d(x,Γγ)d(x, \Gamma_\gamma) is the distance of xx to Γγ\Gamma_\gamma. The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure H1\mathcal H^1, and to (regularized) principal curves studied in statistics. We obtain regularity of minimizers in the form of estimates on the total curvature of the minimizers. We prove that for measures μ\mu supported in two dimensions the minimizing curve is injective if p2p \geq 2 or if μ\mu has bounded density. This establishes that the minimization over parameterized curves is equivalent to minimizing over embedded curves and thus confirms that the problem has a geometric interpretation.

Keywords

Cite

@article{arxiv.1411.2673,
  title  = {Average-distance problem for parameterized curves},
  author = {Xin Yang Lu and Dejan Slepčev},
  journal= {arXiv preprint arXiv:1411.2673},
  year   = {2014}
}
R2 v1 2026-06-22T06:54:13.520Z