Lines Matching refs:pEdgeB
134 bool CheckPointInTriangle(EdgeEntry* pEdgeA, EdgeEntry* pEdgeB, const B2DPoint& rTestPoint);
198 …bool Triangulator::CheckPointInTriangle(EdgeEntry* pEdgeA, EdgeEntry* pEdgeB, const B2DPoint& rTes… in CheckPointInTriangle() argument
201 …if(tools::isPointInTriangle(pEdgeA->getStart(), pEdgeA->getEnd(), pEdgeB->getEnd(), rTestPoint, tr… in CheckPointInTriangle()
204 if(!rTestPoint.equal(pEdgeA->getEnd()) && !rTestPoint.equal(pEdgeB->getEnd())) in CheckPointInTriangle()
287 EdgeEntry* pEdgeB = pEdgeA->getNext(); in Triangulator() local
289 if( pEdgeA->getEnd().equal(pEdgeB->getEnd()) ) in Triangulator()
292 mpList = pEdgeB->getNext(); in Triangulator()
297 const B2DVector aRight(pEdgeB->getEnd() - pEdgeA->getStart()); in Triangulator()
303 mpList = pEdgeB->getNext(); in Triangulator()
304 handleClosingEdge(pEdgeA->getEnd(), pEdgeB->getEnd()); in Triangulator()
310 aRange.expand(pEdgeB->getEnd()); in Triangulator()
311 EdgeEntry* pTestEdge = pEdgeB->getNext(); in Triangulator()
329 bNoPointInTriangle = CheckPointInTriangle(pEdgeA, pEdgeB, pTestEdge->getStart()); in Triangulator()
341 pTestEdge = pEdgeB->getNext(); in Triangulator()
357 bNoPointInTriangle = CheckPointInTriangle(pEdgeA, pEdgeB, pTestEdge->getEnd()); in Triangulator()
370 mpList = pEdgeB->getNext(); in Triangulator()
371 createTriangle(pEdgeA->getStart(), pEdgeB->getEnd(), pEdgeA->getEnd()); in Triangulator()
372 handleClosingEdge(pEdgeA->getEnd(), pEdgeB->getEnd()); in Triangulator()