Go to the documentation of this file.
39 int main(
int argc,
char *argv[])
66 Info<<
" bounding box (shifted) : " << shiftedBb <<
endl;
69 Info<<
"Initialised mesh in "
70 << runTime.cpuTimeIncrement() <<
" s" <<
endl;
82 for (
label i = 0; i < nReps - 1 ; i++)
86 Info<<
"indexed octree for " << i <<
endl;
91 Info<<
"Point:" << sample <<
" is in shape "
93 <<
", where the possible cells were:" <<
nl
97 Info<<
"Found in indexedOctree " << nReps <<
" times in "
98 << runTime.cpuTimeIncrement() <<
" s" <<
endl;
102 for (
label i = 0; i < nReps - 1 ; i++)
106 Info<<
"linear search for " << i <<
endl;
111 Info<<
"Point:" << sample <<
" is in cell "
114 Info<<
"Found in mesh.findCell " << nReps <<
" times in "
115 << runTime.cpuTimeIncrement() <<
" s" <<
endl;
static SLList< string > validArgs
A list of valid (mandatory) arguments.
cellDecomposition
Enumeration defining the decomposition of the cell for.
Standard boundBox + extra functionality for use in octree.
Ostream & endl(Ostream &os)
Add newline and flush stream.
List< treeBoundBox > meshBb(1, treeBoundBox(boundBox(coarseMesh.points(), false)).extend(rndGen, 1e-3))
Encapsulation of data needed to search in/for cells. Used to find the cell containing a point (e....
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
scalar typDim() const
Typical dimension length,height,width.
Non-pointer based hierarchical recursive searching.
label findInside(const point &) const
Find shape containing point. Only implemented for certain.
const boundBox & bounds() const
Return mesh bounding box.
int main(int argc, char *argv[])
label findCell(const point &p, const cellDecomposition=CELL_TETS) const
Find cell enclosing this location and return index.
const labelList & findIndices(const point &) const
Find the shape indices that occupy the result of findNode.
T argRead(const label index) const
Read a value from the argument at index.
dimensionedScalar cbrt(const dimensionedScalar &ds)
Foam::argList args(argc, argv)