Lines Matching refs:maxD
113 For each pixel row1[x], max(-maxD, 0) <= minX <= x < maxX <= width - max(0, -minD),
114 and for each disparity minD<=d<maxD the function
115 computes the cost (cost[(x-minX)*(maxD - minD) + (d - minD)]), depending on the difference between
123 int minD, int maxD, CostType* cost,
128 int minX1 = std::max(-maxD, 0), maxX1 = width + std::min(minD, 0);
129 int minX2 = std::max(minX1 - maxD, 0), maxX2 = std::min(maxX1 - minD, width);
130 int D = maxD - minD, width1 = maxX1 - minX1, width2 = maxX2 - minX2;
221 for( int d = minD; d < maxD; d += 16 )
240 for( int d = minD; d < maxD; d++ )
264 for( int d = minD; d < maxD; d += 16 )
278 for( int d = minD; d < maxD; d++ )
293 minD <= d < maxD.
335 int minD = params.minDisparity, maxD = minD + params.numDisparities;
343 int minX1 = std::max(-maxD, 0), maxX1 = width + std::min(minD, 0);
344 int D = maxD - minD, width1 = maxX1 - minX1;
451 calcPixelCostBT( img1, img2, k, minD, maxD, pixDiff, tempBuf, clipTab, TAB_OFS, ftzero );
962 int minD = minDisparity, maxD = minDisparity + numberOfDisparities - 1;
964 int xmin = std::max(roi1.x, roi2.x + maxD) + SW2;
1128 int minD = minDisparity, maxD = minDisparity + numberOfDisparities;
1129 int x, minX1 = std::max(maxD, 0), maxX1 = cols + std::min(minD, 0);
