Lines Matching refs:leftChain
53 void findTopLeftSegment(vertexArray* leftChain,
65 if(leftChain->getVertex(i)[0] >= u)
73 if(leftChain->getVertex(i-1)[0] <= leftChain->getVertex(i)[0])
197 vertexArray* leftChain,
214 tempTop = leftChain->getVertex(segIndexLarge);
222 leftChain,
244 if(leftChain->getVertex(i)[0] >= topVertex[0])
265 stripOfFanLeft(leftChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, midU, pStream, 0);
269 monoTriangulation2(topVertex, tempBot, leftChain, leftStart, segIndexSmall, 1, pStream);
274 stripOfFanLeft(leftChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, rightU, pStream, 0);
278 monoTriangulation2(topVertex, tempBot, leftChain, leftStart, segIndexSmall, 1, pStream);
287 vertexArray* leftChain,
304 findTopLeftSegment(leftChain,
312 leftChain,
326 Int findTopSeparator(vertexArray* leftChain,
338 Real leftMax /*= leftChain->getVertex(leftEndIndex)[0]*/;
340 if(leftChain->getVertex(leftEndIndex)[1] > rightChain->getVertex(rightEndIndex)[1]) //left higher
344 leftMax = leftChain->getVertex(leftEndIndex)[0] - Real(1.0); //initilza to left of leftU
351 leftMax = leftChain->getVertex(leftEndIndex)[0];
355 //i: the current working leftChain index,
388 if(leftChain->getVertex(k)[0] < rightMin) //no conflict
391 if(leftChain->getVertex(k)[0] > leftMax)
393 leftMax = leftChain->getVertex(k)[0];
402 else if(leftChain->getVertex(i)[1] > rightChain->getVertex(j)[1]) //left hgiher
404 if(leftChain->getVertex(i)[0] > leftMax) //update leftMax and newLeftI.
406 leftMax = leftChain->getVertex(i)[0];
411 if(rightChain->getVertex(k)[1] > leftChain->getVertex(i)[1])
437 if(leftChain->getVertex(k)[1] > rightChain->getVertex(j)[1])
439 if(leftChain->getVertex(k)[0] > leftMax)
441 leftMax = leftChain->getVertex(k)[0];
469 vertexArray* leftChain,
524 tempTop = leftChain->getVertex(up_rightCornerIndex);
527 sampleTopLeftWithGridLine(tempTop, leftChain, tempLeftStart, up_leftCornerIndex,
535 leftChain,
551 leftChain,
567 if(findTopSeparator(leftChain,
578 if( leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex1) &&
584 findTopLeftSegment(leftChain,
596 if(leftChain->getVertex(segLeftSmall)[1] >= rightChain->getVertex(segRightSmall)[1])
599 while(leftGridChain->getGrid()->get_u_value(gridSep) > leftChain->getVertex(segLeftSmall)[0])
602 if(leftGridChain->getGrid()->get_u_value(gridSep) < leftChain->getVertex(segLeftSmall+1)[0])
622 leftChain,
637 sampleTopLeftWithGridLinePost(leftChain->getVertex(segLeftSmall),
638 leftChain,
663 leftChain, leftStartIndex, segLeftSmall,
668 else if(leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex1)) //left is in, right is nout
672 findTopLeftSegment(leftChain,
679 monoTriangulation2(leftChain->getVertex(segLeftLarge),
681 leftChain,
687 stripOfFanLeft(leftChain, segLeftLarge, segLeftSmall,
696 leftChain, leftStartIndex, segLeftSmall,
726 leftChain, leftStartIndex, up_leftCornerIndex,
735 leftChain,
753 leftChain,
905 vertexArray* leftChain,
971 ActualTop = leftChain->getVertex(up_rightCornerIndex);
985 if(leftChain->getVertex(ActualLeftEnd)[1] == ActualBot[1])
988 monoTriangulationRecGenOpt(ActualTop, leftChain->getVertex(ActualLeftEnd),
989 leftChain,
998 ActualTop, leftChain->getVertex(ActualLeftEnd),
999 leftChain,
1010 monoTriangulationRecGenOpt(ActualTop, ActualBot, leftChain,
1018 ActualTop, ActualBot, leftChain,