Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k joints under the min-sum criteria with respect to L_1- and L_2-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem and fully polynomial-time approximation schemes for the general k-joint versions
AbstractWe present some ideas for a new algorithm for the LAD curve-fitting problem for n points in ...
We improve the time complexities for solving the polygonal curve approximation problems formulated b...
We present three variants of a polyline simplification algorithm. The basic algorithm uses a variabl...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statis...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statis...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in stati...
AbstractIn this paper, we study the problem of L1-fitting a shape to a set of n points in Rd (where ...
Abstract. In this paper we present a novel nonparametric method for simplifying piecewise linear cur...
Given a function y=f(x) in one variable, we consider the problem of computing a k-peaked curve y=φ(x...
In this paper two problems of fitting rectilinear polygonal curves to a set of points in the plane a...
We consider the problem of approximating a set P of n points in R d by a collection of j-dimensional...
We study discrete L_1, curve-fitting of n points in k dimensional space. Execution times for the alg...
This thesis addresses several problems in the facility location sub-area of computational geometry. ...
We present a new algorithm for the discrete LAD curve-fitting problem for n points in k < eq n dimen...
In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we...
AbstractWe present some ideas for a new algorithm for the LAD curve-fitting problem for n points in ...
We improve the time complexities for solving the polygonal curve approximation problems formulated b...
We present three variants of a polyline simplification algorithm. The basic algorithm uses a variabl...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statis...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statis...
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in stati...
AbstractIn this paper, we study the problem of L1-fitting a shape to a set of n points in Rd (where ...
Abstract. In this paper we present a novel nonparametric method for simplifying piecewise linear cur...
Given a function y=f(x) in one variable, we consider the problem of computing a k-peaked curve y=φ(x...
In this paper two problems of fitting rectilinear polygonal curves to a set of points in the plane a...
We consider the problem of approximating a set P of n points in R d by a collection of j-dimensional...
We study discrete L_1, curve-fitting of n points in k dimensional space. Execution times for the alg...
This thesis addresses several problems in the facility location sub-area of computational geometry. ...
We present a new algorithm for the discrete LAD curve-fitting problem for n points in k < eq n dimen...
In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we...
AbstractWe present some ideas for a new algorithm for the LAD curve-fitting problem for n points in ...
We improve the time complexities for solving the polygonal curve approximation problems formulated b...
We present three variants of a polyline simplification algorithm. The basic algorithm uses a variabl...