while (i < size) { BVHNode node = bvhNodes.get(i); boolean overlap = !node.aabb.isDisjoint(aabb); boolean isLeafNode = node.escape >= 0; if (isLeafNode && overlap) {
while (i < size) { BVHNode node = bvhNodes.get(i); boolean overlap = !node.aabb.isDisjoint(aabb); boolean isLeafNode = node.escape >= 0; if (isLeafNode && overlap) {
if (bounds1.isDisjoint( bounds2 )) { return;
if (bounds1.isDisjoint( bounds2 )) { return;
if (bounds[i].isDisjoint(bounds[j])) continue; good_matrix[i][j] = true; good_matrix[j][i] = true;