Lines Matching defs:n_ulines
218 static void triangulateRectGen(Arc_ptr loop, int n_ulines, int n_vlines, Backend& backend);
579 static void triangulateRectCenter(int n_ulines, REAL* u_val,
587 if(n_ulines>1 && n_vlines>1) {
588 backend.surfgrid(u_val[0], u_val[n_ulines-1], n_ulines-1,
590 backend.surfmesh(0,0,n_ulines-1,n_vlines-1);
600 for(j=0; j<n_ulines; j++)
616 static void triangulateRectTopGen(Arc_ptr arc, int n_ulines, REAL* u_val, Real v, int dir, int is_u, Backend& backend)
632 n_ulines, v, u_val);
643 n_ulines, v, u_val,
664 n_ulines, v, u_val);
673 n_ulines, v, u_val,
694 temp_u_val = (REAL*) malloc(sizeof(REAL) * n_ulines);
696 for(i=0; i<n_ulines; i++)
697 temp_u_val[i] = u_val[n_ulines-1-i];
701 if(parc->npts > n_ulines)
703 d1 = n_ulines-1;
723 else if(parc->npts < n_ulines)
725 d2 = n_ulines-parc->npts;
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)
822 + 2*n_ulines + 2*n_vlines
824 num_quads += (n_ulines-1)*(n_vlines-1);
827 backend.surfgrid(left->tail()[0], right->tail()[0], n_ulines+1,
829 // if(n_ulines>1 && n_vlines>1)
830 backend.surfmesh(0,0,n_ulines+1,n_vlines+1);
833 REAL* u_val=(REAL*) malloc(sizeof(REAL)*n_ulines);
837 REAL u_stepsize = (right->tail()[0] - left->tail()[0])/( (REAL) n_ulines+1);
840 for(i=0; i<n_ulines; i++)
852 triangulateRectTopGen(top, n_ulines, u_val, v_val[n_vlines-1], 1,1, backend);
853 triangulateRectTopGen(bot, n_ulines, u_val, v_val[0], 0, 1, backend);
855 triangulateRectTopGen(right, n_vlines, v_val, u_val[n_ulines-1], 0,0, backend);
861 triangulateRectCenter(n_ulines, u_val, n_vlines, v_val, backend);