AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find precise conditions under which this is possible. It turns out that this is, indeed, possible when one fits circles but not ellipses or hyperbolas
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
This paper presents a robust and accurate technique for an estimation of the best-fit ellipse going ...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the le...
We consider least-squares approximation of a function of one variable by a continuous, piecewise-lin...
We propose a linear-time algorithm for Curve segmentation which is based on constructive polynomial ...
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithm...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
Fitting circles and ellipses to given points in the plane is a problem that arises in many applicati...
In this paper, we present a constructive method for fitting both an explicit and an implicit curve o...
AbstractWe introduce the following problem which is motivated by applications in vision and pattern ...
This paper presents a new method of curve-fitting to a set of noisy samples. In the case of fitting ...
We consider the task of reconstructing a curve in constant dimensional space from noisy data. We con...
We study discrete L_1, curve-fitting of n points in k dimensional space. Execution times for the alg...
AbstractThis article is concerned with the approximation problem of fitting n data points by a quasi...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
This paper presents a robust and accurate technique for an estimation of the best-fit ellipse going ...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
AbstractWe study a popular algorithm for fitting polynomial curves to scattered data based on the le...
We consider least-squares approximation of a function of one variable by a continuous, piecewise-lin...
We propose a linear-time algorithm for Curve segmentation which is based on constructive polynomial ...
This work presents a new efficient method for fitting ellipses to scattered data. Previous algorithm...
Abstract. Given a large set of irregularly spaced points in the plane, an algorithm for partitioning...
Fitting circles and ellipses to given points in the plane is a problem that arises in many applicati...
In this paper, we present a constructive method for fitting both an explicit and an implicit curve o...
AbstractWe introduce the following problem which is motivated by applications in vision and pattern ...
This paper presents a new method of curve-fitting to a set of noisy samples. In the case of fitting ...
We consider the task of reconstructing a curve in constant dimensional space from noisy data. We con...
We study discrete L_1, curve-fitting of n points in k dimensional space. Execution times for the alg...
AbstractThis article is concerned with the approximation problem of fitting n data points by a quasi...
Journal ArticleAn algebraic curve is defined as the zero set of a polynomial in two variables. Alge...
This paper presents a robust and accurate technique for an estimation of the best-fit ellipse going ...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
DOI
Add to ORKG