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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
#include "VecGeom/base/Config.h"
#ifndef VECGEOM_ENABLE_CUDA
#include <VecCore/VecCore>
#include "test/benchmark/ArgParser.h"
#include "VecGeom/volumes/utilities/VolumeUtilities.h"
#include "VecGeom/base/Stopwatch.h"
#include "VecGeom/volumes/Extruded.h"
#include "VecGeom/volumes/Box.h"
#ifdef VECGEOM_ROOT
#include "VecGeomTest/Visualizer.h"
#include "TPolyMarker3D.h"
#include "TPolyLine3D.h"
#endif
#ifdef NDEBUG
#undef NDEBUG
#endif
#include <cassert>
/* Simple test for the scalability of creation of the tessellated structure.
An orb is split into ngrid theta and phi regions; each cell is represented
as a quadrilateral. The solid will contain 2*(ngrid-1)*ngrid triangle facets */
using namespace vecgeom;
using Real_v = vecgeom::VectorBackend::Real_v;
void RandomDirection(Vector3D<Precision> &direction)
{
Precision phi = RNG::Instance().uniform(0., 2. * kPi);
Precision theta = std::acos(1. - 2. * RNG::Instance().uniform(0, 1));
direction.x() = std::sin(theta) * std::cos(phi);
direction.y() = std::sin(theta) * std::sin(phi);
direction.z() = std::cos(theta);
}
void RandomPointInBBox(Vector3D<Precision> &point, Vector3D<Precision> &amin, Vector3D<Precision> &amax)
{
Vector3D<Precision> rnd(RNG::Instance().uniform(0, 1), RNG::Instance().uniform(0, 1), RNG::Instance().uniform(0, 1));
point = amin + rnd * (amax - amin);
}
#ifdef VECGEOM_ROOT
void AddFacetToVisualizer(TriangleFacet<Precision> const *facet, Visualizer &visualizer)
{
TPolyLine3D pl(3);
pl.SetLineColor(kBlue);
for (int i = 0; i < 3; i++)
pl.SetNextPoint(facet->fVertices[i].x(), facet->fVertices[i].y(), facet->fVertices[i].z());
visualizer.AddLine(pl);
}
void DrawCluster(TessellatedStruct<3, Precision> const &tsl, int icluster, Visualizer &visualizer, bool boxonly = false)
{
// Draw only segments of the facets which are not shared within the cluster
TPolyLine3D pl(2);
pl.SetLineColor(kBlue);
if (boxonly) {
Vector3D<Precision> minext = tsl.fClusters[icluster]->fMinExtent;
Vector3D<Precision> maxext = tsl.fClusters[icluster]->fMaxExtent;
Vector3D<Precision> dext = maxext - minext;
pl.SetPoint(0, minext.x(), minext.y(), minext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y(), minext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y(), minext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y() + dext.y(), minext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y() + dext.y(), minext.z());
pl.SetPoint(1, minext.x(), minext.y() + dext.y(), minext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x(), minext.y() + dext.y(), minext.z());
pl.SetPoint(1, minext.x(), minext.y(), minext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x(), minext.y(), minext.z());
pl.SetPoint(1, minext.x(), minext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y(), minext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y() + dext.y(), minext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y() + dext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x(), minext.y() + dext.y(), minext.z());
pl.SetPoint(1, minext.x(), minext.y() + dext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x(), minext.y(), minext.z() + dext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y(), minext.z() + dext.z());
pl.SetPoint(1, minext.x() + dext.x(), minext.y() + dext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x() + dext.x(), minext.y() + dext.y(), minext.z() + dext.z());
pl.SetPoint(1, minext.x(), minext.y() + dext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
pl.SetPoint(0, minext.x(), minext.y() + dext.y(), minext.z() + dext.z());
pl.SetPoint(1, minext.x(), minext.y(), minext.z() + dext.z());
visualizer.AddLine(pl);
return;
}
size_t nfacets = 0;
size_t ifacet = 0;
size_t iother = 0;
TriangleFacet<Precision> *facets[kVecSize];
while (ifacet < kVecSize) {
bool add = true;
for (unsigned i = 0; i < nfacets; ++i) {
if (tsl.fClusters[icluster]->fFacets[ifacet] == facets[i]) {
ifacet++;
add = false;
break;
}
}
if (add) facets[nfacets++] = tsl.fClusters[icluster]->fFacets[ifacet++];
}
// Loop facets
ifacet = 0;
size_t ivert[2];
while (ifacet < nfacets) {
// loop segments
for (size_t iseg = 0; iseg < 3; iseg++) {
bool shared = false;
ivert[0] = facets[ifacet]->fIndices[iseg];
ivert[1] = facets[ifacet]->fIndices[(iseg + 1) % 3];
// loop remaining facets
for (iother = 0; iother < nfacets; iother++) {
if (iother == ifacet) continue;
// check if the other facet has the 2 vertices
if (facets[iother]->fIndices[0] != ivert[0] && facets[iother]->fIndices[1] != ivert[0] &&
facets[iother]->fIndices[2] != ivert[0])
continue;
if (facets[iother]->fIndices[0] != ivert[1] && facets[iother]->fIndices[1] != ivert[1] &&
facets[iother]->fIndices[2] != ivert[1])
continue;
// The line is shared
shared = true;
break;
}
if (shared) continue;
// Add the line segment to the visualizer
pl.SetPoint(0, facets[ifacet]->fVertices[iseg].x(), facets[ifacet]->fVertices[iseg].y(),
facets[ifacet]->fVertices[iseg].z());
pl.SetPoint(1, facets[ifacet]->fVertices[(iseg + 1) % 3].x(), facets[ifacet]->fVertices[(iseg + 1) % 3].y(),
facets[ifacet]->fVertices[(iseg + 1) % 3].z());
visualizer.AddLine(pl);
}
ifacet++;
}
}
#endif // VECGEOM_ROOT
#endif // VECGEOM_CUDA
int main(int argc, char *argv[])
{
#ifndef VECGEOM_ENABLE_CUDA
using namespace vecgeom;
// using Real_v = typename VectorBackend::Real_v;
OPTION_INT(nvert, 8);
OPTION_INT(nsect, 2);
OPTION_BOOL(convex, 't');
OPTION_INT(npoints, 10000);
#ifdef VECGEOM_ROOT
OPTION_INT(vis, 0);
#endif
constexpr Precision rmin = 10.;
constexpr Precision rmax = 20.;
vecgeom::XtruVertex2 *vertices = new vecgeom::XtruVertex2[nvert];
vecgeom::XtruSection *sections = new vecgeom::XtruSection[nvert];
Precision phi = 2. * kPi / nvert;
Precision r;
Vector3D<Precision> start(0, 0, 0);
Vector3D<Precision> point;
Vector3D<Precision> *dirs = new Vector3D<Precision>[npoints];
for (int i = 0; i < npoints; ++i)
RandomDirection(dirs[i]);
for (int i = 0; i < nvert; ++i) {
r = rmax;
if (i % 2 > 0 && !convex) r = rmin;
vertices[i].x = r * vecCore::math::Cos(i * phi);
vertices[i].y = r * vecCore::math::Sin(i * phi);
}
for (int i = 0; i < nsect; ++i) {
sections[i].fOrigin.Set(0, 0, -20. + i * 40. / (nsect - 1));
sections[i].fScale = 1;
}
std::cout << "Creating extruded polygon having " << nvert << " vertices and " << nsect << " sections\n";
UnplacedExtruded xtru(nvert, vertices, nsect, sections);
// Visualize the facets
#ifdef VECGEOM_ROOT
if (vis) {
Visualizer visualizer;
// Visualize bounding box
Vector3D<Precision> amin, amax;
xtru.Extent(amin, amax);
Vector3D<Precision> deltas = 0.5 * (amax - amin);
Vector3D<Precision> origin = 0.5 * (amax + amin);
SimpleBox box("bbox", deltas.x(), deltas.y(), deltas.z());
visualizer.AddVolume(box, Transformation3D(origin.x(), origin.y(), origin.z()));
// Visualize facets
for (size_t i = 0; i < xtru.GetStruct().fTslHelper.fFacets.size(); ++i)
AddFacetToVisualizer(xtru.GetStruct().fTslHelper.fFacets[i], visualizer);
// Visualize clusters
// for (unsigned icluster = 0; icluster < tsl.fClusters.size(); ++icluster)
// DrawCluster(tsl, icluster, visualizer, false);
TPolyMarker3D pm(npoints);
pm.SetMarkerColor(kRed);
pm.SetMarkerStyle(7);
// Test contains function
for (int i = 0; i < npoints; ++i) {
RandomPointInBBox(point, amin, amax);
bool contains = xtru.Contains(point);
if (contains) pm.SetNextPoint(point[0], point[1], point[2]);
}
delete[] dirs;
visualizer.AddPoints(pm);
visualizer.Show();
return 0;
}
#endif // VECGEOM_ROOT
#endif
return 0;
}
|
