Lines Matching refs:Point2f
69 int Subdiv2D::edgeOrg(int edge, CV_OUT Point2f* orgpt) const
81 int Subdiv2D::edgeDst(int edge, CV_OUT Point2f* dstpt) const
94 Point2f Subdiv2D::getVertex(int vertex, CV_OUT int* firstEdge) const
150 Subdiv2D::Vertex::Vertex(Point2f _pt, bool _isvirtual, int _firstEdge)
213 static double triangleArea( Point2f a, Point2f b, Point2f c )
218 int Subdiv2D::isRightOf(Point2f pt, int edge) const
220 Point2f org, dst;
254 int Subdiv2D::newPoint(Point2f pt, bool isvirtual, int firstEdge)
276 int Subdiv2D::locate(Point2f pt, int& _edge, int& _vertex)
353 Point2f org_pt, dst_pt;
398 isPtInCircle3( Point2f pt, Point2f a, Point2f b, Point2f c)
410 int Subdiv2D::insert(Point2f pt)
480 void Subdiv2D::insert(const std::vector<Point2f>& ptvec)
498 topLeft = Point2f( rx, ry );
499 bottomRight = Point2f( rx + rect.width, ry + rect.height );
501 Point2f ppA( rx + big_coord, ry );
502 Point2f ppB( rx, ry + big_coord );
503 Point2f ppC( rx - big_coord, ry - big_coord );
549 static Point2f computeVoronoiPoint(Point2f org0, Point2f dst0, Point2f org1, Point2f dst1)
564 return Point2f((float) ((b0 * c1 - b1 * c0) * det),
568 return Point2f(FLT_MAX, FLT_MAX);
590 Point2f org0, dst0, org1, dst1;
602 Point2f virt_point = computeVoronoiPoint(org0, dst0, org1, dst1);
622 Point2f virt_point = computeVoronoiPoint(org0, dst0, org1, dst1);
638 isRightOf2( const Point2f& pt, const Point2f& org, const Point2f& diff )
645 int Subdiv2D::findNearest(Point2f pt, Point2f* nearestPt)
658 Point2f start;
660 Point2f diff = pt - start;
668 Point2f t;
689 Point2f tempDiff;
719 Point2f org = vtx[qedges[i].pt[0]].pt;
720 Point2f dst = vtx[qedges[i].pt[2]].pt;
736 Point2f a, b, c;
751 CV_OUT std::vector<std::vector<Point2f> >& facetList,
752 CV_OUT std::vector<Point2f>& facetCenters)
758 std::vector<Point2f> buf;
