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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "TestVectorFieldSource.h"
#include <vtkCellArray.h>
#include <vtkDoubleArray.h>
#include <vtkIdList.h>
#include <vtkMPIController.h>
#include <vtkMath.h>
#include <vtkNew.h>
#include <vtkPStreamTracer.h>
#include <vtkPointData.h>
#include <vtkPoints.h>
#include <vtkPolyDataMapper.h>
#include <cstdlib>
#define PRINT(x) cout << "(" << myRank << ")" << x << endl;
namespace Vec3
{
void copy(double* src, double* dst)
{
src[0] = dst[0];
src[1] = dst[1];
src[2] = dst[2];
}
};
inline double ComputeLength(vtkIdList* poly, vtkPoints* pts)
{
int n = poly->GetNumberOfIds();
if (n == 0)
return 0;
double s(0);
double p[3];
pts->GetPoint(poly->GetId(0), p);
for (int j = 1; j < n; j++)
{
int pIndex = poly->GetId(j);
double q[3];
pts->GetPoint(pIndex, q);
s += sqrt(vtkMath::Distance2BetweenPoints(p, q));
Vec3::copy(p, q);
}
return s;
}
int TestPStreamGeometry(int argc, char* argv[])
{
vtkNew<vtkMPIController> c;
vtkMultiProcessController::SetGlobalController(c);
c->Initialize(&argc, &argv);
int numProcs = c->GetNumberOfProcesses();
int myRank = c->GetLocalProcessId();
if (numProcs != 4)
{
std::cerr << "Test requires 4 processes." << std::endl;
c->Finalize();
return EXIT_FAILURE;
}
int size(5);
vtkNew<TestVectorFieldSource> imageSource;
imageSource->SetExtent(0, size - 1, 0, 1, 0, size - 1);
imageSource->SetBoundingBox(-1, 1, -1, 1, -1, 1);
double stepSize(0.01);
double radius = 0.8;
double scale = 1;
double maximumPropagation = radius * scale * 2 * vtkMath::Pi();
double angle = vtkMath::Pi() / 20;
int numTraces = 1;
vtkNew<vtkPStreamTracer> tracer;
tracer->SetInputConnection(0, imageSource->GetOutputPort());
tracer->SetIntegrationDirectionToForward();
tracer->SetIntegratorTypeToRungeKutta4();
tracer->SetMaximumNumberOfSteps(
4 * maximumPropagation / stepSize); // shouldn't have to do this fix in stream tracer somewhere!
tracer->SetMinimumIntegrationStep(stepSize * .1);
tracer->SetMaximumIntegrationStep(stepSize);
tracer->SetInitialIntegrationStep(stepSize);
double start[2] = { radius * cos(angle), radius * sin(angle) };
vtkNew<vtkPolyData> seeds;
{
vtkNew<vtkPoints> seedPoints;
double dt = numTraces == 1 ? 0 : 1.8 / (numTraces - 1);
for (int i = 0; i < numTraces; i++)
seedPoints->InsertNextPoint(start[0], numTraces == 1 ? 0 : -0.9 + dt * i, start[1]);
seedPoints->InsertNextPoint(-2, -2, -2); // out of bound point
seeds->SetPoints(seedPoints);
}
tracer->SetInputData(1, seeds);
tracer->SetMaximumPropagation(maximumPropagation);
vtkSmartPointer<vtkPolyDataMapper> traceMapper = vtkSmartPointer<vtkPolyDataMapper>::New();
traceMapper->SetInputConnection(tracer->GetOutputPort());
traceMapper->SetPiece(myRank);
traceMapper->SetNumberOfPieces(numProcs);
traceMapper->Update();
vtkPolyData* out = tracer->GetOutput();
vtkNew<vtkIdList> polyLine;
vtkCellArray* lines = out->GetLines();
double totalLength(0);
lines->InitTraversal();
while (lines->GetNextCell(polyLine))
{
double d = ComputeLength(polyLine, out->GetPoints());
totalLength += d;
}
double totalLengthAll(0);
c->Reduce(&totalLength, &totalLengthAll, 1, vtkCommunicator::SUM_OP, 0);
bool res(true);
if (myRank == 0)
{
double err = fabs(totalLengthAll - maximumPropagation) / maximumPropagation;
PRINT("Error in length is: " << err)
res = err < 0.02;
}
// Test IntegrationTime
tracer->SetInputArrayToProcess(0, 0, 0, vtkDataObject::FIELD_ASSOCIATION_POINTS, "Velocity");
vtkNew<vtkPolyData> singleSeed;
{
vtkNew<vtkPoints> seedPoints;
seedPoints->InsertNextPoint(.1, .1, 0);
singleSeed->SetPoints(seedPoints);
}
tracer->SetInputData(1, singleSeed);
tracer->SetIntegrationDirectionToBoth();
traceMapper->Update();
out = tracer->GetOutput();
vtkDoubleArray* integrationTime =
vtkArrayDownCast<vtkDoubleArray>(out->GetPointData()->GetArray("IntegrationTime"));
for (vtkIdType i = 0; i < out->GetNumberOfPoints(); i++)
{
double coord[3];
out->GetPoint(i, coord);
double diff = std::abs(coord[2] - integrationTime->GetValue(i));
if (diff != 0 && diff > std::abs(coord[2]) * .0001)
{
PRINT("Bad integration time at z-coord " << coord[2] << " " << integrationTime->GetValue(i))
res = false;
}
}
c->Finalize();
return res ? EXIT_SUCCESS : EXIT_FAILURE;
}
|
