In this paper we compute the Hausdorff distance between sets of continuous curves and sets of piecewise constant or linear discretizations. These sets are Sobolev balls given by the continuous or discrete L p-norm of the derivatives. We detail the suitable discretization or smoothing procedure which are preservative in the sense of these norms. Finally we exhibit the link between Eulerian numbers and the uniformly space knots B-spline used for smoothing
Due to its many applications, curve simplification is a long-studied problem in computational geomet...
We consider the problem of simplifying curves under the Fréchet distance. Let P be a curve and ε ≥ 0...
In this paper we consider sequences of best approximation. We first examine the rho best approximati...
In this paper we compute the Hausdorff distance between sets of continuous curves and sets of piecew...
International audienceWe derive results on equivalence of piecewise polynomial approximations of a g...
In this paper we show that the complexity, i.e., the number of elements, of a parabolic or conic spl...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
International audienceIn this paper, we propose an algorithm that, from a maximum error and a digita...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
AbstractWe present in this paper an approximation method of curves from sets of Lagrangian data and ...
In this paper we deal with the task of uniformly approximating an L-bi-Lipschitz curve by means of p...
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve...
Data and function approximation is fundamental in application domains like path planning or signal p...
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewis...
Due to its many applications, curve simplification is a long-studied problem in computational geomet...
We consider the problem of simplifying curves under the Fréchet distance. Let P be a curve and ε ≥ 0...
In this paper we consider sequences of best approximation. We first examine the rho best approximati...
In this paper we compute the Hausdorff distance between sets of continuous curves and sets of piecew...
International audienceWe derive results on equivalence of piecewise polynomial approximations of a g...
In this paper we show that the complexity, i.e., the number of elements, of a parabolic or conic spl...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
International audienceIn this paper, we propose an algorithm that, from a maximum error and a digita...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
AbstractWe present in this paper an approximation method of curves from sets of Lagrangian data and ...
In this paper we deal with the task of uniformly approximating an L-bi-Lipschitz curve by means of p...
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve...
Data and function approximation is fundamental in application domains like path planning or signal p...
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewis...
Due to its many applications, curve simplification is a long-studied problem in computational geomet...
We consider the problem of simplifying curves under the Fréchet distance. Let P be a curve and ε ≥ 0...
In this paper we consider sequences of best approximation. We first examine the rho best approximati...