Lines Matching refs:edge
1460 // image boundary, missing fragment could be over the image edge
2425 // a) too far from any edge
2432 const DVec2 edge = triangleSubPixelSpace[otherVtxNdx] - triangleSubPixelSpace[vtxNdx];
2434 const double crossProduct = (edge.x() * v.y() - edge.y() * v.x());
2436 // distance from edge: (edge x v) / |edge|
2437 // (edge x v) / |edge| > maxPixelDistance
2438 // ==> (edge x v)^2 / edge^2 > maxPixelDistance^2 | edge x v > 0
2439 // ==> (edge x v)^2 > maxPixelDistance^2 * edge^2
2440 if (crossProduct < 0 && crossProduct*crossProduct > maxPixelDistanceSquared * tcu::lengthSquared(edge))
2442 if (crossProduct < 0 || crossProduct*crossProduct < maxPixelDistanceSquared * tcu::lengthSquared(edge))
2450 // Accurate intersection for edge pixels
2485 // Test if any edge (with any rounding) intersects the pixel (boundary). If it does => Partial. If not => fully inside or outside
2510 const I64Vec2 edge = endPos - startPos;
2512 const deInt64 crossProduct = (edge.x() * v.y() - edge.y() * v.x());
2604 // Accurate intersection for edge pixels
2628 // Test if any edge (with any rounding) intersects the pixel (boundary). If it does => Partial. If not => fully inside or outside
2653 const I64Vec2 edge = endPos - startPos;
2655 const deInt64 crossProduct = (edge.x() * v.y() - edge.y() * v.x());
2679 << "Unknown (subpixel on edge) pixels are marked with yellow."
2760 // Sharing an edge with another triangle?
2763 // Assume full coverage if the pixel is only on a shared edge in shared triangle too.