Results 241 to 250 of about 7,027,170 (294)

Algorithm for degree reduction of B-spline curves

CAD Computer Aided Design, 1995
This paper presents -- in continuation of the authors' previous work on degree elevation [ibid. 19, No. 9, 485-498 (1987; Zbl 0655.65012)] -- an algorithm for degree reduction of a given \(B\)-spline-curve. The three main steps of the new algorithm are: Decomposition of the given \(B\)- spline into Bézier pieces; degree reduction of each Bézier piece ...
Les A. Piegl, Wayne Tiller
exaly   +3 more sources

Degree reduction of Bézier curves

CAD Computer Aided Design, 1988
Degree reduction of Bézier curves and surfaces is a process that amounts to approximating a polynomial of degree n by one of degree ...
Watkins, M. A., Worsey, A. J.
exaly   +2 more sources

Degree reduction of NURBS curves

The International Journal of Advanced Manufacturing Technology, 2005
Higher degree curves are used in applications because they are easier to manipulate interactively but require heavy computation. Most of the equations for curves used popularly in CAD software are of degree 2 and 3, because two curves of degree 3 can guarantee 2nd derivative continuity at the connection point.
Yuan-Lung Lai, James Shih-Shyn Wu, Jui-Pin Hung, Jian-Hong Chen   +3 more
openaire   +2 more sources

Least squares degree reduction of Bézier curves

CAD Computer Aided Design, 1995
Abstract In this paper we investigate the problem of reducing the degree of Bezier curves approximately from n to a prescribed target degree m whereby (parametric) continuity of any order ≤ m−1 2 can be preserved at the two endpoints. The computations are carried out by minimizing the (constrained) L2-norm between the two curves. In addition,
exaly   +2 more sources

Degree reduction and multiple degree reduction for the DP curves

2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2008
DP curve is a recent representation of the polynomial curves, proposed by Delgado and Pena in 2003. This curve has been claimed for its normalized totally positive (NTP) property and requires only the linear time computation. These properties indicate the shape preservation and the efficiency of evaluating the points on DP curves.
Kan Itsariyawanich, Natasha Dejdumrong
openaire   +1 more source

Degree reduction of Bézier simplexes

Computer-Aided Design, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suresh K. Lodha, Joe D. Warren
openaire   +2 more sources

Degree reduction of interval Bézier curves

Computer-Aided Design, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Falai Chen, Wenping Lou
openaire   +2 more sources

Multiple degree elevation and constrained multiple degree reduction for DP curves and surfaces [PDF]

Computers and Mathematics With Applications, 2011
In this paper, the problem of single and multiple degree elevation and reduction for DP curves and surfaces is considered and expressed in matrix representations. Using monomial matrix representations of the univariate DP polynomials, single and multiple
Natasha Dejdumrong
exaly   +2 more sources

On the embedding degree of reductions of an elliptic curve

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alina Carmen Cojocaru, Igor E. Shparlinski   +1 more
openaire   +3 more sources