1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkDataArray.h"
#include "vtkGenericCell.h"
#include "vtkPointData.h"
#include "vtkCellTreeLocator.h"
#include "vtkNew.h"
#include "vtkPolyData.h"
#include "vtkSphereSource.h"
#include "vtkDebugLeaks.h"
int TestWithCachedCellBoundsParameter(int cachedCellBounds)
{
// kuhnan's sample code used to test
// vtkCellLocator::IntersectWithLine(...9 params...)
// sphere1: the outer sphere
vtkNew<vtkSphereSource> sphere1;
sphere1->SetThetaResolution(100);
sphere1->SetPhiResolution(100);
sphere1->SetRadius(1);
sphere1->Update();
// sphere2: the inner sphere
vtkNew<vtkSphereSource> sphere2;
sphere2->SetThetaResolution(100);
sphere2->SetPhiResolution(100);
sphere2->SetRadius(0.8);
sphere2->Update();
// the normals obtained from the outer sphere
vtkDataArray* sphereNormals = sphere1->GetOutput()->GetPointData()->GetNormals();
// the cell locator
vtkNew<vtkCellTreeLocator> locator;
locator->SetDataSet(sphere2->GetOutput());
locator->SetCacheCellBounds(cachedCellBounds);
locator->AutomaticOn();
locator->BuildLocator();
// init the counter and ray length
int numIntersected = 0;
double rayLen = 0.2000001; // = 1 - 0.8 + error tolerance
int sub_id;
vtkIdType cell_id;
double param_t, intersect[3], paraCoord[3];
double sourcePnt[3], destinPnt[3], normalVec[3];
vtkNew<vtkGenericCell> cell;
// this loop traverses each point on the outer sphere (sphere1)
// and looks for an intersection on the inner sphere (sphere2)
for (int i = 0; i < sphere1->GetOutput()->GetNumberOfPoints(); i++)
{
sphere1->GetOutput()->GetPoint(i, sourcePnt);
sphereNormals->GetTuple(i, normalVec);
// cast a ray in the negative direction toward sphere1
destinPnt[0] = sourcePnt[0] - rayLen * normalVec[0];
destinPnt[1] = sourcePnt[1] - rayLen * normalVec[1];
destinPnt[2] = sourcePnt[2] - rayLen * normalVec[2];
if (locator->IntersectWithLine(
sourcePnt, destinPnt, 0.0010, param_t, intersect, paraCoord, sub_id, cell_id, cell))
{
numIntersected++;
}
}
if (numIntersected != 9802)
{
int numMissed = 9802 - numIntersected;
vtkGenericWarningMacro("ERROR: " << numMissed << " ray-sphere intersections missed! "
<< "If on a non-WinTel32 platform, try rayLen = 0.200001"
<< " or 0.20001 for a new test.");
return EXIT_FAILURE;
}
else
{
std::cout << "Passed: a total of 9802 ray-sphere intersections detected." << std::endl;
}
sphereNormals = nullptr;
return EXIT_SUCCESS;
}
int CellTreeLocator(int vtkNotUsed(argc), char* vtkNotUsed(argv)[])
{
int retVal = TestWithCachedCellBoundsParameter(0);
retVal += TestWithCachedCellBoundsParameter(1);
return retVal;
}
|
