Related papers: Efficient modified Jacobi-Bernstein basis transfor…
In this paper, we give an efficient algorithm of degree reduction of B\'ezier curves with box constraints. The idea is to combine the previous iterative approach, that has been presented recently in (P. Gospodarczyk, Comput. Aided Des. 62…
This paper deals with the problem of multi-degree reduction of a composite B\'ezier curve with the parametric continuity constraints at the endpoints of the segments. We present a novel method which is based on the idea of using constrained…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
In this paper, we propose a linear method for $C^{(r,s)}$ approximation of rational B\'{e}zier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the problem be converted to an approximation between two…
We present a new approach to the problem of $G^{k,l}$-constrained ($k,l \leq 3$) multi-degree reduction of B\'{e}zier curves with respect to the least squares norm. First, to minimize the least squares error, we consider two methods of…
This paper deals with the merging problem of segments of a composite B\'ezier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P.…
In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…
In this paper, we use the blending functions of Bernstein polynomials with shifted knots for construction of Bezier curves and surfaces. We study the nature of degree elevation and degree reduction for Bezier Bernstein functions with…
It is well-known that a $d$-dimensional polynomial B\'{e}zier curve of degree $n$ can be subdivided into two segments using the famous de Casteljau algorithm in $O(dn^2)$ time. Can this problem be solved more efficiently? In this paper, we…
The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$,…
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
In this paper, we propose a method to obtain a constrained approximation of a rational B\'{e}zier curve by a polynomial B\'{e}zier curve. This problem is reformulated as an approximation problem between two polynomial B\'{e}zier curves…
Real world experiments are expensive, and thus it is important to reach a target in minimum number of experiments. Experimental processes often involve control variables that changes over time. Such problems can be formulated as a…
We derive a variational model to fit a composite B\'ezier curve to a set of data points on a Riemannian manifold. The resulting curve is obtained in such a way that its mean squared acceleration is minimal in addition to remaining close the…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
We introduce here a generalization of the modified Bernstein polynomials for Jacobi weights using the $q$-Bernstein basis proposed by G.M. Phillips to generalize classical Bernstein Polynomials. The function is evaluated at points which are…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
How to quickly and stably realize the degree reduction of the rational Bezier curve is an open problem in CAGD. Based on the weighted least squares method and weighted sum method of multi-objective optimization, this paper transforms the…
In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index $\alpha \in {\left(-\infty \, , \, 0 \right)}\cup {\left(1 \, , \,…