Lines Matching refs:rCandidate
40 B2DPolyPolygon correctOrientations(const B2DPolyPolygon& rCandidate) in correctOrientations() argument
42 B2DPolyPolygon aRetval(rCandidate); in correctOrientations()
47 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in correctOrientations()
55 const B2DPolygon aCompare(rCandidate.getB2DPolygon(b)); in correctOrientations()
78 B2DPolyPolygon correctOutmostPolygon(const B2DPolyPolygon& rCandidate) in correctOutmostPolygon() argument
80 const sal_uInt32 nCount(rCandidate.count()); in correctOutmostPolygon()
86 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in correctOutmostPolygon()
93 const B2DPolygon aCompare(rCandidate.getB2DPolygon(b)); in correctOutmostPolygon()
104 B2DPolyPolygon aRetval(rCandidate); in correctOutmostPolygon()
110 aRetval.setB2DPolygon(a, rCandidate.getB2DPolygon(0L)); in correctOutmostPolygon()
119 return rCandidate; in correctOutmostPolygon()
122 …B2DPolyPolygon adaptiveSubdivideByDistance(const B2DPolyPolygon& rCandidate, double fDistanceBound) in adaptiveSubdivideByDistance() argument
124 if(rCandidate.areControlPointsUsed()) in adaptiveSubdivideByDistance()
126 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByDistance()
131 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByDistance()
147 return rCandidate; in adaptiveSubdivideByDistance()
151 B2DPolyPolygon adaptiveSubdivideByAngle(const B2DPolyPolygon& rCandidate, double fAngleBound) in adaptiveSubdivideByAngle() argument
153 if(rCandidate.areControlPointsUsed()) in adaptiveSubdivideByAngle()
155 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByAngle()
160 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByAngle()
176 return rCandidate; in adaptiveSubdivideByAngle()
180 B2DPolyPolygon adaptiveSubdivideByCount(const B2DPolyPolygon& rCandidate, sal_uInt32 nCount) in adaptiveSubdivideByCount() argument
182 if(rCandidate.areControlPointsUsed()) in adaptiveSubdivideByCount()
184 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByCount()
189 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByCount()
205 return rCandidate; in adaptiveSubdivideByCount()
209 bool isInside(const B2DPolyPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder) in isInside() argument
211 const sal_uInt32 nPolygonCount(rCandidate.count()); in isInside()
215 return isInside(rCandidate.getB2DPolygon(0L), rPoint, bWithBorder); in isInside()
223 const B2DPolygon aPolygon(rCandidate.getB2DPolygon(a)); in isInside()
236 B2DRange getRangeWithControlPoints(const B2DPolyPolygon& rCandidate) in getRangeWithControlPoints() argument
239 const sal_uInt32 nPolygonCount(rCandidate.count()); in getRangeWithControlPoints()
243 B2DPolygon aCandidate = rCandidate.getB2DPolygon(a); in getRangeWithControlPoints()
250 B2DRange getRange(const B2DPolyPolygon& rCandidate) in getRange() argument
253 const sal_uInt32 nPolygonCount(rCandidate.count()); in getRange()
257 B2DPolygon aCandidate = rCandidate.getB2DPolygon(a); in getRange()
264 double getSignedArea(const B2DPolyPolygon& rCandidate) in getSignedArea() argument
267 const sal_uInt32 nPolygonCount(rCandidate.count()); in getSignedArea()
271 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in getSignedArea()
279 double getArea(const B2DPolyPolygon& rCandidate) in getArea() argument
281 return fabs(getSignedArea(rCandidate)); in getArea()
284 …void applyLineDashing(const B2DPolyPolygon& rCandidate, const ::std::vector<double>& rDotDashArray… in applyLineDashing() argument
292 if(rCandidate.count() && fFullDashDotLen > 0.0) in applyLineDashing()
296 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in applyLineDashing()
298 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in applyLineDashing()
320 …bool isInEpsilonRange(const B2DPolyPolygon& rCandidate, const B2DPoint& rTestPosition, double fDis… in isInEpsilonRange() argument
322 const sal_uInt32 nPolygonCount(rCandidate.count()); in isInEpsilonRange()
326 B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in isInEpsilonRange()
337 …B3DPolyPolygon createB3DPolyPolygonFromB2DPolyPolygon(const B2DPolyPolygon& rCandidate, double fZC… in createB3DPolyPolygonFromB2DPolyPolygon() argument
339 const sal_uInt32 nPolygonCount(rCandidate.count()); in createB3DPolyPolygonFromB2DPolyPolygon()
344 B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in createB3DPolyPolygonFromB2DPolyPolygon()
352 …B2DPolyPolygon createB2DPolyPolygonFromB3DPolyPolygon(const B3DPolyPolygon& rCandidate, const B3DH… in createB2DPolyPolygonFromB3DPolyPolygon() argument
354 const sal_uInt32 nPolygonCount(rCandidate.count()); in createB2DPolyPolygonFromB3DPolyPolygon()
359 B3DPolygon aCandidate(rCandidate.getB3DPolygon(a)); in createB2DPolyPolygonFromB3DPolyPolygon()
367 …double getSmallestDistancePointToPolyPolygon(const B2DPolyPolygon& rCandidate, const B2DPoint& rTe… in getSmallestDistancePointToPolyPolygon() argument
371 const sal_uInt32 nPolygonCount(rCandidate.count()); in getSmallestDistancePointToPolyPolygon()
375 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in getSmallestDistancePointToPolyPolygon()
399 …B2DPolyPolygon distort(const B2DPolyPolygon& rCandidate, const B2DRange& rOriginal, const B2DPoint… in distort() argument
401 const sal_uInt32 nPolygonCount(rCandidate.count()); in distort()
406 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in distort()
414 …B2DPolyPolygon rotateAroundPoint(const B2DPolyPolygon& rCandidate, const B2DPoint& rCenter, double… in rotateAroundPoint() argument
416 const sal_uInt32 nPolygonCount(rCandidate.count()); in rotateAroundPoint()
421 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in rotateAroundPoint()
429 B2DPolyPolygon expandToCurve(const B2DPolyPolygon& rCandidate) in expandToCurve() argument
431 const sal_uInt32 nPolygonCount(rCandidate.count()); in expandToCurve()
436 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in expandToCurve()
444 B2DPolyPolygon setContinuity(const B2DPolyPolygon& rCandidate, B2VectorContinuity eContinuity) in setContinuity() argument
446 if(rCandidate.areControlPointsUsed()) in setContinuity()
448 const sal_uInt32 nPolygonCount(rCandidate.count()); in setContinuity()
453 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in setContinuity()
462 return rCandidate; in setContinuity()
466 B2DPolyPolygon growInNormalDirection(const B2DPolyPolygon& rCandidate, double fValue) in growInNormalDirection() argument
472 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in growInNormalDirection()
474 aRetval.append(growInNormalDirection(rCandidate.getB2DPolygon(a), fValue)); in growInNormalDirection()
481 return rCandidate; in growInNormalDirection()
489 B2DPolyPolygon reSegmentPolyPolygon(const B2DPolyPolygon& rCandidate, sal_uInt32 nSegments) in reSegmentPolyPolygon() argument
493 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygon()
495 aRetval.append(reSegmentPolygon(rCandidate.getB2DPolygon(a), nSegments)); in reSegmentPolyPolygon()
524 B2DPolyPolygon simplifyCurveSegments(const B2DPolyPolygon& rCandidate) in simplifyCurveSegments() argument
526 if(rCandidate.areControlPointsUsed()) in simplifyCurveSegments()
530 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in simplifyCurveSegments()
532 aRetval.append(simplifyCurveSegments(rCandidate.getB2DPolygon(a))); in simplifyCurveSegments()
539 return rCandidate; in simplifyCurveSegments()
543 …B2DPolyPolygon reSegmentPolyPolygonEdges(const B2DPolyPolygon& rCandidate, sal_uInt32 nSubEdges, b… in reSegmentPolyPolygonEdges() argument
547 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygonEdges()
549 …aRetval.append(reSegmentPolygonEdges(rCandidate.getB2DPolygon(a), nSubEdges, bHandleCurvedEdges, b… in reSegmentPolyPolygonEdges()
583 B2DPolyPolygon snapPointsOfHorizontalOrVerticalEdges(const B2DPolyPolygon& rCandidate) in snapPointsOfHorizontalOrVerticalEdges() argument
587 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in snapPointsOfHorizontalOrVerticalEdges()
589 aRetval.append(snapPointsOfHorizontalOrVerticalEdges(rCandidate.getB2DPolygon(a))); in snapPointsOfHorizontalOrVerticalEdges()
595 bool containsOnlyHorizontalAndVerticalEdges(const B2DPolyPolygon& rCandidate) in containsOnlyHorizontalAndVerticalEdges() argument
597 if(rCandidate.areControlPointsUsed()) in containsOnlyHorizontalAndVerticalEdges()
602 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in containsOnlyHorizontalAndVerticalEdges()
604 if(!containsOnlyHorizontalAndVerticalEdges(rCandidate.getB2DPolygon(a))) in containsOnlyHorizontalAndVerticalEdges()