Lines Matching refs:edge
642 /* Locates a point within the Delaunay triangulation (finds the edge
647 CvSubdiv2DEdge* edge,
662 /************ Basic quad-edge navigation and operations ************/
664 CV_INLINE CvSubdiv2DEdge cvSubdiv2DNextEdge( CvSubdiv2DEdge edge )
666 return CV_SUBDIV2D_NEXT_EDGE(edge);
670 CV_INLINE CvSubdiv2DEdge cvSubdiv2DRotateEdge( CvSubdiv2DEdge edge, int rotate )
672 return (edge & ~3) + ((edge + rotate) & 3);
675 CV_INLINE CvSubdiv2DEdge cvSubdiv2DSymEdge( CvSubdiv2DEdge edge )
677 return edge ^ 2;
680 CV_INLINE CvSubdiv2DEdge cvSubdiv2DGetEdge( CvSubdiv2DEdge edge, CvNextEdgeType type )
682 CvQuadEdge2D* e = (CvQuadEdge2D*)(edge & ~3);
683 edge = e->next[(edge + (int)type) & 3];
684 return (edge & ~3) + ((edge + ((int)type >> 4)) & 3);
688 CV_INLINE CvSubdiv2DPoint* cvSubdiv2DEdgeOrg( CvSubdiv2DEdge edge )
690 CvQuadEdge2D* e = (CvQuadEdge2D*)(edge & ~3);
691 return (CvSubdiv2DPoint*)e->pt[edge & 3];
695 CV_INLINE CvSubdiv2DPoint* cvSubdiv2DEdgeDst( CvSubdiv2DEdge edge )
697 CvQuadEdge2D* e = (CvQuadEdge2D*)(edge & ~3);
698 return (CvSubdiv2DPoint*)e->pt[(edge + 2) & 3];
812 /* Checks whether the point is inside polygon, outside, on an edge (at a vertex).
815 the point and the nearest polygon edge (measure_dist=1) */
988 /* Runs canny edge detector */
