Lines Matching refs:aEdgeA
279 TrDeEdgeEntries::reference aEdgeA, in testAndCorrectEdgeIntersection() argument
284 if(aEdgeA.getStart().equal(aEdgeB.getStart(), fTools::getSmallValue())) in testAndCorrectEdgeIntersection()
289 if(aEdgeA.getStart().equal(aEdgeB.getEnd(), fTools::getSmallValue())) in testAndCorrectEdgeIntersection()
294 if(aEdgeA.getEnd().equal(aEdgeB.getStart(), fTools::getSmallValue())) in testAndCorrectEdgeIntersection()
299 if(aEdgeA.getEnd().equal(aEdgeB.getEnd(), fTools::getSmallValue())) in testAndCorrectEdgeIntersection()
305 if(aEdgeA.getStart().equal(aEdgeA.getEnd(), fTools::getSmallValue())) in testAndCorrectEdgeIntersection()
318 if(tools::isPointOnEdge(aEdgeA.getStart(), aEdgeB.getStart(), aDeltaB)) in testAndCorrectEdgeIntersection()
320 return splitEdgeAtGivenPoint(aEdgeB, aEdgeA.getStart(), aCurrent); in testAndCorrectEdgeIntersection()
323 if(tools::isPointOnEdge(aEdgeA.getEnd(), aEdgeB.getStart(), aDeltaB)) in testAndCorrectEdgeIntersection()
325 return splitEdgeAtGivenPoint(aEdgeB, aEdgeA.getEnd(), aCurrent); in testAndCorrectEdgeIntersection()
328 const B2DVector aDeltaA(aEdgeA.getDeltaX(), aEdgeA.getDeltaY()); in testAndCorrectEdgeIntersection()
330 if(tools::isPointOnEdge(aEdgeB.getStart(), aEdgeA.getStart(), aDeltaA)) in testAndCorrectEdgeIntersection()
332 return splitEdgeAtGivenPoint(aEdgeA, aEdgeB.getStart(), aCurrent); in testAndCorrectEdgeIntersection()
335 if(tools::isPointOnEdge(aEdgeB.getEnd(), aEdgeA.getStart(), aDeltaA)) in testAndCorrectEdgeIntersection()
337 return splitEdgeAtGivenPoint(aEdgeA, aEdgeB.getEnd(), aCurrent); in testAndCorrectEdgeIntersection()
346 aEdgeA.getStart(), aDeltaA, in testAndCorrectEdgeIntersection()
358 ? new B2DPoint(aEdgeA.getStart() + (fCutA * aDeltaA)) in testAndCorrectEdgeIntersection()
363 bRetval = splitEdgeAtGivenPoint(aEdgeA, *pNewPoint, aCurrent); in testAndCorrectEdgeIntersection()