Curvilinear volume mesh template.
More...
#include <MeshVizXLM/mesh/templates/MyVolumeMeshCurvilinear.h>
Public Member Functions | |
size_t | getNumCellsI () const |
size_t | getNumCellsJ () const |
size_t | getNumCellsK () const |
bool | hasDeadCells () const |
bool | isDead (size_t i, size_t j, size_t k) const |
size_t | getTimeStamp () const |
size_t | getNumCellsI () const |
size_t | getNumCellsJ () const |
size_t | getNumCellsK () const |
bool | hasDeadCells () const |
bool | isDead (size_t i, size_t j, size_t k) const |
size_t | getTimeStamp () const |
size_t | getNumCellsI () const |
size_t | getNumCellsJ () const |
size_t | getNumCellsK () const |
bool | hasDeadCells () const |
bool | isDead (size_t i, size_t j, size_t k) const |
size_t | getTimeStamp () const |
size_t | getNumCellsI () const |
size_t | getNumCellsJ () const |
size_t | getNumCellsK () const |
bool | hasDeadCells () const |
bool | isDead (size_t i, size_t j, size_t k) const |
size_t | getTimeStamp () const |
Header file to be completed including all required classes to define a curvilinear volume mesh with its associated scalar and vector sets.
Intended to help implement simple mesh. Just fill up the empty methods of the following classes (search for YOUR CODE HERE):
Hint: some should inherit both from MeshViz interfaces and the user's application data classes.
For advanced implementations, refer to the MiVolumeMeshCurvilinear interface. Class defining the topology of the mesh.
Header file to be completed including all required classes to define a rectilinear volume mesh with its associated scalar and vector sets.
Intended to help implement simple mesh. Just fill up the empty methods of the following classes (search for YOUR CODE HERE):
Hint: some should inherit both from MeshViz interfaces and the user's application data classes.
For advanced implementations, refer to the MiVolumeMeshRectilinear interface. Class defining the topology of the mesh.
Header file to be completed including all required classes to define a regular volume mesh with its associated scalar and vector sets.
Intended to help implement simple mesh. Just fill up the empty methods of the following classes (search for YOUR CODE HERE):
Hint: some should inherit both from MeshViz interfaces and the user's application data classes.
For advanced implementations, refer to the MiMeshRegular interface. Class defining the topology of the mesh.
Header file including all required classes to define a 3D grid of hexahedrons with its associated scalar and vector sets.
Intended to help implement simple mesh. Just fill up the empty methods of the following classes (search for YOUR CODE HERE):
Hint: some should inherit both from MeshViz interfaces and the user's application data classes.
For advanced implementations, refer to the MiVolumeMeshVertexHexahedronIjk interface. Class defining the topology of the mesh.
size_t MyTopologyIjk::getNumCellsI | ( | ) | const [inline, virtual] |
Returns the number of cells on the first logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsI | ( | ) | const [inline, virtual] |
Returns the number of cells on the first logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsI | ( | ) | const [inline, virtual] |
Returns the number of cells on the first logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsI | ( | ) | const [inline, virtual] |
Returns the number of cells on the first logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsJ | ( | ) | const [inline, virtual] |
Returns the number of cells on the second logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsJ | ( | ) | const [inline, virtual] |
Returns the number of cells on the second logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsJ | ( | ) | const [inline, virtual] |
Returns the number of cells on the second logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsJ | ( | ) | const [inline, virtual] |
Returns the number of cells on the second logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsK | ( | ) | const [inline, virtual] |
Returns the number of cells on the third logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsK | ( | ) | const [inline, virtual] |
Returns the number of cells on the third logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsK | ( | ) | const [inline, virtual] |
Returns the number of cells on the third logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getNumCellsK | ( | ) | const [inline, virtual] |
Returns the number of cells on the third logical axis.
Implements MiTopologyIjk.
size_t MyTopologyIjk::getTimeStamp | ( | ) | const [inline, virtual] |
Returns a time stamp on this topology.
Implements MiTopology.
size_t MyTopologyIjk::getTimeStamp | ( | ) | const [inline, virtual] |
Returns a time stamp on this topology.
Implements MiTopology.
size_t MyTopologyIjk::getTimeStamp | ( | ) | const [inline, virtual] |
Returns a time stamp on this topology.
Implements MiTopology.
size_t MyTopologyIjk::getTimeStamp | ( | ) | const [inline, virtual] |
Returns a time stamp on this topology.
Implements MiTopology.
bool MyTopologyIjk::hasDeadCells | ( | ) | const [inline, virtual] |
Returns true if the topology contains dead cells.
When false, the cells traversal can be optimized by not testing the isDead() method of each individual cells.
Reimplemented from MiTopology.
bool MyTopologyIjk::hasDeadCells | ( | ) | const [inline, virtual] |
Returns true if the topology contains dead cells.
When false, the cells traversal can be optimized by not testing the isDead() method of each individual cells.
Reimplemented from MiTopology.
bool MyTopologyIjk::hasDeadCells | ( | ) | const [inline, virtual] |
Returns true if the topology contains dead cells.
When false, the cells traversal can be optimized by not testing the isDead() method of each individual cells.
Reimplemented from MiTopology.
bool MyTopologyIjk::hasDeadCells | ( | ) | const [inline, virtual] |
Returns true if the topology contains dead cells.
When false, the cells traversal can be optimized by not testing the isDead() method of each individual cells.
Reimplemented from MiTopology.
bool MyTopologyIjk::isDead | ( | size_t | i, | |
size_t | j, | |||
size_t | k | |||
) | const [inline, virtual] |
Returns true if the cell of index (i,j,k) should be ignored.
This value is ignored if the hasDeadCell() method returns false.
(i,j,k) | the index of the cell to check |
Reimplemented from MiTopologyIjk.
bool MyTopologyIjk::isDead | ( | size_t | i, | |
size_t | j, | |||
size_t | k | |||
) | const [inline, virtual] |
Returns true if the cell of index (i,j,k) should be ignored.
This value is ignored if the hasDeadCell() method returns false.
(i,j,k) | the index of the cell to check |
Reimplemented from MiTopologyIjk.
bool MyTopologyIjk::isDead | ( | size_t | i, | |
size_t | j, | |||
size_t | k | |||
) | const [inline, virtual] |
Returns true if the cell of index (i,j,k) should be ignored.
This value is ignored if the hasDeadCell() method returns false.
(i,j,k) | the index of the cell to check |
Reimplemented from MiTopologyIjk.
bool MyTopologyIjk::isDead | ( | size_t | i, | |
size_t | j, | |||
size_t | k | |||
) | const [inline, virtual] |
Returns true if the cell of index (i,j,k) should be ignored.
This value is ignored if the hasDeadCell() method returns false.
(i,j,k) | the index of the cell to check |
Reimplemented from MiTopologyIjk.