Home
last modified time | relevance | path

Searched refs:triangulator (Results 1 – 3 of 3) sorted by relevance

/third_party/skia/src/gpu/geometry/
DGrAATriangulator.cpp246 const GrAATriangulator* triangulator) { in apply() argument
257 Vertex* dest = triangulator->makeSortedVertex(fPoint, fAlpha, mesh, prev, c); in apply()
259 SSVertex* ssv = triangulator->fAlloc->make<SSVertex>(dest); in apply()
265 triangulator->connectSSEdge(prev, dest, c); in apply()
266 triangulator->connectSSEdge(next, dest, c); in apply()
281 triangulator->connectSSEdge(prevEdge->fPrev->fVertex, dest, c); in apply()
284 triangulator->computeBisector(prevEdge->fEdge, nextEdge->fEdge, dest); in apply()
287 triangulator->makeEvent(prevEdge, events); in apply()
288 triangulator->makeEvent(nextEdge, events); in apply()
290 triangulator->makeEvent(prevEdge, prevEdge->fPrev->fVertex, nextEdge, dest, events, c); in apply()
[all …]
DGrTriangulator.h36 GrTriangulator triangulator(path, &alloc); in PathToTriangles()
37 Poly* polys = triangulator.pathToPolys(tolerance, clipBounds, isLinear); in PathToTriangles()
38 int count = triangulator.polysToTriangles(polys, vertexAllocator); in PathToTriangles()
/third_party/skia/tests/
DTriangulatingPathRendererTests.cpp868 GrInnerFanTriangulator triangulator(path, &arena); in verify_simple_inner_polygons() local
869 vertexCount = triangulator.pathToTriangles(&vertexAlloc, &breadcrumbs, &isLinear); in verify_simple_inner_polygons()