Searched refs:n_vlines (Results 1 - 4 of 4) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DgridWrap.cc50 printf("n_vlines = %i\n", n_vlines);
62 n_vlines = nVlines;
69 v_values = (Real*) malloc(sizeof(Real) * n_vlines);
75 for(i=0; i<n_vlines; i++)
86 n_vlines = nVlines;
93 v_values = (Real*) malloc(sizeof(Real) * n_vlines);
132 for(j=0; j<n_vlines; j++)
180 Int n_vlines,
184 : grid(gr), firstVlineIndex(first_vline_index), nVlines(n_vlines)
177 gridBoundaryChain(gridWrap * gr,Int first_vline_index,Int n_vlines,Int * uline_indices,Int * inner_indices) argument
[all...]
H A DgridWrap.h44 Int n_vlines; member in class:gridWrap
53 Real* v_values; /*size is n_vlines*/
72 Int get_n_vlines() {return n_vlines;}
108 gridBoundaryChain(gridWrap* gr, Int first_vline_index, Int n_vlines, Int* uline_indices, Int* inner_indices);
H A DsampleMonoPoly.cc868 Int n_vlines = leftGridChain->get_nVlines(); local in function:findNeckF
879 for(i=gridStartIndex; i<n_vlines; i++)
886 if(lowerGridIndex == n_vlines) //the two trm vertex are higher than all gridlines
/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Dslicer.cc218 static void triangulateRectGen(Arc_ptr loop, int n_ulines, int n_vlines, Backend& backend);
580 int n_vlines, REAL* v_val,
587 if(n_ulines>1 && n_vlines>1) {
589 v_val[n_vlines-1], v_val[0], n_vlines-1);
590 backend.surfmesh(0,0,n_ulines-1,n_vlines-1);
596 for(i=0; i<n_vlines-1; i++)
776 //n_ulines is the number of ulines inside, and n_vlines is the number of vlines
778 static void triangulateRectGen(Arc_ptr loop, int n_ulines, int n_vlines, Backend& backend) argument
822 + 2*n_ulines + 2*n_vlines
579 triangulateRectCenter(int n_ulines,REAL * u_val,int n_vlines,REAL * v_val,Backend & backend) argument
1005 Int n_vlines=grid->get_n_vlines(); local in function:Slicer::evalRBArray
[all...]

Completed in 11 milliseconds