Searched refs:pTestEdge (Results 1 – 1 of 1) sorted by relevance
311 EdgeEntry* pTestEdge = pEdgeB->getNext(); in Triangulator() local315 while(bNoPointInTriangle && pTestEdge) in Triangulator()317 if(aRange.getMaxY() < pTestEdge->getStart().getY()) in Triangulator()325 if(!pTestEdge->getStart().equal(pEdgeA->getStart())) in Triangulator()327 if(aRange.isInside(pTestEdge->getStart())) in Triangulator()329 … bNoPointInTriangle = CheckPointInTriangle(pEdgeA, pEdgeB, pTestEdge->getStart()); in Triangulator()335 pTestEdge = pTestEdge->getNext(); in Triangulator()341 pTestEdge = pEdgeB->getNext(); in Triangulator()343 while(bNoPointInTriangle && pTestEdge) in Triangulator()345 if(aRange.getMaxY() < pTestEdge->getStart().getY()) in Triangulator()[all …]