Lines Matching defs:pivot
168 int pivot = l;
177 while (pivot <= j) {
178 getTriangle(pivot, v1, v2, v3);
181 swapTriangles(pivot, j);
184 ++pivot;
189 pivot = (pivot == l && j < pivot) ? j : pivot;
190 return pivot;
322 int pivot = sortTriangles(l, r, split, axis);
323 if (pivot == l || pivot == r) {
324 pivot = (r + l) / 2;
328 if (pivot < l) {
333 } else if (pivot > r) {
347 node.setLeftPlane(getMinMax(createBox(l, max(l, pivot - 1)), false, axis));
348 node.setLeftChild(createNode(l, max(l, pivot - 1), lbbox, depth + 1)); //Recursive call
354 node.setRightPlane(getMinMax(createBox(pivot, r), true, axis));
355 node.setRightChild(createNode(pivot, r, rbbox, depth + 1)); //Recursive call