Lines Matching refs:pEdgeA
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()
207 EdgeEntry* pStart = new EdgeEntry(pEdgeA->getStart(), rTestPoint); in CheckPointInTriangle()
213 pEnd->setNext(pEdgeA->getNext()); in CheckPointInTriangle()
214 pEdgeA->setNext(pStart); in CheckPointInTriangle()
286 EdgeEntry* pEdgeA = mpList; in Triangulator() local
287 EdgeEntry* pEdgeB = pEdgeA->getNext(); in Triangulator()
289 if( pEdgeA->getEnd().equal(pEdgeB->getEnd()) ) in Triangulator()
296 const B2DVector aLeft(pEdgeA->getEnd() - pEdgeA->getStart()); in Triangulator()
297 const B2DVector aRight(pEdgeB->getEnd() - pEdgeA->getStart()); in Triangulator()
304 handleClosingEdge(pEdgeA->getEnd(), pEdgeB->getEnd()); in Triangulator()
309 B2DRange aRange(pEdgeA->getStart(), pEdgeA->getEnd()); in Triangulator()
325 if(!pTestEdge->getStart().equal(pEdgeA->getStart())) in Triangulator()
329 bNoPointInTriangle = CheckPointInTriangle(pEdgeA, pEdgeB, pTestEdge->getStart()); in Triangulator()
353 if(!pTestEdge->getEnd().equal(pEdgeA->getStart())) in Triangulator()
357 bNoPointInTriangle = CheckPointInTriangle(pEdgeA, pEdgeB, pTestEdge->getEnd()); in Triangulator()
371 createTriangle(pEdgeA->getStart(), pEdgeB->getEnd(), pEdgeA->getEnd()); in Triangulator()
372 handleClosingEdge(pEdgeA->getEnd(), pEdgeB->getEnd()); in Triangulator()