Geometric curve approximation

doi:10.1016/S0167-8396(96)00042-8

Computer Aided Geometric Design

Volume 14, Issue 6, August 1997, Pages 499-513

https://doi.org/10.1016/S0167-8396(96)00042-8 Get rights and content

Abstract

We present a new metric to measure the shape quality of curves. This metric is based upon the concept of total curvature. We then present a rational approximation scheme that minimizes a functional defined in terms of this metric.

References (10)

C. de Boor et al.
High accuracy geometric Hermite interpolation
Computer Aided Geometric Design
(1987)
W. Degen
High accuracy rational approximation of parametric curves
Computer Aided Geometric Design
(1993)
J. Hoschek
Spline approximation of offset curves
Computer Aided Geometric Design
(1988)
M. do Carmo
Differential Geometry of Curves and Surfaces
(1976)
G. Farin
Curves and Surfaces for Computer Aided Geometric Design
(1993)

There are more references available in the full text version of this article.

Cited by (14)

Curve and surface reconstruction from points: An approach based on self-organizing maps
2004, Applied Soft Computing Journal
Modeling of shapes for free form objects from point cloud is an emerging trend. Recognition of shape from the measured point data is a key step in the process of converting discrete data set into a piecewise smooth, continuous model. Shape recognition is to find the topological relation among the points, and in case of thick unorganized point cloud, the step requires both thinning and ordering. The present paper outlines a new approach based on growing self-organizing maps (GSOM) for piecewise linear reconstruction of curves and surfaces from unorganized thick point data. Inferences on selection of self-organizing map (SOM) algorithm parameters for this problem domain have been derived after extensive experimentation. A better quality measure to evaluate and compare various runs of SOM for the domain of curve and surface reconstruction has also been presented.
Bernstein-Bezoutian matrices
2004, Theoretical Computer Science
Several computational and structural properties of Bezoutian matrices expressed with respect to the Bernstein polynomial basis are shown. The exploitation of such properties allows the design of fast algorithms for the solution of Bernstein–Bezoutian linear systems without never making use of potentially ill-conditioned reductions to the monomial basis. In particular, we devise an algorithm for the computation of the greatest common divisor (GCD) of two polynomials in Bernstein form. A series of numerical tests are reported and discussed, which indicate that Bernstein–Bezoutian matrices are much less sensitive to perturbations of the coefficients of the input polynomials compared to other commonly used resultant matrices generated after having performed the explicit conversion between the Bernstein and the power basis.
The Stability Analysis of Linear Systems with Cauchy—Polynomial-Vandermonde Matrices
2023, Axioms
The new characterization of ruled surfaces corresponding dual Bézier curves
2022, Mathematical Methods in the Applied Sciences
Construction of General Linear System and Associated Polynomial Bezout Matrix
2020, Proceedings of 2020 IEEE International Conference on Power, Intelligent Computing and Systems, ICPICS 2020
Techniques for modeling a high-quality B-spline curves by S-polygons in a float format
2018, arXiv

View all citing articles on Scopus

View full text

Geometric curve approximation

Abstract

Computer Aided Geometric Design

Computer Aided Geometric Design

Computer Aided Geometric Design

Differential Geometry of Curves and Surfaces

Curves and Surfaces for Computer Aided Geometric Design