Lines Matching refs:polygonVerts
43 int SkGetPolygonWinding(const SkPoint* polygonVerts, int polygonSize) {
50 SkVector v0 = polygonVerts[1] - polygonVerts[0];
52 SkVector v1 = polygonVerts[curr] - polygonVerts[0];
182 bool SkIsConvexPolygon(const SkPoint* polygonVerts, int polygonSize) {
193 SkPoint origin = polygonVerts[0];
194 SkVector v0 = polygonVerts[currIndex] - polygonVerts[prevIndex];
195 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex];
196 SkVector w0 = polygonVerts[currIndex] - origin;
197 SkVector w1 = polygonVerts[nextIndex] - origin;
199 if (!polygonVerts[i].isFinite()) {
226 v1 = polygonVerts[nextIndex] - polygonVerts[currIndex];
228 w1 = polygonVerts[nextIndex] - origin;
1587 static void reclassify_vertex(TriangulationVertex* p, const SkPoint* polygonVerts,
1591 SkVector v0 = p->fPosition - polygonVerts[p->fPrevIndex];
1592 SkVector v1 = polygonVerts[p->fNextIndex] - p->fPosition;
1602 bool SkTriangulateSimplePolygon(const SkPoint* polygonVerts, uint16_t* indexMap, int polygonSize,
1614 if (!bounds.setBoundsCheck(polygonVerts, polygonSize)) {
1620 int winding = SkGetPolygonWinding(polygonVerts, polygonSize);
1628 SkVector v0 = polygonVerts[0] - polygonVerts[prevIndex];
1633 triangulationVertices[currIndex].fPosition = polygonVerts[currIndex];
1637 SkVector v1 = polygonVerts[nextIndex] - polygonVerts[currIndex];
1727 reclassify_vertex(p0, polygonVerts, winding, &reflexHash, &convexList);
1730 reclassify_vertex(p2, polygonVerts, winding, &reflexHash, &convexList);