Lines Matching defs:grid
69 *inbetween the top and bot grid lines or not.
162 if(midIndex2 >= 0) //there is a trm point between grid lines
237 *and the right end grid points
249 //append the vertices of the right extremal grid points,
257 //output the fan of the grid points of the (i)th and (i-1)th grid line.
282 //output the fan of the grid points of the (i)_th and i-1th gridLine
319 //if there is only one grid line, return
328 //grid line: index1.
357 //below the second grid line). Find the last grid line index2 which is STRICTLY ABOVE
388 *second grid line, there could be multiple points on the first (top)
389 *grid line.
401 //sampling the right area in between two grid lines
423 gridWrap* grid = rightGridChain->getGrid();
440 vert1[0]=grid->get_u_value(i);
441 vert2[0]=grid->get_u_value(i-1);
450 //the vertical grid line segment
451 vert1[0]=vert2[0] = grid->get_u_value(innerInd);
461 //the lower grid line
465 vert1[0] = grid->get_u_value(i);
466 vert2[0] = grid->get_u_value(i+1);
472 //the edge connecting lower grid to right chain
473 vert1[0]=grid->get_u_value(lowerInd);
487 //the edge connecting right chain with upper grid
489 vert2[0]=grid->get_u_value(upperInd);
525 //if j+1 is on the last grid line, then we wat to skip to the vertex
526 //whcih is strictly above the second grid line. This vertex must exist
549 0 //the grid line is below the trim line
560 1 //the grid line is above the trm lines
564 //two vertices on the two grid v-lines
584 gridWrap* grid,
589 Int gridLineUp /*1 if the grid line is above the trim lines*/
595 grid_v_value = grid->get_v_value(vlineIndex);
605 if(! gridLineUp) /*trim line is above grid line, so trim vertices are going right when index increases*/
620 gridVerts[k][0] = grid->get_u_value(i);