![]() |
Reference documentation for deal.II version 8.1.0
|
#include <grid_reordering_internal.h>
Static Public Member Functions | |
static bool | orient_mesh (std::vector< CellData< 3 > > &incubes) |
Private Member Functions | |
Orienter (const std::vector< CellData< 3 > > &incubes) | |
bool | orient_edges () |
void | orient_cubes () |
bool | get_next_unoriented_cube () |
bool | is_oriented (const unsigned int cell_num) const |
bool | orient_edges_in_current_cube () |
bool | orient_edge_set_in_current_cube (const unsigned int edge_set) |
bool | orient_next_unoriented_edge () |
bool | cell_is_consistent (const unsigned int cell_num) const |
void | get_adjacent_cubes () |
bool | get_next_active_cube () |
Private Attributes | |
Mesh | mesh |
unsigned int | cur_posn |
unsigned int | marker_cube |
unsigned int | cur_edge_group |
std::vector< int > | sheet_to_process |
bool | edge_orient_array [12] |
The class that orients the edges of a triangulation in 3d. The member variables basically only store the present state of the algorithm.
Definition at line 687 of file grid_reordering_internal.h.
|
private |
Constructor. Take a list of cells and set up the internal data structures of the mesh member variable.
Since it is private, the only entry point of this class is the static function orient_mesh().
|
static |
Orient the given mesh. Creates an object of the present type and lets that toil away at the task.
This function is the single entry point to the functionality of this class.
Returns, whether a consistent orientation of lines was possible for the given mesh.
|
private |
Orient all the edges of a mesh.
Returns, whether this action was carried out successfully.
|
private |
Given oriented edges, rotate the cubes so that the edges are in standard direction.
Return whether the cell with cell number cell_num
is fully oriented.
|
private |
Return whether the cell is consistenty oriented at present (i.e. only considering those edges that are already oriented. This is a sanity check that should be called from inside an assert macro.
|
private |
Internal representation of the given list of cells, including connectivity information and the like.
Definition at line 717 of file grid_reordering_internal.h.
|
private |
The cube we're looking at presently.
Definition at line 723 of file grid_reordering_internal.h.
|
private |
We have fully oriented all cubes before this one.
Definition at line 729 of file grid_reordering_internal.h.
|
private |
The index of the sheet or equivalence class we are presently processing.
Definition at line 736 of file grid_reordering_internal.h.
|
private |
Indices of the cells to be processed within the present sheet. If a cell is being processed presently, it is taken from this list.
Definition at line 746 of file grid_reordering_internal.h.
|
private |
Which edges of the current cell have been oriented during the current iteration. Is reset when moving on to the next cube.
Definition at line 756 of file grid_reordering_internal.h.