Lines Matching refs:B2DPoint
54 B2DPoint maPoint; // the new point
59 temporaryPoint(const B2DPoint& rNewPoint, sal_uInt32 nIndex, double fCut) in temporaryPoint()
76 const B2DPoint& getPoint() const { return maPoint; } in getPoint()
162 const B2DPoint aNewPoint(rTempPoint.getPoint()); in mergeTemporaryPointsAndPolygon()
237 const B2DPoint& rCurrA, const B2DPoint& rNextA, in findEdgeCutsTwoEdges()
238 const B2DPoint& rCurrB, const B2DPoint& rNextB, in findEdgeCutsTwoEdges()
278 const B2DPoint aCutPoint(interpolate(rCurrA, rNextA, fCut)); in findEdgeCutsTwoEdges()
313 B2DPoint aCurrA(rCandidateA.getB2DPoint(0L)); in findCutsAndTouchesAndCommonForBezier()
317 const B2DPoint aNextA(rCandidateA.getB2DPoint(a + 1L)); in findCutsAndTouchesAndCommonForBezier()
319 B2DPoint aCurrB(rCandidateB.getB2DPoint(0L)); in findCutsAndTouchesAndCommonForBezier()
323 const B2DPoint aNextB(rCandidateB.getB2DPoint(b + 1L)); in findCutsAndTouchesAndCommonForBezier()
375 const B2DPoint aCutPoint(interpolate(aCurrA, aNextA, fCutA)); in findCutsAndTouchesAndCommonForBezier()
391 const B2DPoint aCutPoint(interpolate(aCurrB, aNextB, fCutB)); in findCutsAndTouchesAndCommonForBezier()
414 const B2DPoint& rCurrB, const B2DPoint& rNextB, in findEdgeCutsBezierAndEdge()
602 B2DPoint aCurrA(rCandidate.getB2DPoint(0L)); in findCuts()
606 const B2DPoint aNextA(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in findCuts()
608 B2DPoint aCurrB(rCandidate.getB2DPoint(a + 1L)); in findCuts()
612 const B2DPoint aNextB(rCandidate.getB2DPoint(b + 1L == nPointCount ? 0L : b + 1L)); in findCuts()
652 const B2DPoint& rCurr, const B2DPoint& rNext, const B2DPolygon& rPointPolygon, in findTouchesOnEdge()
669 const B2DPoint aTestPoint(rPointPolygon.getB2DPoint(a)); in findTouchesOnEdge()
734 B2DPoint aCurr(rEdgePolygon.getB2DPoint(0)); in findTouches()
739 const B2DPoint aNext(rEdgePolygon.getB2DPoint(nNextIndex)); in findTouches()
747 const B2DPoint aNextControlPoint(rEdgePolygon.getNextControlPoint(a)); in findTouches()
748 const B2DPoint aPrevControlPoint(rEdgePolygon.getPrevControlPoint(nNextIndex)); in findTouches()
854 B2DPoint aCurrA(rCandidateA.getB2DPoint(0L)); in findCuts()
858 const B2DPoint aNextA(rCandidateA.getB2DPoint(a + 1L == nPointCountA ? 0L : a + 1L)); in findCuts()
860 B2DPoint aCurrB(rCandidateB.getB2DPoint(0L)); in findCuts()
864 const B2DPoint aNextB(rCandidateB.getB2DPoint(b + 1L == nPointCountB ? 0L : b + 1L)); in findCuts()
1047 …Polygon addPointsAtCuts(const B2DPolygon& rCandidate, const B2DPoint& rStart, const B2DPoint& rEnd) in addPointsAtCuts()
1094 …gon addPointsAtCuts(const B2DPolyPolygon& rCandidate, const B2DPoint& rStart, const B2DPoint& rEnd) in addPointsAtCuts()