Definition at line 1221 of file BSPTree.cpp.
◆ BoxPlaneIter() [1/2]
moab::BoxPlaneIter::BoxPlaneIter |
( |
const double |
coords[8][3] | ) |
|
Definition at line 1251 of file BSPTree.cpp.
1255 assert(
sizeof( CartVect ) ==
sizeof( coords[0] ) );
1256 const CartVect* corners =
reinterpret_cast< const CartVect*
>( coords );
1257 for(
int i = 0; i < 6; ++i )
1260 CartVect v1 = corners[indices[1]] - corners[indices[0]];
1261 CartVect v2 = corners[indices[3]] - corners[indices[0]];
1262 CartVect n = v1 * v2;
1263 facePlanes[i] = BSPTree::Plane( n.array(), -( n % corners[indices[2]] ) );
References moab::CartVect::array(), moab::box_face_corners, and facePlanes.
◆ BoxPlaneIter() [2/2]
moab::BoxPlaneIter::BoxPlaneIter |
( |
| ) |
|
|
inline |
◆ operator!=()
bool moab::BoxPlaneIter::operator!= |
( |
const BoxPlaneIter & |
other | ) |
const |
|
inline |
◆ operator++()
◆ operator->()
◆ operator==()
bool moab::BoxPlaneIter::operator== |
( |
const BoxPlaneIter & |
other | ) |
const |
|
inline |
◆ faceNum
int moab::BoxPlaneIter::faceNum |
|
private |
◆ facePlanes
The documentation for this class was generated from the following file: