searchingEngine.H
Go to the documentation of this file.
1 randomGenerator rndGen(653213);
2 
3 // Determine mesh bounding boxes:
4 List<treeBoundBox> meshBb
5 (
6  1,
7  treeBoundBox
8  (
9  boundBox(coarseMesh.points(), false)
10  ).extend(1e-3)
11 );
12 
13 // Dummy bounds dictionary
14 dictionary dict;
15 dict.add("bounds", meshBb);
16 dict.add
17 (
18  "distributionType",
19  distributedTriSurfaceMesh::distributionTypeNames_
20  [
21  distributedTriSurfaceMesh::FROZEN
22  ]
23 );
24 dict.add("mergeDistance", small);
25 
28 {
29  const polyPatch& pp = patches[patchi];
30  if (!pp.coupled() && !isA<emptyPolyPatch>(pp))
31  {
32  includePatches.insert(patchi);
33  }
34 }
35 
37 
38 const triSurface localSurface = triangulate
39 (
40  patches,
42  finalAgglom,
44  globalNumbering,
45  coarsePatches
46 );
47 
48 
49 distributedTriSurfaceMesh surfacesMesh
50 (
51  IOobject
52  (
53  "wallSurface.stl",
54  runTime.constant(),
55  searchableSurface::geometryDir(runTime),
56  runTime,
57  IOobject::NO_READ,
58  IOobject::NO_WRITE
59  ),
61  dict
62 );
63 
64 
66 
67 //surfacesMesh.searchableSurface::write();
68 
label patchi
const fvPatchList & patches
const dimensionedScalar e
Elementary charge.
List< label > labelList
A List of labels.
Definition: labelList.H:56
HashSet< label, Hash< label > > labelHashSet
A HashSet with label keys.
Definition: HashSet.H:213
List< treeBoundBox > meshBb(1, treeBoundBox(boundBox(coarseMesh.points(), false)).extend(1e-3))
forAll(patches, patchi)
labelHashSet includePatches
dictionary dict
labelList triSurfaceToAgglom(5 *nFineFaces)
const triSurface localSurface
randomGenerator rndGen(653213)
distributedTriSurfaceMesh surfacesMesh(IOobject("wallSurface.stl", runTime.constant(), searchableSurface::geometryDir(runTime), runTime, IOobject::NO_READ, IOobject::NO_WRITE), localSurface, dict)