Lines Matching refs:Point2f
107 static void advanceBToRightChain(const std::vector<cv::Point2f> &polygon,
113 static double angleOfLineWrtOxAxis(const cv::Point2f &a, const cv::Point2f &b);
115 static bool areEqualPoints(const cv::Point2f &point1, const cv::Point2f &point2);
124 double sideCExtraParam, cv::Point2f &intersectionPoint1,
125 cv::Point2f &intersectionPoint2);
127 static bool areOnTheSameSideOfLine(const cv::Point2f &p1, const cv::Point2f &p2,
128 const cv::Point2f &a, const cv::Point2f &b);
130 static double areaOfTriangle(const cv::Point2f &a, const cv::Point2f &b, const cv::Point2f &c);
132 static void copyResultingTriangle(const std::vector<cv::Point2f> &resultingTriangle, cv::OutputArra…
134 static void createConvexHull(cv::InputArray points, std::vector<cv::Point2f> &polygon);
136 static double distanceBtwPoints(const cv::Point2f &a, const cv::Point2f &b);
138 static double distanceFromPointToLine(const cv::Point2f &a, const cv::Point2f &linePointB,
139 const cv::Point2f &linePointC);
141 static bool findGammaIntersectionPoints(const std::vector<cv::Point2f> &polygon, unsigned int nrOfP…
143 … const cv::Point2f &side1StartVertex, const cv::Point2f &side1EndVertex,
144 … const cv::Point2f &side2StartVertex, const cv::Point2f &side2EndVertex,
145 … cv::Point2f &intersectionPoint1, cv::Point2f &intersectionPoint2);
150 static void findMinEnclosingTriangle(const std::vector<cv::Point2f> &polygon,
151 std::vector<cv::Point2f> &triangle, double &area);
153 static void findMinimumAreaEnclosingTriangle(const std::vector<cv::Point2f> &polygon,
154 std::vector<cv::Point2f> &triangle, double &area);
156 static cv::Point2f findVertexCOnSideB(const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoi…
158 const cv::Point2f &sideBStartVertex,
159 const cv::Point2f &sideBEndVertex,
160 const cv::Point2f &sideCStartVertex,
161 const cv::Point2f &sideCEndVertex);
163 static bool gamma(unsigned int polygonPointIndex, cv::Point2f &gammaPoint,
164 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints,
169 static double height(const cv::Point2f &polygonPoint, const std::vector<cv::Point2f> &polygon,
172 static double height(unsigned int polygonPointIndex, const std::vector<cv::Point2f> &polygon,
175 static void initialise(std::vector<cv::Point2f> &triangle, double &area);
178 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints,
181 static bool intersectsAbove(const cv::Point2f &gammaPoint, unsigned int polygonPointIndex,
182 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints,
186 const std::vector<cv::Point2f> &polygon,
189 static bool intersectsBelow(const cv::Point2f &gammaPoint, unsigned int polygonPointIndex,
190 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints,
203 static bool isLocalMinimalTriangle(cv::Point2f &vertexA, cv::Point2f &vertexB,
204 cv::Point2f &vertexC, const std::vector<cv::Point2f> &polygon,
206 unsigned int validationFlag, const cv::Point2f &sideAStartVertex,
207 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex,
208 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex,
209 const cv::Point2f &sideCEndVertex);
211 static bool isNotBTangency(const std::vector<cv::Point2f> &polygon,
217 static bool isPointOnLineSegment(const cv::Point2f &point, const cv::Point2f &lineSegmentStart,
218 const cv::Point2f &lineSegmentEnd);
220 static bool isValidMinimalTriangle(const cv::Point2f &vertexA, const cv::Point2f &vertexB,
221 … const cv::Point2f &vertexC, const std::vector<cv::Point2f> &polygon,
223 unsigned int validationFlag, const cv::Point2f &sideAStartVertex,
224 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex,
225 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex,
226 const cv::Point2f &sideCEndVertex);
230 static void lineEquationDeterminedByPoints(const cv::Point2f &p, const cv::Point2f &q,
233 static std::vector<double> lineEquationParameters(const cv::Point2f& p, const cv::Point2f &q);
235 static bool lineIntersection(const cv::Point2f &a1, const cv::Point2f &b1, const cv::Point2f &a2,
236 const cv::Point2f &b2, cv::Point2f &intersection);
239 cv::Point2f &intersection);
243 static cv::Point2f middlePoint(const cv::Point2f &a, const cv::Point2f &b);
245 static bool middlePointOfSideB(cv::Point2f &middlePointOfSideB, const cv::Point2f &sideAStartVertex,
246 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex,
247 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex,
248 const cv::Point2f &sideCEndVertex);
250 static void moveAIfLowAndBIfHigh(const std::vector<cv::Point2f> &polygon,
258 static void returnMinimumAreaEnclosingTriangle(const std::vector<cv::Point2f> &polygon,
259 std::vector<cv::Point2f> &triangle, double &area);
261 static void searchForBTangency(const std::vector<cv::Point2f> &polygon,
269 static void updateMinimumAreaEnclosingTriangle(std::vector<cv::Point2f> &triangle, double &area,
270 … const cv::Point2f &vertexA, const cv::Point2f &vertexB,
271 const cv::Point2f &vertexC);
273 static void updateSideB(const std::vector<cv::Point2f> &polygon,
276 cv::Point2f &sideBStartVertex, cv::Point2f &sideBEndVertex);
278 static void updateSidesBA(const std::vector<cv::Point2f> &polygon,
281 cv::Point2f &sideAStartVertex, cv::Point2f &sideAEndVertex,
282 cv::Point2f &sideBStartVertex, cv::Point2f &sideBEndVertex,
283 const cv::Point2f &sideCStartVertex, const cv::Point2f &sideCEndVertex);
285 static void updateSidesCA(const std::vector<cv::Point2f> &polygon,
287 cv::Point2f &sideAStartVertex, cv::Point2f &sideAEndVertex,
288 cv::Point2f &sideCStartVertex, cv::Point2f &sideCEndVertex);
323 std::vector<cv::Point2f> resultingTriangle, polygon; in findMinEnclosingTriangle()
335 static void createConvexHull(cv::InputArray points, std::vector<cv::Point2f> &polygon) { in createConvexHull()
337 std::vector<cv::Point2f> pointsVector; in createConvexHull()
356 static void findMinEnclosingTriangle(const std::vector<cv::Point2f> &polygon, in findMinEnclosingTriangle()
357 std::vector<cv::Point2f> &triangle, double &area) { in findMinEnclosingTriangle()
372 static void copyResultingTriangle(const std::vector<cv::Point2f> &resultingTriangle, in copyResultingTriangle()
382 static void initialise(std::vector<cv::Point2f> &triangle, double &area) { in initialise()
395 static void findMinimumAreaEnclosingTriangle(const std::vector<cv::Point2f> &polygon, in findMinimumAreaEnclosingTriangle()
396 std::vector<cv::Point2f> &triangle, double &area) { in findMinimumAreaEnclosingTriangle()
401 cv::Point2f vertexA, vertexB, vertexC; in findMinimumAreaEnclosingTriangle()
403 cv::Point2f sideAStartVertex, sideAEndVertex; in findMinimumAreaEnclosingTriangle()
404 cv::Point2f sideBStartVertex, sideBEndVertex; in findMinimumAreaEnclosingTriangle()
405 cv::Point2f sideCStartVertex, sideCEndVertex; in findMinimumAreaEnclosingTriangle()
452 static void returnMinimumAreaEnclosingTriangle(const std::vector<cv::Point2f> &polygon, in returnMinimumAreaEnclosingTriangle()
453 std::vector<cv::Point2f> &triangle, double &area) { in returnMinimumAreaEnclosingTriangle()
472 static void advanceBToRightChain(const std::vector<cv::Point2f> &polygon, in advanceBToRightChain()
491 static void moveAIfLowAndBIfHigh(const std::vector<cv::Point2f> &polygon, in moveAIfLowAndBIfHigh()
494 cv::Point2f gammaOfA; in moveAIfLowAndBIfHigh()
515 static void searchForBTangency(const std::vector<cv::Point2f> &polygon, in searchForBTangency()
518 cv::Point2f gammaOfB; in searchForBTangency()
539 static bool isNotBTangency(const std::vector<cv::Point2f> &polygon, in isNotBTangency()
542 cv::Point2f gammaOfB; in isNotBTangency()
567 static void updateSidesCA(const std::vector<cv::Point2f> &polygon, in updateSidesCA()
569 cv::Point2f &sideAStartVertex, cv::Point2f &sideAEndVertex, in updateSidesCA()
570 cv::Point2f &sideCStartVertex, cv::Point2f &sideCEndVertex) { in updateSidesCA()
595 static void updateSidesBA(const std::vector<cv::Point2f> &polygon, in updateSidesBA()
598 cv::Point2f &sideAStartVertex, cv::Point2f &sideAEndVertex, in updateSidesBA()
599 cv::Point2f &sideBStartVertex, cv::Point2f &sideBEndVertex, in updateSidesBA()
600 const cv::Point2f &sideCStartVertex, const cv::Point2f &sideCEndVertex) { in updateSidesBA()
606 cv::Point2f sideBMiddlePoint; in updateSidesBA()
636 static void updateSideB(const std::vector<cv::Point2f> &polygon, in updateSideB()
639 cv::Point2f &sideBStartVertex, cv::Point2f &sideBEndVertex) { in updateSideB()
668 static bool isLocalMinimalTriangle(cv::Point2f &vertexA, cv::Point2f &vertexB, in isLocalMinimalTriangle()
669 cv::Point2f &vertexC, const std::vector<cv::Point2f> &polygon, in isLocalMinimalTriangle()
671 unsigned int validationFlag, const cv::Point2f &sideAStartVertex, in isLocalMinimalTriangle()
672 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex, in isLocalMinimalTriangle()
673 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex, in isLocalMinimalTriangle()
674 const cv::Point2f &sideCEndVertex) { in isLocalMinimalTriangle()
711 static bool isValidMinimalTriangle(const cv::Point2f &vertexA, const cv::Point2f &vertexB, in isValidMinimalTriangle()
712 … const cv::Point2f &vertexC, const std::vector<cv::Point2f> &polygon, in isValidMinimalTriangle()
714 unsigned int validationFlag, const cv::Point2f &sideAStartVertex, in isValidMinimalTriangle()
715 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex, in isValidMinimalTriangle()
716 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex, in isValidMinimalTriangle()
717 const cv::Point2f &sideCEndVertex) { in isValidMinimalTriangle()
718 cv::Point2f midpointSideA = middlePoint(vertexB, vertexC); in isValidMinimalTriangle()
719 cv::Point2f midpointSideB = middlePoint(vertexA, vertexC); in isValidMinimalTriangle()
720 cv::Point2f midpointSideC = middlePoint(vertexA, vertexB); in isValidMinimalTriangle()
743 static void updateMinimumAreaEnclosingTriangle(std::vector<cv::Point2f> &triangle, double &area, in updateMinimumAreaEnclosingTriangle()
744 … const cv::Point2f &vertexA, const cv::Point2f &vertexB, in updateMinimumAreaEnclosingTriangle()
745 const cv::Point2f &vertexC) { in updateMinimumAreaEnclosingTriangle()
769 static bool middlePointOfSideB(cv::Point2f &middlePointOfSideB, const cv::Point2f &sideAStartVertex, in middlePointOfSideB()
770 … const cv::Point2f &sideAEndVertex, const cv::Point2f &sideBStartVertex, in middlePointOfSideB()
771 … const cv::Point2f &sideBEndVertex, const cv::Point2f &sideCStartVertex, in middlePointOfSideB()
772 const cv::Point2f &sideCEndVertex) { in middlePointOfSideB()
773 cv::Point2f vertexA, vertexC; in middlePointOfSideB()
796 static bool intersectsBelow(const cv::Point2f &gammaPoint, unsigned int polygonPointIndex, in intersectsBelow()
797 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints, in intersectsBelow()
815 static bool intersectsAbove(const cv::Point2f &gammaPoint, unsigned int polygonPointIndex, in intersectsAbove()
816 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints, in intersectsAbove()
832 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints, in intersects()
879 const std::vector<cv::Point2f> &polygon, in intersectsAboveOrBelow()
908 static bool gamma(unsigned int polygonPointIndex, cv::Point2f &gammaPoint, in gamma()
909 const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoints, in gamma()
911 cv::Point2f intersectionPoint1, intersectionPoint2; in gamma()
951 static cv::Point2f findVertexCOnSideB(const std::vector<cv::Point2f> &polygon, unsigned int nrOfPoi… in findVertexCOnSideB()
953 const cv::Point2f &sideBStartVertex, in findVertexCOnSideB()
954 const cv::Point2f &sideBEndVertex, in findVertexCOnSideB()
955 const cv::Point2f &sideCStartVertex, in findVertexCOnSideB()
956 const cv::Point2f &sideCEndVertex) { in findVertexCOnSideB()
957 cv::Point2f intersectionPoint1, intersectionPoint2; in findVertexCOnSideB()
989 static bool findGammaIntersectionPoints(const std::vector<cv::Point2f> &polygon, unsigned int nrOfP… in findGammaIntersectionPoints()
991 … const cv::Point2f &side1StartVertex, const cv::Point2f &side1EndVertex, in findGammaIntersectionPoints()
992 … const cv::Point2f &side2StartVertex, const cv::Point2f &side2EndVertex, in findGammaIntersectionPoints()
993 … cv::Point2f &intersectionPoint1, cv::Point2f &intersectionPoint2) { in findGammaIntersectionPoints()
1049 double sideCExtraParam, cv::Point2f &intersectionPoint1, in areIntersectingLines()
1050 cv::Point2f &intersectionPoint2) { in areIntersectingLines()
1069 static std::vector<double> lineEquationParameters(const cv::Point2f& p, const cv::Point2f &q) { in lineEquationParameters()
1091 static double height(const cv::Point2f &polygonPoint, const std::vector<cv::Point2f> &polygon, in height()
1093 cv::Point2f pointC = polygon[c]; in height()
1094 cv::Point2f pointCPredecessor = polygon[predecessor(c, nrOfPoints)]; in height()
1108 static double height(unsigned int polygonPointIndex, const std::vector<cv::Point2f> &polygon, in height()
1110 cv::Point2f pointC = polygon[c]; in height()
1111 cv::Point2f pointCPredecessor = polygon[predecessor(c, nrOfPoints)]; in height()
1113 cv::Point2f polygonPoint = polygon[polygonPointIndex]; in height()
1199 static double angleOfLineWrtOxAxis(const cv::Point2f &a, const cv::Point2f &b) { in angleOfLineWrtOxAxis()
1285 static double distanceFromPointToLine(const cv::Point2f &a, const cv::Point2f &linePointB, in distanceFromPointToLine()
1286 const cv::Point2f &linePointC) { in distanceFromPointToLine()
1305 static double distanceBtwPoints(const cv::Point2f &a, const cv::Point2f &b) { in distanceBtwPoints()
1322 static double areaOfTriangle(const cv::Point2f &a, const cv::Point2f &b, const cv::Point2f &c) { in areaOfTriangle()
1336 static cv::Point2f middlePoint(const cv::Point2f &a, const cv::Point2f &b) { in middlePoint()
1340 return cv::Point2f(static_cast<float>(middleX), static_cast<float>(middleY)); in middlePoint()
1367 cv::Point2f &intersection) { in lineIntersection()
1404 static bool lineIntersection(const cv::Point2f &a1, const cv::Point2f &b1, const cv::Point2f &a2, in lineIntersection()
1405 const cv::Point2f &b2, cv::Point2f &intersection) { in lineIntersection()
1438 static void lineEquationDeterminedByPoints(const cv::Point2f &p, const cv::Point2f &q, in lineEquationDeterminedByPoints()
1454 static bool areOnTheSameSideOfLine(const cv::Point2f &p1, const cv::Point2f &p2, in areOnTheSameSideOfLine()
1455 const cv::Point2f &a, const cv::Point2f &b) { in areOnTheSameSideOfLine()
1472 static bool isPointOnLineSegment(const cv::Point2f &point, const cv::Point2f &lineSegmentStart, in isPointOnLineSegment()
1473 const cv::Point2f &lineSegmentEnd) { in isPointOnLineSegment()
1513 static bool areEqualPoints(const cv::Point2f &point1, const cv::Point2f &point2) { in areEqualPoints()