• Home
  • Raw
  • Download

Lines Matching refs:vtx

75         CV_DbgAssert((size_t)vidx < vtx.size());  in edgeOrg()
76 *orgpt = vtx[vidx].pt; in edgeOrg()
87 CV_DbgAssert((size_t)vidx < vtx.size()); in edgeDst()
88 *dstpt = vtx[vidx].pt; in edgeDst()
96 CV_DbgAssert((size_t)vertex < vtx.size()); in getVertex()
98 *firstEdge = vtx[vertex].firstEdge; in getVertex()
99 return vtx[vertex].pt; in getVertex()
183 vtx[orgPt].firstEdge = edge; in setEdgePoints()
184 vtx[dstPt].firstEdge = edge ^ 2; in setEdgePoints()
258 vtx.push_back(Vertex()); in newPoint()
259 freePoint = (int)(vtx.size()-1); in newPoint()
262 freePoint = vtx[vidx].firstEdge; in newPoint()
263 vtx[vidx] = Vertex(pt, isvirtual, firstEdge); in newPoint()
270 CV_DbgAssert( (size_t)vidx < vtx.size() ); in deletePoint()
271 vtx[vidx].firstEdge = freePoint; in deletePoint()
272 vtx[vidx].type = -1; in deletePoint()
337 isRightOf( vtx[edgeDst(onext_edge)].pt, edge ) >= 0 ) in locate()
464 if( isRightOf( vtx[temp_dst].pt, curr_edge ) > 0 && in insert()
465 isPtInCircle3( vtx[curr_org].pt, vtx[temp_dst].pt, in insert()
466 vtx[curr_dst].pt, vtx[curr_point].pt ) < 0 ) in insert()
492 vtx.clear(); in initDelaunay()
505 vtx.push_back(Vertex()); in initDelaunay()
538 total = vtx.size(); in clearVoronoi()
541 if( vtx[i].isvirtual() ) in clearVoronoi()
664 int i, total = (int)vtx.size(); in findNearest()
704 *nearestPt = vtx[vertex].pt; in findNearest()
719 Point2f org = vtx[qedges[i].pt[0]].pt; in getEdgeList()
720 Point2f dst = vtx[qedges[i].pt[2]].pt; in getEdgeList()
762 i = 4, total = vtx.size(); in getVoronoiFacetList()
770 if( vtx[k].isfree() || vtx[k].isvirtual() ) in getVoronoiFacetList()
772 int edge = rotateEdge(vtx[k].firstEdge, 1), t = edge; in getVoronoiFacetList()
778 buf.push_back(vtx[edgeOrg(t)].pt); in getVoronoiFacetList()
784 facetCenters.push_back(vtx[k].pt); in getVoronoiFacetList()