internal::GridReordering3d::CheapEdge Struct Reference
List of all members.
Detailed Description
During building the connectivity information we don't need all the heavy duty information about edges that we will need later. So we can save memory and time by using a light-weight class for edges. It stores the two vertices, but no direction, so we make the optimization to store the vertex number in sorted order to allow for easier comparison of edge objects.
Constructor & Destructor Documentation
Constructor. Take the vertex numbers and store them sorted.
Member Function Documentation
bool internal::GridReordering3d::CheapEdge::operator< |
( |
const CheapEdge & |
e2 |
) |
const |
Need a partial ordering for the STL
Member Data Documentation
The documentation for this struct was generated from the following file: