ABSTRACT. We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite compactly supported measure µ, with µ(Rd)> 0 for p ≥ 1 and λ> 0 we consider the functional E(γ) = Rd d(x,Γγ) pdµ(x) + λLength(γ) where γ: I → Rd, I is an interval in R, Γγ = γ(I), and d(x,Γγ) is the distance of x to Γγ. The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure H1, 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 µ supported in two dimensions the minimizing curve is inje...
Hausdorff- und Fréchet-Abstand sind häufig genutzte Ähnlichkeitsmaße. Für Kurven, insbesondere Polyg...
In this survey, we present some recent results on the problem about the regularity of length-minimiz...
We present a simple and practical (1+e)-approximation algorithm for the Fréchet distance between two...
ABSTRACT. We consider approximating a measure by a parameterized curve subject to length penalizatio...
<p>We consider approximating a measure by a parameterized curve subject to length penalization. That...
<p>The average-distance problem is to find the best way to approximate (or represent) a given measur...
The average-distance problem, in the penalized formulation, involves minimizing; (1) Eλµ(Σ):= d(x,Σ)...
The average-distance problem, in the penalized formulation, involves minimizing; Eλµ(Σ):= inf y∈Σ |x...
Given a function y=f(x) in one variable, we consider the problem of computing a k-peaked curve y=φ(x...
\u3cp\u3eDue to its many applications, curve simplification is a long-studied problem in computation...
International audienceWe prove some regularity results for a connected set S in the planar domain O,...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
In this paper we consider the classical min--\# curve simplification problem in three different vari...
\u3cp\u3e The Fréchet distance is a popular...
Due to its many applications, curve simplification is a long-studied problem in computational geomet...
Hausdorff- und Fréchet-Abstand sind häufig genutzte Ähnlichkeitsmaße. Für Kurven, insbesondere Polyg...
In this survey, we present some recent results on the problem about the regularity of length-minimiz...
We present a simple and practical (1+e)-approximation algorithm for the Fréchet distance between two...
ABSTRACT. We consider approximating a measure by a parameterized curve subject to length penalizatio...
<p>We consider approximating a measure by a parameterized curve subject to length penalization. That...
<p>The average-distance problem is to find the best way to approximate (or represent) a given measur...
The average-distance problem, in the penalized formulation, involves minimizing; (1) Eλµ(Σ):= d(x,Σ)...
The average-distance problem, in the penalized formulation, involves minimizing; Eλµ(Σ):= inf y∈Σ |x...
Given a function y=f(x) in one variable, we consider the problem of computing a k-peaked curve y=φ(x...
\u3cp\u3eDue to its many applications, curve simplification is a long-studied problem in computation...
International audienceWe prove some regularity results for a connected set S in the planar domain O,...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
In this paper we consider the classical min--\# curve simplification problem in three different vari...
\u3cp\u3e The Fréchet distance is a popular...
Due to its many applications, curve simplification is a long-studied problem in computational geomet...
Hausdorff- und Fréchet-Abstand sind häufig genutzte Ähnlichkeitsmaße. Für Kurven, insbesondere Polyg...
In this survey, we present some recent results on the problem about the regularity of length-minimiz...
We present a simple and practical (1+e)-approximation algorithm for the Fréchet distance between two...