p4est
2.8.643-dbc7-dirty
p4est is a software library for parallel adaptive mesh refinement.
|
The coarse topological description of the forest. More...
Go to the source code of this file.
Data Structures | |
struct | p4est_connectivity |
This structure holds the 2D inter-tree connectivity information. More... | |
struct | p4est_corner_transform_t |
struct | p4est_corner_info_t |
struct | p4est_neighbor_transform_t |
Generic interface for transformations beteen a tree and any of its neighbors. More... | |
Macros | |
#define | P4EST_DIM 2 |
The spatial dimension. | |
#define | P4EST_FACES (2 * P4EST_DIM) |
The number of faces of a quadrant. | |
#define | P4EST_CHILDREN 4 |
The number of children of a quadrant. More... | |
#define | P4EST_HALF (P4EST_CHILDREN / 2) |
The number of children/corners touching one face. | |
#define | P4EST_INSUL 9 |
The size of insulation layer. | |
#define | P4EST_ONLY_P8_LAND(x) |
Only use logical AND term in 3D. | |
#define | P4EST_ONLY_P8_COMMA(x) |
Only use comma and expression in 3D. | |
#define | P4EST_DIM_POW(a) ((a) * (a)) |
Exponentiate with dimension. | |
#define | P4EST_FTRANSFORM 9 |
#define | P4EST_STRING "p4est" |
p4est identification string | |
#define | P4EST_ONDISK_FORMAT 0x2000009 |
Typedefs | |
typedef struct p4est_connectivity | p4est_connectivity_t |
This structure holds the 2D inter-tree connectivity information. More... | |
Enumerations | |
enum | p4est_connect_type_t { P4EST_CONNECT_SELF = 20 , P4EST_CONNECT_FACE = 21 , P4EST_CONNECT_CORNER = 22 , P4EST_CONNECT_FULL = P4EST_CONNECT_CORNER } |
Characterize a type of adjacency. More... | |
enum | p4est_connectivity_encode_t { P4EST_CONN_ENCODE_NONE = SC_IO_ENCODE_NONE , P4EST_CONN_ENCODE_LAST } |
Typedef for serialization method. More... | |
Functions | |
int | p4est_connect_type_int (p4est_connect_type_t btype) |
Convert the p4est_connect_type_t into a number. More... | |
const char * | p4est_connect_type_string (p4est_connect_type_t btype) |
Convert the p4est_connect_type_t into a const string. More... | |
size_t | p4est_connectivity_memory_used (p4est_connectivity_t *conn) |
Calculate memory usage of a connectivity structure. More... | |
void | p4est_neighbor_transform_coordinates (const p4est_neighbor_transform_t *nt, const p4est_qcoord_t self_coords[P4EST_DIM], p4est_qcoord_t neigh_coords[P4EST_DIM]) |
Transform from self's coordinate system to neighbor's coordinate system. More... | |
void | p4est_neighbor_transform_coordinates_reverse (const p4est_neighbor_transform_t *nt, const p4est_qcoord_t neigh_coords[P4EST_DIM], p4est_qcoord_t self_coords[P4EST_DIM]) |
Transform from neighbor's coordinate system to self's coordinate system. More... | |
void | p4est_connectivity_get_neighbor_transforms (p4est_connectivity_t *conn, p4est_topidx_t tree_id, p4est_connect_type_t boundary_type, int boundary_index, sc_array_t *neighbor_transform_array) |
int | p4est_connectivity_face_neighbor_face_corner (int fc, int f, int nf, int o) |
Transform a face corner across one of the adjacent faces into a neighbor tree. More... | |
int | p4est_connectivity_face_neighbor_corner (int c, int f, int nf, int o) |
Transform a corner across one of the adjacent faces into a neighbor tree. More... | |
p4est_connectivity_t * | p4est_connectivity_new (p4est_topidx_t num_vertices, p4est_topidx_t num_trees, p4est_topidx_t num_corners, p4est_topidx_t num_ctt) |
Allocate a connectivity structure. More... | |
p4est_connectivity_t * | p4est_connectivity_new_copy (p4est_topidx_t num_vertices, p4est_topidx_t num_trees, p4est_topidx_t num_corners, const double *vertices, const p4est_topidx_t *ttv, const p4est_topidx_t *ttt, const int8_t *ttf, const p4est_topidx_t *ttc, const p4est_topidx_t *coff, const p4est_topidx_t *ctt, const int8_t *ctc) |
Allocate a connectivity structure and populate from constants. More... | |
p4est_connectivity_t * | p4est_connectivity_bcast (p4est_connectivity_t *conn_in, int root, sc_MPI_Comm comm) |
Broadcast a connectivity structure that exists only on one process to all. More... | |
void | p4est_connectivity_destroy (p4est_connectivity_t *connectivity) |
Destroy a connectivity structure. More... | |
void | p4est_connectivity_set_attr (p4est_connectivity_t *conn, size_t bytes_per_tree) |
Allocate or free the attribute fields in a connectivity. More... | |
int | p4est_connectivity_is_valid (p4est_connectivity_t *connectivity) |
Examine a connectivity structure. More... | |
int | p4est_connectivity_is_equal (p4est_connectivity_t *conn1, p4est_connectivity_t *conn2) |
Check two connectivity structures for equality. More... | |
int | p4est_connectivity_sink (p4est_connectivity_t *conn, sc_io_sink_t *sink) |
Write connectivity to a sink object. More... | |
sc_array_t * | p4est_connectivity_deflate (p4est_connectivity_t *conn, p4est_connectivity_encode_t code) |
Allocate memory and store the connectivity information there. More... | |
int | p4est_connectivity_save (const char *filename, p4est_connectivity_t *connectivity) |
Save a connectivity structure to disk. More... | |
p4est_connectivity_t * | p4est_connectivity_source (sc_io_source_t *source) |
Read connectivity from a source object. More... | |
p4est_connectivity_t * | p4est_connectivity_inflate (sc_array_t *buffer) |
Create new connectivity from a memory buffer. More... | |
p4est_connectivity_t * | p4est_connectivity_load (const char *filename, size_t *bytes) |
Load a connectivity structure from disk. More... | |
p4est_connectivity_t * | p4est_connectivity_new_unitsquare (void) |
Create a connectivity structure for the unit square. | |
p4est_connectivity_t * | p4est_connectivity_new_periodic (void) |
Create a connectivity structure for an all-periodic unit square. | |
p4est_connectivity_t * | p4est_connectivity_new_rotwrap (void) |
Create a connectivity structure for a periodic unit square. More... | |
p4est_connectivity_t * | p4est_connectivity_new_twotrees (int l_face, int r_face, int orientation) |
Create a connectivity structure for two trees being rotated w.r.t. More... | |
p4est_connectivity_t * | p4est_connectivity_new_corner (void) |
Create a connectivity structure for a three-tree mesh around a corner. | |
p4est_connectivity_t * | p4est_connectivity_new_pillow (void) |
Create a connectivity structure for two trees on top of each other. | |
p4est_connectivity_t * | p4est_connectivity_new_moebius (void) |
Create a connectivity structure for a five-tree moebius band. | |
p4est_connectivity_t * | p4est_connectivity_new_star (void) |
Create a connectivity structure for a six-tree star. | |
p4est_connectivity_t * | p4est_connectivity_new_cubed (void) |
Create a connectivity structure for the six sides of a unit cube. More... | |
p4est_connectivity_t * | p4est_connectivity_new_disk_nonperiodic (void) |
Create a connectivity structure for a five-tree flat spherical disk. More... | |
p4est_connectivity_t * | p4est_connectivity_new_disk (int periodic_a, int periodic_b) |
Create a connectivity structure for a five-tree flat spherical disk. More... | |
p4est_connectivity_t * | p4est_connectivity_new_icosahedron () |
Create a connectivity for mapping the sphere using an icosahedron. More... | |
p4est_connectivity_t * | p4est_connectivity_new_shell2d (void) |
Create a connectivity structure that builds a 2d spherical shell. More... | |
p4est_connectivity_t * | p4est_connectivity_new_disk2d (void) |
Create a connectivity structure that maps a 2d disk. More... | |
p4est_connectivity_t * | p4est_connectivity_new_brick (int mi, int ni, int periodic_a, int periodic_b) |
A rectangular m by n array of trees with configurable periodicity. More... | |
p4est_connectivity_t * | p4est_connectivity_new_byname (const char *name) |
Create connectivity structure from predefined catalogue. More... | |
p4est_connectivity_t * | p4est_connectivity_refine (p4est_connectivity_t *conn, int num_per_edge) |
Uniformly refine a connectivity. More... | |
void | p4est_expand_face_transform (int iface, int nface, int ftransform[]) |
Fill an array with the axis combination of a face neighbor transform. More... | |
p4est_topidx_t | p4est_find_face_transform (p4est_connectivity_t *connectivity, p4est_topidx_t itree, int iface, int ftransform[]) |
Fill an array with the axis combinations of a tree neighbor transform. More... | |
void | p4est_find_corner_transform (p4est_connectivity_t *connectivity, p4est_topidx_t itree, int icorner, p4est_corner_info_t *ci) |
Fills an array with information about corner neighbors. More... | |
void | p4est_connectivity_complete (p4est_connectivity_t *conn) |
Internally connect a connectivity based on tree_to_vertex information. More... | |
void | p4est_connectivity_reduce (p4est_connectivity_t *conn) |
Removes corner information of a connectivity such that enough information is left to run p4est_connectivity_complete successfully. More... | |
void | p4est_connectivity_permute (p4est_connectivity_t *conn, sc_array_t *perm, int is_current_to_new) |
p4est_connectivity_permute Given a permutation perm of the trees in a connectivity conn, permute the trees of conn in place and update conn to match. More... | |
void | p4est_connectivity_join_faces (p4est_connectivity_t *conn, p4est_topidx_t tree_left, p4est_topidx_t tree_right, int face_left, int face_right, int orientation) |
p4est_connectivity_join_faces This function takes an existing valid connectivity conn and modifies it by joining two tree faces that are currently boundary faces. More... | |
int | p4est_connectivity_is_equivalent (p4est_connectivity_t *conn1, p4est_connectivity_t *conn2) |
p4est_connectivity_is_equivalent This function compares two connectivities for equivalence: it returns true if they are the same connectivity, or if they have the same topology. More... | |
int | p4est_connectivity_read_inp_stream (FILE *stream, p4est_topidx_t *num_vertices, p4est_topidx_t *num_trees, double *vertices, p4est_topidx_t *tree_to_vertex) |
Read an ABAQUS input file from a file stream. More... | |
p4est_connectivity_t * | p4est_connectivity_read_inp (const char *filename) |
Create a p4est connectivity from an ABAQUS input file. More... | |
Variables | |
const int | p4est_face_corners [4][2] |
Store the corner numbers 0..4 for each tree face. | |
const int | p4est_face_dual [4] |
Store the face numbers in the face neighbor's system. | |
const int | p4est_corner_faces [4][2] |
Store the face numbers 0..3 for each tree corner. | |
const int | p4est_corner_face_corners [4][4] |
Store the face corner numbers for the faces touching a tree corner. | |
const int | p4est_child_corner_faces [4][4] |
Store the faces for each child and corner, can be -1. | |
The coarse topological description of the forest.
#define P4EST_CHILDREN 4 |
The number of children of a quadrant.
also the number of corners
typedef struct p4est_connectivity p4est_connectivity_t |
This structure holds the 2D inter-tree connectivity information.
Identification of arbitrary faces and corners is possible.
The arrays tree_to_* are stored in z ordering. For corners the order wrt. yx is 00 01 10 11. For faces the order is -x +x -y +y. They are allocated [0][0]..[0][3]..[num_trees-1][0]..[num_trees-1][3].
The values for tree_to_face are 0..7 where ttf % 4 gives the face number and ttf / 4 the face orientation code. The orientation is 0 for edges that are aligned in z-order, and 1 for edges that are running opposite in z-order.
It is valid to specify num_vertices as 0. In this case vertices and tree_to_vertex are set to NULL. Otherwise the vertex coordinates are stored in the array vertices as [0][0]..[0][2]..[num_vertices-1][0]..[num_vertices-1][2].
The corners are only stored when they connect trees. In this case tree_to_corner indexes into ctt_offset. Otherwise the tree_to_corner entry must be -1 and this corner is ignored. If num_corners == 0, tree_to_corner and corner_to_* arrays are set to NULL.
The arrays corner_to_* store a variable number of entries per corner. For corner c these are at position [ctt_offset[c]]..[ctt_offset[c+1]-1]. Their number for corner c is ctt_offset[c+1] - ctt_offset[c]. The entries encode all trees adjacent to corner c. The size of the corner_to_* arrays is num_ctt = ctt_offset[num_corners].
The *_to_attr arrays may have arbitrary contents defined by the user.
enum p4est_connect_type_t |
Characterize a type of adjacency.
Several functions involve relationships between neighboring trees and/or quadrants, and their behavior depends on how one defines adjacency: 1) entities are adjacent if they share a face, or 2) entities are adjacent if they share a face or corner. p4est_connect_type_t is used to choose the desired behavior. This enum must fit into an int8_t.
int p4est_connect_type_int | ( | p4est_connect_type_t | btype | ) |
Convert the p4est_connect_type_t into a number.
[in] | btype | The balance type to convert. |
const char* p4est_connect_type_string | ( | p4est_connect_type_t | btype | ) |
Convert the p4est_connect_type_t into a const string.
[in] | btype | The balance type to convert. |
p4est_connectivity_t* p4est_connectivity_bcast | ( | p4est_connectivity_t * | conn_in, |
int | root, | ||
sc_MPI_Comm | comm | ||
) |
Broadcast a connectivity structure that exists only on one process to all.
On the other processors, it will be allocated using p4est_connectivity_new.
[in] | conn_in | For the root process the connectivity to be broadcast, for the other processes it must be NULL. |
[in] | root | The rank of the process that provides the connectivity. |
[in] | comm | The MPI communicator. |
void p4est_connectivity_complete | ( | p4est_connectivity_t * | conn | ) |
Internally connect a connectivity based on tree_to_vertex information.
Periodicity that is not inherent in the list of vertices will be lost.
[in,out] | conn | The connectivity needs to have proper vertices and tree_to_vertex fields. The tree_to_tree and tree_to_face fields must be allocated and satisfy p4est_connectivity_is_valid (conn) but will be overwritten. The corner fields will be freed and allocated anew. |
sc_array_t* p4est_connectivity_deflate | ( | p4est_connectivity_t * | conn, |
p4est_connectivity_encode_t | code | ||
) |
Allocate memory and store the connectivity information there.
[in] | conn | The connectivity structure to be exported to memory. |
[in] | code | Encoding and compression method for serialization. |
void p4est_connectivity_destroy | ( | p4est_connectivity_t * | connectivity | ) |
Destroy a connectivity structure.
Also destroy all attributes.
int p4est_connectivity_face_neighbor_corner | ( | int | c, |
int | f, | ||
int | nf, | ||
int | o | ||
) |
Transform a corner across one of the adjacent faces into a neighbor tree.
This version expects the neighbor face and orientation separately.
[in] | c | A corner number in 0..3. |
[in] | f | A face number that touches the corner c. |
[in] | nf | A neighbor face that is on the other side of f. |
[in] | o | The orientation between tree boundary faces f and nf. |
int p4est_connectivity_face_neighbor_face_corner | ( | int | fc, |
int | f, | ||
int | nf, | ||
int | o | ||
) |
Transform a face corner across one of the adjacent faces into a neighbor tree.
This version expects the neighbor face and orientation separately.
[in] | fc | A face corner number in 0..1. |
[in] | f | A face that the face corner number fc is relative to. |
[in] | nf | A neighbor face that is on the other side of f. |
[in] | o | The orientation between tree boundary faces f and nf. |
p4est_connectivity_t* p4est_connectivity_inflate | ( | sc_array_t * | buffer | ) |
Create new connectivity from a memory buffer.
This function aborts on malloc errors.
[in] | buffer | The connectivity is created from this memory buffer. |
int p4est_connectivity_is_equal | ( | p4est_connectivity_t * | conn1, |
p4est_connectivity_t * | conn2 | ||
) |
Check two connectivity structures for equality.
int p4est_connectivity_is_equivalent | ( | p4est_connectivity_t * | conn1, |
p4est_connectivity_t * | conn2 | ||
) |
p4est_connectivity_is_equivalent This function compares two connectivities for equivalence: it returns true if they are the same connectivity, or if they have the same topology.
The definition of topological sameness is strict: there is no attempt made to determine whether permutation and/or rotation of the trees makes the connectivities equivalent.
[in] | conn1 | a valid connectivity |
[out] | conn2 | a valid connectivity |
int p4est_connectivity_is_valid | ( | p4est_connectivity_t * | connectivity | ) |
Examine a connectivity structure.
void p4est_connectivity_join_faces | ( | p4est_connectivity_t * | conn, |
p4est_topidx_t | tree_left, | ||
p4est_topidx_t | tree_right, | ||
int | face_left, | ||
int | face_right, | ||
int | orientation | ||
) |
p4est_connectivity_join_faces This function takes an existing valid connectivity conn and modifies it by joining two tree faces that are currently boundary faces.
[in,out] | conn | connectivity that will be altered. |
[in] | tree_left | tree that will be on the left side of the joined faces. |
[in] | tree_right | tree that will be on the right side of the joined faces. |
[in] | face_left | face of tree_left that will be joined. |
[in] | face_right | face of tree_right that will be joined. |
[in] | orientation | the orientation of face_left and face_right once joined (see the description of p4est_connectivity_t to understand orientation). |
p4est_connectivity_t* p4est_connectivity_load | ( | const char * | filename, |
size_t * | bytes | ||
) |
Load a connectivity structure from disk.
[in] | filename | Name of the file to read. |
[in,out] | bytes | Size in bytes of connectivity on disk or NULL. |
size_t p4est_connectivity_memory_used | ( | p4est_connectivity_t * | conn | ) |
Calculate memory usage of a connectivity structure.
[in] | conn | Connectivity structure. |
p4est_connectivity_t* p4est_connectivity_new | ( | p4est_topidx_t | num_vertices, |
p4est_topidx_t | num_trees, | ||
p4est_topidx_t | num_corners, | ||
p4est_topidx_t | num_ctt | ||
) |
Allocate a connectivity structure.
The attribute fields are initialized to NULL.
[in] | num_vertices | Number of total vertices (i.e. geometric points). |
[in] | num_trees | Number of trees in the forest. |
[in] | num_corners | Number of tree-connecting corners. |
[in] | num_ctt | Number of total trees in corner_to_tree array. |
p4est_connectivity_t* p4est_connectivity_new_brick | ( | int | mi, |
int | ni, | ||
int | periodic_a, | ||
int | periodic_b | ||
) |
A rectangular m by n array of trees with configurable periodicity.
The brick is periodic in x and y if periodic_a and periodic_b are true, respectively.
p4est_connectivity_t* p4est_connectivity_new_byname | ( | const char * | name | ) |
Create connectivity structure from predefined catalogue.
[in] | name | Invokes connectivity_new_* function. brick23 brick (2, 3, 0, 0) corner corner cubed cubed disk disk moebius moebius periodic periodic pillow pillow rotwrap rotwrap star star unit unitsquare |
p4est_connectivity_t* p4est_connectivity_new_copy | ( | p4est_topidx_t | num_vertices, |
p4est_topidx_t | num_trees, | ||
p4est_topidx_t | num_corners, | ||
const double * | vertices, | ||
const p4est_topidx_t * | ttv, | ||
const p4est_topidx_t * | ttt, | ||
const int8_t * | ttf, | ||
const p4est_topidx_t * | ttc, | ||
const p4est_topidx_t * | coff, | ||
const p4est_topidx_t * | ctt, | ||
const int8_t * | ctc | ||
) |
Allocate a connectivity structure and populate from constants.
The attribute fields are initialized to NULL.
[in] | num_vertices | Number of total vertices (i.e. geometric points). |
[in] | num_trees | Number of trees in the forest. |
[in] | num_corners | Number of tree-connecting corners. |
[in] | coff | Corner-to-tree offsets (num_corners + 1 values). This must always be non-NULL; in trivial cases it is just a pointer to a p4est_topix value of 0. |
p4est_connectivity_t* p4est_connectivity_new_cubed | ( | void | ) |
Create a connectivity structure for the six sides of a unit cube.
The ordering of the trees is as follows: 0 1 2 3 <– 3: axis-aligned top side 4 5. This choice has been made for maximum symmetry (see tree_to_* in .c file).
p4est_connectivity_t* p4est_connectivity_new_disk | ( | int | periodic_a, |
int | periodic_b | ||
) |
Create a connectivity structure for a five-tree flat spherical disk.
This disk can just as well be used as a square to test non-Cartesian maps. Without any mapping this connectivity covers the square [-3, 3]**2.
The ordering of the trees is as follows: 4 1 2 3 0.
The outside x faces may be identified topologically. The outside y faces may be identified topologically. Both identifications may be specified simultaneously. The general shape and periodicity are the same as those obtained with p4est_connectivity_new_brick (1, 1, periodic_a, periodic_b).
When setting periodic_a and periodic_b to false, the result is the same as that of p4est_connectivity_new_disk_nonperiodic.
[in] | periodic_a | Bool to make disk periodic in x direction. |
[in] | periodic_b | Bool to make disk periodic in y direction. |
p4est_connectivity_t* p4est_connectivity_new_disk2d | ( | void | ) |
Create a connectivity structure that maps a 2d disk.
This is a 5 trees connectivity meant to be used together with p4est_geometry_new_disk2d to map the disk.
p4est_connectivity_t* p4est_connectivity_new_disk_nonperiodic | ( | void | ) |
Create a connectivity structure for a five-tree flat spherical disk.
This disk can just as well be used as a square to test non-Cartesian maps. Without any mapping this connectivity covers the square [-3, 3]**2.
p4est_connectivity_t* p4est_connectivity_new_icosahedron | ( | ) |
Create a connectivity for mapping the sphere using an icosahedron.
The regular icosadron is a polyhedron with 20 faces, each of which is an equilateral triangle. To build the p4est connectivity, we group faces 2 by 2 to from 10 quadrangles, and thus 10 trees.
This connectivity is meant to be used together with p4est_geometry_new_icosahedron to map the sphere.
The flat connectivity looks like that: Vextex numbering:
A00 A01 A02 A03 A04 / \ / \ / \ / \ / \ A05—A06—A07—A08—A09—A10 \ / \ / \ / \ / \ / \ A11—A12—A13—A14—A15—A16 \ / \ / \ / \ / \ / A17 A18 A19 A20 A21
Origin in A05.
Tree numbering:
0 2 4 6 8 1 3 5 7 9
p4est_connectivity_t* p4est_connectivity_new_rotwrap | ( | void | ) |
Create a connectivity structure for a periodic unit square.
The left and right faces are identified, and bottom and top opposite.
p4est_connectivity_t* p4est_connectivity_new_shell2d | ( | void | ) |
Create a connectivity structure that builds a 2d spherical shell.
p4est_connectivity_t* p4est_connectivity_new_twotrees | ( | int | l_face, |
int | r_face, | ||
int | orientation | ||
) |
Create a connectivity structure for two trees being rotated w.r.t.
each other in a user-defined way
[in] | l_face | index of left face |
[in] | r_face | index of right face |
[in] | orientation | orientation of trees w.r.t. each other |
void p4est_connectivity_permute | ( | p4est_connectivity_t * | conn, |
sc_array_t * | perm, | ||
int | is_current_to_new | ||
) |
p4est_connectivity_permute Given a permutation perm of the trees in a connectivity conn, permute the trees of conn in place and update conn to match.
[in,out] | conn | The connectivity whose trees are permuted. |
[in] | perm | A permutation array, whose elements are size_t's. |
[in] | is_current_to_new | if true, the jth entry of perm is the new index for the entry whose current index is j, otherwise the jth entry of perm is the current index of the tree whose index will be j after the permutation. |
p4est_connectivity_t* p4est_connectivity_read_inp | ( | const char * | filename | ) |
Create a p4est connectivity from an ABAQUS input file.
This utility function reads a basic ABAQUS file supporting element type with the prefix C2D4, CPS4, and S4 in 2D and of type C3D8 reading them as bilinear quadrilateral and trilinear hexahedral trees respectively.
A basic 2D mesh is given below. The *Node
section gives the vertex number and x, y, and z components for each vertex. The *Element
section gives the 4 vertices in 2D (8 vertices in 3D) of each element in counter clockwise order. So in 2D the nodes are given as:
4 3 +----------------—+
+----------------—+ 1 2
and in 3D they are given as:
8 7 +------------------—+ |\ |\ | \ | \ | \ | \ | \ | \ | 5+------------------—+6 | | | | +-—|-------------—+ | 4\ | 3 \ | \ | \ | \ | \ | | | +------------------—+ 1 2
This function reads a mesh from filename and returns an associated p4est connectivity.
[in] | filename | file to read the connectivity from |
int p4est_connectivity_read_inp_stream | ( | FILE * | stream, |
p4est_topidx_t * | num_vertices, | ||
p4est_topidx_t * | num_trees, | ||
double * | vertices, | ||
p4est_topidx_t * | tree_to_vertex | ||
) |
Read an ABAQUS input file from a file stream.
This utility function reads a basic ABAQUS file supporting element type with the prefix C2D4, CPS4, and S4 in 2D and of type C3D8 reading them as bilinear quadrilateral and trilinear hexahedral trees respectively.
A basic 2D mesh is given below. The *Node
section gives the vertex number and x, y, and z components for each vertex. The *Element
section gives the 4 vertices in 2D (8 vertices in 3D) of each element in counter clockwise order. So in 2D the nodes are given as:
4 3 +----------------—+
+----------------—+ 1 2
and in 3D they are given as:
8 7 +------------------—+ |\ |\ | \ | \ | \ | \ | \ | \ | 5+------------------—+6 | | | | +-—|-------------—+ | 4\ | 3 \ | \ | \ | \ | \ | | | +------------------—+ 1 2
This code can be called two ways. The first, when vertex==NULL
and tree_to_vertex==NULL
, is used to count the number of trees and vertices in the connectivity to be generated by the .inp mesh in the stream. The second, when
vertices!=NULL
and tree_to_vertex!=NULL
, fill vertices
and tree_to_vertex
. In this case num_vertices
and num_trees
need to be set to the maximum number of entries allocated in vertices
and tree_to_vertex
.
[in,out] | stream | file stream to read the connectivity from |
[in,out] | num_vertices | the number of vertices in the connectivity |
[in,out] | num_trees | the number of trees in the connectivity |
[out] | vertices | the list of vertices of the connectivity |
[out] | tree_to_vertex | the tree_to_vertex map of the connectivity |
void p4est_connectivity_reduce | ( | p4est_connectivity_t * | conn | ) |
Removes corner information of a connectivity such that enough information is left to run p4est_connectivity_complete successfully.
The reduced connectivity still passes p4est_connectivity_is_valid.
[in,out] | conn | The connectivity to be reduced. |
p4est_connectivity_t* p4est_connectivity_refine | ( | p4est_connectivity_t * | conn, |
int | num_per_edge | ||
) |
Uniformly refine a connectivity.
This is useful if you would like to uniformly refine by something other than a power of 2.
[in] | conn | A valid connectivity |
[in] | num_per_edge | The number of new trees in each direction. Must use no more than P4EST_OLD_QMAXLEVEL bits. |
int p4est_connectivity_save | ( | const char * | filename, |
p4est_connectivity_t * | connectivity | ||
) |
Save a connectivity structure to disk.
[in] | filename | Name of the file to write. |
[in] | connectivity | Valid connectivity structure. |
void p4est_connectivity_set_attr | ( | p4est_connectivity_t * | conn, |
size_t | bytes_per_tree | ||
) |
Allocate or free the attribute fields in a connectivity.
[in,out] | conn | The conn->*_to_attr fields must either be NULL or previously be allocated by this function. |
[in] | bytes_per_tree | If 0, tree_to_attr is freed (being NULL is ok). If positive, requested space is allocated. |
int p4est_connectivity_sink | ( | p4est_connectivity_t * | conn, |
sc_io_sink_t * | sink | ||
) |
Write connectivity to a sink object.
[in] | conn | The connectivity to be written. |
[in,out] | sink | The connectivity is written into this sink. |
p4est_connectivity_t* p4est_connectivity_source | ( | sc_io_source_t * | source | ) |
Read connectivity from a source object.
[in,out] | source | The connectivity is read from this source. |
void p4est_expand_face_transform | ( | int | iface, |
int | nface, | ||
int | ftransform[] | ||
) |
Fill an array with the axis combination of a face neighbor transform.
[in] | iface | The number of the originating face. |
[in] | nface | Encoded as nface = r * 4 + nf, where nf = 0..3 is the neigbbor's connecting face number and r = 0..1 is the relative orientation to the neighbor's face. This encoding matches p4est_connectivity_t. |
[out] | ftransform | This array holds 9 integers. [0,2] The coordinate axis sequence of the origin face, the first referring to the tangential and the second to the normal. A permutation of (0, 1). [3,5] The coordinate axis sequence of the target face. [6,8] Edge reversal flag for tangential axis (boolean); face code in [0, 3] for the normal coordinate q: 0: q' = -q 1: q' = q + 1 2: q' = q - 1 3: q' = 2 - q [1,4,7] 0 (unused for compatibility with 3D). |
void p4est_find_corner_transform | ( | p4est_connectivity_t * | connectivity, |
p4est_topidx_t | itree, | ||
int | icorner, | ||
p4est_corner_info_t * | ci | ||
) |
Fills an array with information about corner neighbors.
[in] | itree | The number of the originating tree. |
[in] | icorner | The number of the originating corner. |
[in,out] | ci | A p4est_corner_info_t structure with initialized array. |
p4est_topidx_t p4est_find_face_transform | ( | p4est_connectivity_t * | connectivity, |
p4est_topidx_t | itree, | ||
int | iface, | ||
int | ftransform[] | ||
) |
Fill an array with the axis combinations of a tree neighbor transform.
[in] | itree | The number of the originating tree. |
[in] | iface | The number of the originating tree's face. |
[out] | ftransform | This array holds 9 integers. [0,2] The coordinate axis sequence of the origin face. [3,5] The coordinate axis sequence of the target face. [6,8] Edge reverse flag for axis t; face code for axis n. [1,4,7] 0 (unused for compatibility with 3D). |
void p4est_neighbor_transform_coordinates | ( | const p4est_neighbor_transform_t * | nt, |
const p4est_qcoord_t | self_coords[P4EST_DIM], | ||
p4est_qcoord_t | neigh_coords[P4EST_DIM] | ||
) |
Transform from self's coordinate system to neighbor's coordinate system.
[in] | nt | A neighbor transform. |
[in] | self_coords | Input quadrant coordinates in self coordinates. |
[out] | neigh_coords | Coordinates transformed into neighbor coordinates. |
void p4est_neighbor_transform_coordinates_reverse | ( | const p4est_neighbor_transform_t * | nt, |
const p4est_qcoord_t | neigh_coords[P4EST_DIM], | ||
p4est_qcoord_t | self_coords[P4EST_DIM] | ||
) |
Transform from neighbor's coordinate system to self's coordinate system.
[in] | nt | A neighbor transform. |
[in] | neigh_coords | Input quadrant coordinates in self coordinates. |
[out] | self_coords | Coordinates transformed into neighbor coordinates. |