Lines Matching defs:line
50 // Lines do not intersect if the other line's endpoints are on the same side
53 // Test line 0
55 const I64Vec2 line = line0End - line0Beg;
58 const deInt64 crossProduct0 = (line.x() * v0.y() - line.y() * v0.x());
59 const deInt64 crossProduct1 = (line.x() * v1.y() - line.y() * v1.x());
67 // Test line 1
69 const I64Vec2 line = line1End - line1Beg;
72 const deInt64 crossProduct0 = (line.x() * v0.y() - line.y() * v0.x());
73 const deInt64 crossProduct1 = (line.x() * v1.y() - line.y() * v1.x());
108 // "Near" = Distance from the line to the pixel is less than 2 * pixel_max_radius. (pixel_max_radius = sqrt(2) / 2)
112 // Near the line
114 const tcu::Vec2 line = p1 - p0;
116 const float crossProduct = (line.x() * v.y() - line.y() * v.x());
118 // distance to line: (line x v) / |line|
119 // |(line x v) / |line|| > maxPixelDistance
120 // ==> (line x v)^2 / |line|^2 > maxPixelDistance^2
121 // ==> (line x v)^2 > maxPixelDistance^2 * |line|^2
123 if (crossProduct * crossProduct > maxPixelDistanceSquared * tcu::lengthSquared(line))
129 // distance from line endpoint 1 to pixel is less than line length + maxPixelDistance
535 // calculate interpolation as a line
602 * correct line interpolations for the triangulated lines.
619 // in triangulation, one line emits two triangles
638 // calculate interpolation as a line
650 // convert to three-component form. For all triangles, the vertex 0 is always emitted by the line starting point, and vertex 2 by the ending point
872 // Multisampled line == 2 triangles
925 // Multisampled line == 2 triangles
1061 // Reference renderer produces correct fragments using the diamond-rule. Make 2D int array, each cell contains the highest index (first index = 1) of the overlapping lines or 0 if no line intersects the pixel
1226 // Requirement 3: Line width must be constant
1230 log << tcu::TestLog::Message << "Verifying line widths of the x-major lines." << tcu::TestLog::EndMessage;
1243 // Which line does this fragment belong to?
1263 // Another line is too close, don't try to calculate width here
1269 // Only line with id of lineID is nearby
1273 // The line might have been overdrawn or not
1281 // Current line continues
1286 // Another line was drawn over or the line ends
1293 // The line ends
1299 log << tcu::TestLog::Message << "\tInvalid line width at (" << x - currentWidth << ", " << y << ") - (" << x - 1 << ", " << y << "). Detected width of " << currentWidth << ", expected " << lineWidth << tcu::TestLog::EndMessage;
1311 log << tcu::TestLog::Message << "Verifying line widths of the y-major lines." << tcu::TestLog::EndMessage;
1324 // Which line does this fragment belong to?
1344 // Another line is too close, don't try to calculate width here
1350 // Only line with id of lineID is nearby
1354 // The line might have been overdrawn or not
1362 // Current line continues
1367 // Another line was drawn over or the line ends
1374 // The line ends
1380 log << tcu::TestLog::Message << "\tInvalid line width at (" << x << ", " << y - currentWidth << ") - (" << x << ", " << y - 1 << "). Detected width of " << currentWidth << ", expected " << lineWidth << tcu::TestLog::EndMessage;
1394 log << tcu::TestLog::Message << "Invalid line width found, image is not valid." << tcu::TestLog::EndMessage;
1399 log << tcu::TestLog::Message << "Line widths are valid." << tcu::TestLog::EndMessage;
1404 //Requirement 4. If two line segments share a common endpoint, and both segments are either
1482 // verify line interpolation assuming line pixels are interpolated independently depending only on screen space location
1500 // Reference renderer produces correct fragments using the diamond-exit-rule. Make 2D int array, store line coverage as a 8-bit bitfield
1632 log << tcu::TestLog::Message << "\tCandidate (line " << candidate.lineNdx << "):\n"
1699 // return point on line at a given position on a given axis
1741 // for each line, for every distinct major direction fragment, store root pixel location (along
1751 // Reference renderer produces correct fragments using the diamond-exit-rule. Make 2D int array, store line coverage as a 8-bit bitfield
1758 // calculate mask and effective line coordinates
1773 // wide line interpolations are calculated for a line moved in minor direction
1789 // Calculate root pixel lookup table for this line. Since the implementation's fragment
1790 // major coordinate range might not be a subset of the correct line range (they are allowed
1794 // Expanding line strip to (effectively) infinite line might result in exit-diamnod set
1795 // that is not a superset of the exit-diamond set of the line strip. In practice, this
1797 // if the original and extended line would resolve differently a diamond the line just
1807 // Expand to effectively infinite line (endpoints are just one pixel over viewport boundaries)
1827 // infinite line will generate some diamonds outside the viewport
1882 // \note Wide line fragments are generated by replicating the root fragment for each
1998 msg << "\tCandidate line (line " << candidate.lineNdx << "):\n";
