Lines Matching refs:edge
46 SSEdge(Edge* edge, SSVertex* prev, SSVertex* next)
47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) {
75 TESS_LOG("found edge event for %g, %g (original %g -> %g), "
84 void GrAATriangulator::makeEvent(SSEdge* edge, Vertex* v, SSEdge* other, Vertex* dest,
89 Vertex* top = edge->fEdge->fTop;
90 Vertex* bottom = edge->fEdge->fBottom;
94 Line line = edge->fEdge->fLine;
101 TESS_LOG("found p edge event for %g, %g (original %g -> %g), "
104 edge->fEvent = fAlloc->make<Event>(edge, p, alpha);
105 events->push(edge->fEvent);
125 for (SSEdge* edge : ssEdges) {
126 if (edge->fEdge) {
127 TESS_LOG("skel edge %g -> %g",
128 edge->fPrev->fVertex->fID,
129 edge->fNext->fVertex->fID);
130 if (edge->fEdge->fTop && edge->fEdge->fBottom) {
132 edge->fEdge->fTop->fID,
133 edge->fEdge->fBottom->fID);
174 // Note: this is the normal to the edge, but not necessarily unit length.
180 // Stage 5c: detect and remove "pointy" vertices whose edge normals point in opposite directions
181 // and whose adjacent vertices are less than a quarter pixel from an edge. These are guaranteed to
260 TESS_LOG("collapsing %g, %g (original edge %g -> %g) to %g (%g, %g) alpha %d\n",
333 TESS_LOG("found interior overlap edge %g -> %g, disconnecting\n",
337 TESS_LOG("found overlap edge %g -> %g%s\n",
359 // Ensure winding values match expected scale for the edge type. During merging of
390 for (SSEdge* edge : ssEdges) {
391 if (Edge* e = edge->fEdge) {
392 this->makeConnectingEdge(edge->fPrev->fVertex, edge->fNext->fVertex, e->fType, c, 0);
581 // Find outgoing edge, in clockwise order.
590 // Find outgoing edge, in counter-clockwise order.