------------------------------------------------------------------------------ PolyData rep. of all spatial regions, shrunk to data bounds-------
| 3394 | // PolyData rep. of all spatial regions, shrunk to data bounds------- |
| 3395 | // |
| 3396 | void vtkKdTree::AddPolys(vtkKdNode* kd, vtkPoints* pts, vtkCellArray* polys) |
| 3397 | { |
| 3398 | vtkIdType ids[8]; |
| 3399 | vtkIdType idList[4]; |
| 3400 | double x[3]; |
| 3401 | |
| 3402 | const double* min; |
| 3403 | const double* max; |
| 3404 | |
| 3405 | if (this->GenerateRepresentationUsingDataBounds) |
| 3406 | { |
| 3407 | min = kd->GetMinDataBounds(); |
| 3408 | max = kd->GetMaxDataBounds(); |
| 3409 | } |
| 3410 | else |
| 3411 | { |
| 3412 | min = kd->GetMinBounds(); |
| 3413 | max = kd->GetMaxBounds(); |
| 3414 | } |
| 3415 | |
| 3416 | x[0] = min[0]; |
| 3417 | x[1] = max[1]; |
| 3418 | x[2] = min[2]; |
| 3419 | ids[0] = pts->InsertNextPoint(x); |
| 3420 | |
| 3421 | x[0] = max[0]; |
| 3422 | x[1] = max[1]; |
| 3423 | x[2] = min[2]; |
| 3424 | ids[1] = pts->InsertNextPoint(x); |
| 3425 | |
| 3426 | x[0] = max[0]; |
| 3427 | x[1] = max[1]; |
| 3428 | x[2] = max[2]; |
| 3429 | ids[2] = pts->InsertNextPoint(x); |
| 3430 | |
| 3431 | x[0] = min[0]; |
| 3432 | x[1] = max[1]; |
| 3433 | x[2] = max[2]; |
| 3434 | ids[3] = pts->InsertNextPoint(x); |
| 3435 | |
| 3436 | x[0] = min[0]; |
| 3437 | x[1] = min[1]; |
| 3438 | x[2] = min[2]; |
| 3439 | ids[4] = pts->InsertNextPoint(x); |
| 3440 | |
| 3441 | x[0] = max[0]; |
| 3442 | x[1] = min[1]; |
| 3443 | x[2] = min[2]; |
| 3444 | ids[5] = pts->InsertNextPoint(x); |
| 3445 | |
| 3446 | x[0] = max[0]; |
| 3447 | x[1] = min[1]; |
| 3448 | x[2] = max[2]; |
| 3449 | ids[6] = pts->InsertNextPoint(x); |
| 3450 | |
| 3451 | x[0] = min[0]; |
| 3452 | x[1] = min[1]; |
| 3453 | x[2] = max[2]; |
nothing calls this directly
no test coverage detected