HomeSort by: relevance | last modified time | path
    Searched refs:leftMostV (Results 1 - 3 of 3) sorted by relevancy

  /xsrc/external/mit/glu/dist/src/libnurbs/interface/
glsurfeval.cc 357 REAL leftMostV[2];
361 *leftMostV: the left most of the remaining verteces (on both upper and lower).
363 *i: upperVerts[i] is the first vertex to the right of leftMostV on upper line
364 *j: lowerVerts[j] is the first vertex to the right of leftMostV on lower line
367 /*initialize i,j,and leftMostV
374 leftMostV[0] = upper_val[0];
375 leftMostV[1] = v_upper;
382 leftMostV[0] = lower_val[0];
383 leftMostV[1] = v_lower;
389 *at the beginning of each loop, the meaning of i,j,and leftMostV ar
    [all...]
insurfeval.cc 1169 REAL leftMostV[2];
1191 *leftMostV: the left most of the remaining verteces (on both upper and lower).
1193 *i: upperVerts[i] is the first vertex to the right of leftMostV on upper line *j: lowerVerts[j] is the first vertex to the right of leftMostV on lower line */
1195 /*initialize i,j,and leftMostV
1202 leftMostV[0] = upper_val[0];
1203 leftMostV[1] = v_upper;
1212 leftMostV[0] = lower_val[0];
1213 leftMostV[1] = v_lower;
1221 *at the beginning of each loop, the meaning of i,j,and leftMostV are
    [all...]
  /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
sampleMonoPoly.cc 2263 Real* leftMostV;
2270 leftMostV = upperVerts[0];
2276 leftMostV = lowerVerts[0];
2287 pStream->insert(leftMostV);
2303 pStream->insert(leftMostV);
2313 else /* case3: neither is empty, plus the leftMostV, there is at least one triangle to output*/
2336 pStream->insert(leftMostV);
2341 leftMostV = upperVerts[k];
2348 pStream->insert(leftMostV);
2361 leftMostV = lowerVerts[j-1]
    [all...]

Completed in 8 milliseconds