Lines Matching full:vorder
113 * for max(uorder,vorder) points is needed in the
119 GLuint dim, GLuint uorder, GLuint vorder)
121 GLfloat *cp = cn + uorder * vorder * dim;
122 GLuint i, uinc = vorder * dim;
124 if (vorder > uorder) {
130 for (j = 0; j < vorder; j++) {
153 _math_horner_bezier_curve(cp, out, v, dim, vorder);
156 _math_horner_bezier_curve(cn, out, v, dim, vorder);
158 else { /* vorder <= uorder */
160 if (vorder > 1) {
165 /* For constant i all cn[i][j] (j=0..vorder) are located */
169 _math_horner_bezier_curve(cn, &cp[i * dim], v, dim, vorder);
175 else /* vorder=1 -> cn defines a curve in u */
187 * must be multiplied with the (u2-u1)/uorder-1 and (v2-v1)/vorder-1.
190 * De Casteljau needs additional storage for uorder*vorder
197 GLuint uorder, GLuint vorder)
199 GLfloat *dcn = cn + uorder * vorder * dim;
202 GLuint minorder = uorder < vorder ? uorder : vorder;
203 GLuint uinc = vorder * dim;
204 GLuint dcuinc = vorder;
208 /* algorithm. If additional storage for (uorder-1)*(vorder-1) */
215 if (uorder == vorder) {
236 for (j = 0; j < vorder - 1; j++) {
247 for (h = minorder; h < vorder - 1; h++)
248 for (j = 0; j < vorder - h; j++) {
266 else { /* minorder == vorder */
303 else if (uorder == vorder) {
308 for (j = 0; j < vorder - 1; j++) {
318 for (j = 0; j < vorder - h; j++) {
340 for (j = 0; j < vorder - 1; j++) {
350 for (j = 0; j < vorder - h; j++) {
359 for (j = 0; j < vorder - 1; j++) {
370 for (h = minorder; h < vorder - 1; h++)
371 for (j = 0; j < vorder - h; j++) {
389 else { /* minorder == vorder */
395 for (j = 0; j < vorder - 1; j++) {
405 for (j = 0; j < vorder - h; j++) {
