Go to the documentation of this file.
40 int main(
int argc,
char *argv[])
47 fileName sFeatFileName(
"unit_cube_rotated.extendedFeatureEdgeMesh");
54 runTime.time().constant(),
55 "extendedFeatureEdgeMesh",
69 bb.
min() -=
point(ROOTVSMALL, ROOTVSMALL, ROOTVSMALL);
70 bb.
max() +=
point(ROOTVSMALL, ROOTVSMALL, ROOTVSMALL);
92 Info<<
"Find edge labels within sphere from point (0, 0, 0):" <<
endl;
94 Info<<
" Radius = 0 : "
97 Info<<
" Radius = 1 : "
100 Info<<
" Radius = root(1.5) : "
103 Info<<
" Radius = root(2) : "
106 Info<<
" Radius = root(0.5) : "
109 Info<<
" Radius = root(0.25) : "
113 Info<<
" Box = " << tbb <<
" : "
117 Info<<
" Box = " << tbb1 <<
" : "
121 Info<<
" Box = " << tbb2 <<
" : "
125 Info<<
" Box = " << tbb3 <<
" : "
IOobject defines the attributes of an object for which implicit objectRegistry management is supporte...
A class for handling file names.
const point & max() const
Maximum describing the bounding box.
Standard boundBox + extra functionality for use in octree.
Ostream & endl(Ostream &os)
Add newline and flush stream.
int main(int argc, char *argv[])
void findBox(const label nodeI, const treeBoundBox &searchBox, labelHashSet &elements) const
Find all elements intersecting box.
const pointField & points() const
Return points.
Non-pointer based hierarchical recursive searching.
Holds data for octree to work on an edges subset.
const point & min() const
Minimum describing the bounding box.
const edgeList & edges() const
Return edges.
labelList identity(const label len)
Create identity map (map[i] == i) of given length.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void size(const label)
Override size to be inconsistent with allocated storage.
vector point
Point is a vector.
void findSphere(const label nodeI, const point ¢re, const scalar radiusSqr, labelHashSet &elements) const
Find all elements intersecting sphere.