p4est 2.8.6
p4est is a software library for parallel adaptive mesh refinement.
|
This structure contains complete mesh information on a 2:1 balanced forest. More...
#include <p4est_mesh.h>
Data Fields | |
p4est_locidx_t | local_num_quadrants |
number of process-local quadrants | |
p4est_locidx_t | ghost_num_quadrants |
number of ghost-layer quadrants | |
p4est_topidx_t * | quad_to_tree |
tree index for each local quad. More... | |
int * | ghost_to_proc |
processor for each ghost quad | |
p4est_locidx_t * | quad_to_quad |
one index for each of the 4 faces | |
int8_t * | quad_to_face |
encodes orientation/2:1 status | |
sc_array_t * | quad_to_half |
stores half-size neighbors | |
sc_array_t * | quad_level |
Stores lists of per-level quads. More... | |
p4est_locidx_t | local_num_corners |
tree-boundary corners | |
p4est_locidx_t * | quad_to_corner |
4 indices for each local quad | |
sc_array_t * | corner_offset |
local_num_corners + 1 entries | |
sc_array_t * | corner_quad |
corner_offset indexes into this | |
sc_array_t * | corner_corner |
and this one too (type int8_t) | |
p4est_mesh_params_t | params |
parameters the mesh was created with, e.g. More... | |
This structure contains complete mesh information on a 2:1 balanced forest.
It stores the locally relevant neighborhood, that is, all locally owned quadrants and one layer of adjacent ghost quadrants and their owners.
For each local quadrant, its tree number is stored in quad_to_tree. The quad_to_tree array is NULL by default and can be enabled using p4est_mesh_new_ext or p4est_mesh_new_params. For each ghost quadrant, its owner rank is stored in ghost_to_proc. For each level, an array of local quadrant numbers is stored in quad_level. The quad_level array is NULL by default and can be enabled using p4est_mesh_new_ext or p4est_mesh_new_params.
The quad_to_quad list stores one value for each local quadrant's face. This value is in 0..local_num_quadrants-1 for local quadrants, or in local_num_quadrants + (0..ghost_num_quadrants-1) for ghost quadrants.
The quad_to_face list has equally many entries that are either:
A quadrant on the boundary of the forest sees itself and its face number.
The quad_to_corner list stores corner neighbors that are not face neighbors. On the inside of a tree, there is precisely one such neighbor per corner. In this case, its index is encoded as described above for quad_to_quad. The neighbor's matching corner number is always diagonally opposite, that is, corner number ^ 3.
On the inside of an inter-tree face, we have precisely one corner neighbor. If a corner is an inter-tree corner, then the number of corner neighbors may be any non-negative number. In both cases, the quad_to_corner value is in local_num_quadrants + local_num_ghosts + [0 .. local_num_corners - 1]. After subtracting the number of local and ghost quadrants, it indexes into corner_offset, which encodes a group of corner neighbors. Each group contains the quadrant numbers encoded as usual for quad_to_quad in corner_quad, and the corner number from the neighbor as corner_corner.
Corners with no diagonal neighbor at all are assigned the value -3. This only happens on the domain boundary, which is necessarily a tree boundary. Corner-neighbors for hanging nodes are assigned the value -1.
The params struct describes the parameters the mesh was created with. For full control over the parameters, use p8est_mesh_new_params for mesh creation.
p4est_mesh_params_t p4est_mesh_t::params |
parameters the mesh was created with, e.g.
by passing them to p4est_mesh_new_ext or p4est_mesh_new_params
sc_array_t* p4est_mesh_t::quad_level |
Stores lists of per-level quads.
The array has entries indexed by 0..P4EST_QMAXLEVEL inclusive that are arrays of local quadrant ids. Is NULL if compute_level_lists in params is 0.
p4est_topidx_t* p4est_mesh_t::quad_to_tree |
tree index for each local quad.
Is NULL if compute_tree_index in params is 0.