Lines Matching refs:B2DPoint
47 const B2DPoint* mpStart;
48 const B2DPoint* mpEnd;
53 const B2DPoint* pStart, in TrDeSimpleEdge()
54 const B2DPoint* pEnd) in TrDeSimpleEdge()
61 const B2DPoint& getStart() const { return *mpStart; } in getStart()
62 const B2DPoint& getEnd() const { return *mpEnd; } in getEnd()
106 const B2DPoint* pStart, in TrDeEdgeEntry()
107 const B2DPoint* pEnd, in TrDeEdgeEntry()
123 void setStart( const B2DPoint* pNewStart) in setStart()
137 void setEnd( const B2DPoint* pNewEnd) in setEnd()
177 B2DPoint getCutPointForGivenY(double fGivenY) in getCutPointForGivenY()
184 return B2DPoint(getStart().getX() + fDeltaXNew, fGivenY); in getCutPointForGivenY()
209 ::std::vector< B2DPoint > maPoints;
210 ::std::vector< B2DPoint* > maNewPoints;
228 const B2DPoint& rCutPoint, in splitEdgeAtGivenPoint()
357 B2DPoint* pNewPoint = bAIsLonger in testAndCorrectEdgeIntersection()
358 ? new B2DPoint(aEdgeA.getStart() + (fCutA * aDeltaA)) in testAndCorrectEdgeIntersection()
359 : new B2DPoint(aEdgeB.getStart() + (fCutB * aDeltaB)); in testAndCorrectEdgeIntersection()
423 const B2DPoint aSplit(aCompare.getCutPointForGivenY(fFixedY)); in solveHorizontalEdges()
429 B2DPoint* pNewPoint = new B2DPoint(aSplit); in solveHorizontalEdges()
515 B2DPoint* pPrev(&maPoints[nCount + nStartIndex - 1]); in TrapezoidSubdivider()
520 B2DPoint* pCurr(&maPoints[nStartIndex++]); in TrapezoidSubdivider()
645 B2DPoint aLeftEnd(aLeft.getEnd()); in Subdivide()
646 B2DPoint aRightEnd(aRight.getEnd()); in Subdivide()
680 B2DPoint* pNewPoint = new B2DPoint(aLeftEnd); in Subdivide()
693 B2DPoint* pNewPoint = new B2DPoint(aRightEnd); in Subdivide()
780 const B2DPoint aSplitLeft(aLeft.getCutPointForGivenY(aCompare.getStart().getY())); in Subdivide()
781 const B2DPoint aSplitRight(aRight.getCutPointForGivenY(aCompare.getStart().getY())); in Subdivide()
789 B2DPoint* pNewLeft = new B2DPoint(aSplitLeft); in Subdivide()
801 B2DPoint* pNewRight = new B2DPoint(aSplitRight); in Subdivide()
846 B2DPoint* pNewPoint = new B2DPoint(aLeftEnd); in Subdivide()
859 B2DPoint* pNewPoint = new B2DPoint(aRightEnd); in Subdivide()
935 aRetval.append(B2DPoint(getTopXLeft(), getTopY())); in getB2DPolygon()
936 aRetval.append(B2DPoint(getTopXRight(), getTopY())); in getB2DPolygon()
937 aRetval.append(B2DPoint(getBottomXRight(), getBottomY())); in getB2DPolygon()
938 aRetval.append(B2DPoint(getBottomXLeft(), getBottomY())); in getB2DPolygon()
961 const B2DPoint& rPointA, in createLineTrapezoidFromEdge()
962 const B2DPoint& rPointB, in createLineTrapezoidFromEdge()
1018 const B2DPoint aStartLow(rPointA + aPerpendicular); in createLineTrapezoidFromEdge()
1019 const B2DPoint aStartHigh(rPointA - aPerpendicular); in createLineTrapezoidFromEdge()
1020 const B2DPoint aEndHigh(rPointB - aPerpendicular); in createLineTrapezoidFromEdge()
1021 const B2DPoint aEndLow(rPointB + aPerpendicular); in createLineTrapezoidFromEdge()
1074 const B2DPoint aSplitLeft(aLeft.getCutPointForGivenY(aRight.getEnd().getY())); in createLineTrapezoidFromEdge()
1075 const B2DPoint aSplitRight(aRight2.getCutPointForGivenY(aLeft.getEnd().getY())); in createLineTrapezoidFromEdge()
1108 const B2DPoint aSplitRight(aRight.getCutPointForGivenY(aLeft.getEnd().getY())); in createLineTrapezoidFromEdge()
1109 const B2DPoint aSplitLeft(aLeft2.getCutPointForGivenY(aRight.getEnd().getY())); in createLineTrapezoidFromEdge()
1169 B2DPoint aCurrent(aSource.getB2DPoint(0)); in createLineTrapezoidFromB2DPolygon()
1176 const B2DPoint aNext(aSource.getB2DPoint(nNextIndex)); in createLineTrapezoidFromB2DPolygon()