Degree reduction of S- curves using a genetic simulated annealing algorithm
Summary: The \(S-\lambda\) curves have become an important research subject in computer aided geometric design (CAGD), which owes to its good geometric properties (such as affine invariance, symmetry, and locality). This paper presents a new method to approximate an \(S-\lambda\) curve of degree \(n\) by using an \(S-\lambda\) curve of degree \(n-1\). We transform this degree reduction problem into the function optimization problem first, and then using a new genetic simulated annealing algorithm to determine the global optimal solution of the optimization problem. The method can be used to approximate \(S-\lambda\) curves with fixed or unconstrained endpoints. Examples are given to verify the effectiveness of the presented algorithm; and these numeric examples show that the algorithm is not only easy to implement, but also offers high precision, which makes it valuable in practical applications.
- A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations
- Application of Chebyshev II-Bernstein basis transformations to degree reduction of Bézier curves
- Approximation by operators of probabilistic type
- Approximation properties of Gamma operators
- Constrained approximation of rational Bézier curves based on a matrix expression of its end points continuity condition
- Constrained multi-degree reduction with respect to Jacobi norms
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Degree reduction of Bézier curves
- Developable Bézier-like surfaces with multiple shape parameters and its continuity conditions
- scientific article; zbMATH DE number 5283362 (Why is no real title available?)
- scientific article; zbMATH DE number 1055652 (Why is no real title available?)
- scientific article; zbMATH DE number 3996848 (Why is no real title available?)
- Modeling of free-form complex curves using SG-Bézier curves with constraints of geometric continuities
- On Stancu-Mühlbach operators and some connected problems concerning probability distributions
- On the rates of approximation of Bernstein type operators.
- Optimal multi-degree reduction of Bézier curves with \(G^2\)-continuity
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- Progressive iterative approximation and bases with the fastest convergence rates
- Some probabilistic methods in the theory of approximation operators
- The rational Bernstein bases and the multirational blossoms
- Univariate Discrete Distributions
- Urn models and B-splines
This page was built for publication: Degree reduction of \(S-\lambda\) curves using a genetic simulated annealing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333957)
