p4est  1.1
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Data Structures | Macros | Enumerations | Functions | Variables
p8est_connectivity.h File Reference

The coarse topological description of the forest. More...

#include <sc_io.h>
#include <p4est_base.h>

Go to the source code of this file.

Data Structures

struct  p8est_connectivity_t
 This structure holds the 3D inter-tree connectivity information. More...
 
struct  p8est_edge_transform_t
 
struct  p8est_edge_info_t
 
struct  p8est_corner_transform_t
 
struct  p8est_corner_info_t
 

Macros

#define P8EST_DIM   3
 The spatial dimension.
 
#define P8EST_FACES   (2 * P8EST_DIM)
 The number of faces of an octant. More...
 
#define P8EST_CHILDREN   8
 The number of children of an octant. More...
 
#define P8EST_HALF   (P8EST_CHILDREN / 2)
 The number of children/corners touching one face.
 
#define P8EST_EDGES   12
 The number of edges around an octant.
 
#define P8EST_INSUL   27
 The size of insulation layer.
 
#define P8EST_FTRANSFORM   9
 
#define P8EST_STRING   "p8est"
 p8est identification string
 
#define P8EST_ONDISK_FORMAT   0x3000009
 

Enumerations

enum  p8est_connect_type_t { P8EST_CONNECT_FACE = 31, P8EST_CONNECT_EDGE = 32, P8EST_CONNECT_CORNER = 33, P8EST_CONNECT_FULL = P8EST_CONNECT_CORNER }
 Characterize a type of adjacency. More...
 
enum  p8est_connectivity_encode_t { P8EST_CONN_ENCODE_NONE = SC_IO_ENCODE_NONE, P8EST_CONN_ENCODE_LAST }
 Typedef for serialization method. More...
 

Functions

int p8est_connect_type_int (p8est_connect_type_t btype)
 Convert the p8est_connect_type_t into a number. More...
 
const char * p8est_connect_type_string (p8est_connect_type_t btype)
 Convert the p8est_connect_type_t into a const string. More...
 
size_t p8est_connectivity_memory_used (p8est_connectivity_t *conn)
 Calculate memory usage of a connectivity structure. More...
 
int p8est_connectivity_face_neighbor_corner_set (int c, int f, int nf, int set)
 Transform a corner across one of the adjacent faces into a neighbor tree. More...
 
int p8est_connectivity_face_neighbor_corner_orientation (int c, int f, int nf, int o)
 Transform a corner across one of the adjacent faces into a neighbor tree. More...
 
p8est_connectivity_tp8est_connectivity_new (p4est_topidx_t num_vertices, p4est_topidx_t num_trees, p4est_topidx_t num_edges, p4est_topidx_t num_ett, p4est_topidx_t num_corners, p4est_topidx_t num_ctt)
 Allocate a connectivity structure. More...
 
p8est_connectivity_tp8est_connectivity_new_copy (p4est_topidx_t num_vertices, p4est_topidx_t num_trees, p4est_topidx_t num_edges, 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 *tte, const p4est_topidx_t *eoff, const p4est_topidx_t *ett, const int8_t *ete, 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...
 
void p8est_connectivity_destroy (p8est_connectivity_t *connectivity)
 Destroy a connectivity structure. More...
 
void p8est_connectivity_set_attr (p8est_connectivity_t *conn, size_t bytes_per_tree)
 Allocate or free the attribute fields in a connectivity. More...
 
int p8est_connectivity_is_valid (p8est_connectivity_t *connectivity)
 Examine a connectivity structure. More...
 
int p8est_connectivity_is_equal (p8est_connectivity_t *conn1, p8est_connectivity_t *conn2)
 Check two connectivity structures for equality. More...
 
int p8est_connectivity_sink (p8est_connectivity_t *conn, sc_io_sink_t *sink)
 Write connectivity to a sink object. More...
 
sc_array_tp8est_connectivity_deflate (p8est_connectivity_t *conn, p8est_connectivity_encode_t code)
 Allocate memory and store the connectivity information there. More...
 
int p8est_connectivity_save (const char *filename, p8est_connectivity_t *connectivity)
 Save a connectivity structure to disk. More...
 
p8est_connectivity_tp8est_connectivity_source (sc_io_source_t *source)
 Read connectivity from a source object. More...
 
p8est_connectivity_tp8est_connectivity_inflate (sc_array_t *buffer)
 Create new connectivity from a memory buffer. More...
 
p8est_connectivity_tp8est_connectivity_load (const char *filename, size_t *bytes)
 Load a connectivity structure from disk. More...
 
p8est_connectivity_tp8est_connectivity_new_unitcube (void)
 Create a connectivity structure for the unit cube.
 
p8est_connectivity_tp8est_connectivity_new_periodic (void)
 Create a connectivity structure for an all-periodic unit cube.
 
p8est_connectivity_tp8est_connectivity_new_rotwrap (void)
 Create a connectivity structure for a mostly periodic unit cube. More...
 
p8est_connectivity_tp8est_connectivity_new_twocubes (void)
 Create a connectivity structure that contains two cubes.
 
p8est_connectivity_tp8est_connectivity_new_twowrap (void)
 Create a connectivity structure that contains two cubes where the two far ends are identified periodically.
 
p8est_connectivity_tp8est_connectivity_new_rotcubes (void)
 Create a connectivity structure that contains a few cubes. More...
 
p8est_connectivity_tp8est_connectivity_new_brick (int m, int n, int p, int periodic_a, int periodic_b, int periodic_c)
 An m by n by p array with periodicity in x, y, and z if periodic_a, periodic_b, and periodic_c are true, respectively.
 
p8est_connectivity_tp8est_connectivity_new_shell (void)
 Create a connectivity structure that builds a spherical shell. More...
 
p8est_connectivity_tp8est_connectivity_new_sphere (void)
 Create a connectivity structure that builds a solid sphere. More...
 
p8est_connectivity_tp8est_connectivity_new_byname (const char *name)
 Create connectivity structure from predefined catalogue. More...
 
void p8est_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 p8est_find_face_transform (p8est_connectivity_t *connectivity, p4est_topidx_t itree, int iface, int ftransform[])
 Fill an array with the axis combination of a face neighbor transform. More...
 
void p8est_find_edge_transform (p8est_connectivity_t *connectivity, p4est_topidx_t itree, int iedge, p8est_edge_info_t *ei)
 Fills an array with information about edge neighbors. More...
 
void p8est_find_corner_transform (p8est_connectivity_t *connectivity, p4est_topidx_t itree, int icorner, p8est_corner_info_t *ci)
 Fills an array with information about corner neighbors. More...
 
void p8est_connectivity_complete (p8est_connectivity_t *conn)
 Internally connect a connectivity based on tree_to_vertex information. More...
 
void p8est_connectivity_reduce (p8est_connectivity_t *conn)
 Removes corner and edge information of a connectivity such that enough information is left to run p8est_connectivity_complete successfully. More...
 
void p8est_connectivity_permute (p8est_connectivity_t *conn, sc_array_t *perm, int is_current_to_new)
 p8est_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 p8est_connectivity_join_faces (p8est_connectivity_t *conn, p4est_topidx_t tree_left, p4est_topidx_t tree_right, int face_left, int face_right, int orientation)
 p8est_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 p8est_connectivity_is_equivalent (p8est_connectivity_t *conn1, p8est_connectivity_t *conn2)
 p8est_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...
 
static p8est_edge_transform_tp8est_edge_array_index (sc_array_t *array, size_t it)
 Return a pointer to a p8est_edge_transform_t array element. More...
 
static p8est_corner_transform_tp8est_corner_array_index (sc_array_t *array, size_t it)
 Return a pointer to a p8est_corner_transform_t array element. More...
 
int p8est_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...
 
p8est_connectivity_tp8est_connectivity_read_inp (const char *filename)
 Create a p4est connectivity from an ABAQUS input file. More...
 

Variables

const int p8est_face_corners [6][4]
 Store the corner numbers 0..7 for each tree face. More...
 
const int p8est_face_edges [6][4]
 Store the face numbers 0..12 for each tree face. More...
 
const int p8est_face_dual [6]
 Store the face numbers in the face neighbor's system. More...
 
const int p8est_face_permutations [8][4]
 Store only the 8 out of 24 possible permutations that occur. More...
 
const int p8est_face_permutation_sets [3][4]
 Store the 3 occurring sets of 4 permutations per face. More...
 
const int p8est_face_permutation_refs [6][6]
 For each face combination store the permutation set. More...
 
const int p8est_edge_faces [12][2]
 Store the face numbers 0..5 for each tree edge. More...
 
const int p8est_edge_corners [12][2]
 Store the corner numbers 0..8 for each tree edge. More...
 
const int p8est_edge_face_corners [12][6][2]
 Store the face corner numbers for the faces touching a tree edge. More...
 
const int p8est_corner_faces [8][3]
 Store the face numbers 0..5 for each tree corner. More...
 
const int p8est_corner_edges [8][3]
 Store the edge numbers 0..11 for each tree corner. More...
 
const int p8est_corner_face_corners [8][6]
 Store the face corner numbers for the faces touching a tree corner. More...
 
const int p8est_child_edge_faces [8][12]
 Store the faces for each child and edge, can be -1. More...
 
const int p8est_child_corner_faces [8][8]
 Store the faces for each child and corner, can be -1. More...
 
const int p8est_child_corner_edges [8][8]
 Store the edges for each child and corner, can be -1. More...
 

Detailed Description

The coarse topological description of the forest.

Macro Definition Documentation

#define P8EST_CHILDREN   8

The number of children of an octant.

also the nmber of corners

#define P8EST_FACES   (2 * P8EST_DIM)

The number of faces of an octant.

Note
for uniform naming reasons, an octant is represented by the datatype p8est_quadrant_t

Enumeration Type Documentation

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, or 3) entities are adjacent if they share a face, corner or edge. p8est_connect_type_t is used to choose the desired behavior. This enum must fit into an int8_t.

Typedef for serialization method.

Enumerator
P8EST_CONN_ENCODE_LAST 

Invalid entry to close the list.

Function Documentation

int p8est_connect_type_int ( p8est_connect_type_t  btype)

Convert the p8est_connect_type_t into a number.

Parameters
[in]btypeThe balance type to convert.
Returns
Returns 1, 2 or 3.
const char* p8est_connect_type_string ( p8est_connect_type_t  btype)

Convert the p8est_connect_type_t into a const string.

Parameters
[in]btypeThe balance type to convert.
Returns
Returns a pointer to a constant string.
void p8est_connectivity_complete ( p8est_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.

Parameters
[in,out]connThe 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 p8est_connectivity_is_valid (conn) but will be overwritten. The edge and corner fields will be freed and allocated anew.
sc_array_t* p8est_connectivity_deflate ( p8est_connectivity_t conn,
p8est_connectivity_encode_t  code 
)

Allocate memory and store the connectivity information there.

Parameters
[in]connThe connectivity structure to be exported to memory.
[in]codeEncoding and compression method for serialization.
Returns
Newly created array that contains the information.
void p8est_connectivity_destroy ( p8est_connectivity_t connectivity)

Destroy a connectivity structure.

Also destroy all attributes.

int p8est_connectivity_face_neighbor_corner_orientation ( 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.

Parameters
[in]cA corner number in 0..7.
[in]fA face number that touches the corner c.
[in]nfA neighbor face that is on the other side of .
[in]oThe orientation between tree boundary faces f and .
int p8est_connectivity_face_neighbor_corner_set ( int  c,
int  f,
int  nf,
int  set 
)

Transform a corner across one of the adjacent faces into a neighbor tree.

It expects a face permutation index that has been precomputed.

Parameters
[in]cA corner number in 0..7.
[in]fA face number that touches the corner c.
[in]nfA neighbor face that is on the other side of .
[in]setA value from p8est_face_permutation_sets that is obtained using f, nf, and a valid orientation: ref = p8est_face_permutation_refs[f][nf]; set = p8est_face_permutation_sets[ref][orientation];
Returns
The corner number in 0..7 seen from the other face.
p8est_connectivity_t* p8est_connectivity_inflate ( sc_array_t buffer)

Create new connectivity from a memory buffer.

Parameters
[in]bufferThe connectivity is created from this memory buffer.
Returns
The newly created connectivity, or NULL on error.
int p8est_connectivity_is_equal ( p8est_connectivity_t conn1,
p8est_connectivity_t conn2 
)

Check two connectivity structures for equality.

Returns
Returns true if structures are equal, false otherwise.
int p8est_connectivity_is_equivalent ( p8est_connectivity_t conn1,
p8est_connectivity_t conn2 
)

p8est_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.

Parameters
[in]conn1a valid connectivity
[out]conn2a valid connectivity
int p8est_connectivity_is_valid ( p8est_connectivity_t connectivity)

Examine a connectivity structure.

Returns
Returns true if structure is valid, false otherwise.
void p8est_connectivity_join_faces ( p8est_connectivity_t conn,
p4est_topidx_t  tree_left,
p4est_topidx_t  tree_right,
int  face_left,
int  face_right,
int  orientation 
)

p8est_connectivity_join_faces This function takes an existing valid connectivity conn and modifies it by joining two tree faces that are currently boundary faces.

Parameters
[in,out]connconnectivity that will be altered.
[in]tree_lefttree that will be on the left side of the joined faces.
[in]tree_righttree that will be on the right side of the joined faces.
[in]face_leftface of tree_left that will be joined.
[in]face_rightface of tree_right that will be joined.
[in]orientationthe orientation of face_left and face_right once joined (see the description of p8est_connectivity_t to understand orientation).
p8est_connectivity_t* p8est_connectivity_load ( const char *  filename,
size_t *  bytes 
)

Load a connectivity structure from disk.

Parameters
[in]filenameName of the file to read.
[out]bytesSize in bytes of connectivity on disk or NULL.
Returns
Returns valid connectivity, or NULL on file error.
size_t p8est_connectivity_memory_used ( p8est_connectivity_t conn)

Calculate memory usage of a connectivity structure.

Parameters
[in]connConnectivity structure.
Returns
Memory used in bytes.
p8est_connectivity_t* p8est_connectivity_new ( p4est_topidx_t  num_vertices,
p4est_topidx_t  num_trees,
p4est_topidx_t  num_edges,
p4est_topidx_t  num_ett,
p4est_topidx_t  num_corners,
p4est_topidx_t  num_ctt 
)

Allocate a connectivity structure.

The attribute fields are initialized to NULL.

Parameters
[in]num_verticesNumber of total vertices (i.e. geometric points).
[in]num_treesNumber of trees in the forest.
[in]num_edgesNumber of tree-connecting edges.
[in]num_ettNumber of total trees in edge_to_tree array.
[in]num_cornersNumber of tree-connecting corners.
[in]num_cttNumber of total trees in corner_to_tree array.
Returns
A connectivity structure with allocated arrays.
p8est_connectivity_t* p8est_connectivity_new_byname ( const char *  name)

Create connectivity structure from predefined catalogue.

Parameters
[in]nameInvokes connectivity_new_* function. brick235 brick (2, 3, 5, 0, 0, 0) periodic periodic rotcubes rotcubes rotwrap rotwrap shell shell sphere sphere twocubes twocubes twowrap twowrap unit unitcube
Returns
An initialized connectivity if name is defined, NULL else.
p8est_connectivity_t* p8est_connectivity_new_copy ( p4est_topidx_t  num_vertices,
p4est_topidx_t  num_trees,
p4est_topidx_t  num_edges,
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 tte,
const p4est_topidx_t eoff,
const p4est_topidx_t ett,
const int8_t *  ete,
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.

Parameters
[in]num_verticesNumber of total vertices (i.e. geometric points).
[in]num_treesNumber of trees in the forest.
[in]num_edgesNumber of tree-connecting edges.
[in]num_cornersNumber of tree-connecting corners.
[in]eoffEdge-to-tree offsets (num_edges + 1 values).
[in]coffCorner-to-tree offsets (num_corners + 1 values).
Returns
The connectivity is checked for validity.
p8est_connectivity_t* p8est_connectivity_new_rotcubes ( void  )

Create a connectivity structure that contains a few cubes.

These are rotated against each other to stress the topology routines.

p8est_connectivity_t* p8est_connectivity_new_rotwrap ( void  )

Create a connectivity structure for a mostly periodic unit cube.

The left and right faces are identified, and bottom and top rotated. Front and back are not identified.

p8est_connectivity_t* p8est_connectivity_new_shell ( void  )

Create a connectivity structure that builds a spherical shell.

It is made up of six connected parts [-1,1]x[-1,1]x[1,2]. This connectivity reuses vertices and relies on a geometry transformation. It is thus not suitable for p8est_connectivity_complete.

p8est_connectivity_t* p8est_connectivity_new_sphere ( void  )

Create a connectivity structure that builds a solid sphere.

It is made up of two layers and a cube in the center. This connectivity reuses vertices and relies on a geometry transformation. It is thus not suitable for p8est_connectivity_complete.

void p8est_connectivity_permute ( p8est_connectivity_t conn,
sc_array_t perm,
int  is_current_to_new 
)

p8est_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.

Parameters
[in,out]connThe connectivity whose trees are permuted.
[in]permA permutation array, whose elements are size_t's.
[in]is_current_to_newif 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.
p8est_connectivity_t* p8est_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

*Heading
box.inp
*Node
1, 5, -5, 5
2, 5, 5, 5
3, 5, 0, 5
4, -5, 5, 5
5, 0, 5, 5
6, -5, -5, 5
7, -5, 0, 5
8, 0, -5, 5
9, 0, 0, 5
10, 5, 5, -5
11, 5, -5, -5
12, 5, 0, -5
13, -5, -5, -5
14, 0, -5, -5
15, -5, 5, -5
16, -5, 0, -5
17, 0, 5, -5
18, 0, 0, -5
19, -5, -5, 0
20, 5, -5, 0
21, 0, -5, 0
22, -5, 5, 0
23, -5, 0, 0
24, 5, 5, 0
25, 0, 5, 0
26, 5, 0, 0
27, 0, 0, 0
*Element, type=C3D8, ELSET=EB1
1, 6, 19, 23, 7, 8, 21, 27, 9
2, 19, 13, 16, 23, 21, 14, 18, 27
3, 7, 23, 22, 4, 9, 27, 25, 5
4, 23, 16, 15, 22, 27, 18, 17, 25
5, 8, 21, 27, 9, 1, 20, 26, 3
6, 21, 14, 18, 27, 20, 11, 12, 26
7, 9, 27, 25, 5, 3, 26, 24, 2
8, 27, 18, 17, 25, 26, 12, 10, 24

This function reads a mesh from filename and returns an associated p4est connectivity.

Parameters
[in]filenamefile to read the connectivity from
Returns
an allocated connectivity associated with the mesh in filename
int p8est_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

*Heading
box.inp
*Node
1, 5, -5, 5
2, 5, 5, 5
3, 5, 0, 5
4, -5, 5, 5
5, 0, 5, 5
6, -5, -5, 5
7, -5, 0, 5
8, 0, -5, 5
9, 0, 0, 5
10, 5, 5, -5
11, 5, -5, -5
12, 5, 0, -5
13, -5, -5, -5
14, 0, -5, -5
15, -5, 5, -5
16, -5, 0, -5
17, 0, 5, -5
18, 0, 0, -5
19, -5, -5, 0
20, 5, -5, 0
21, 0, -5, 0
22, -5, 5, 0
23, -5, 0, 0
24, 5, 5, 0
25, 0, 5, 0
26, 5, 0, 0
27, 0, 0, 0
*Element, type=C3D8, ELSET=EB1
1, 6, 19, 23, 7, 8, 21, 27, 9
2, 19, 13, 16, 23, 21, 14, 18, 27
3, 7, 23, 22, 4, 9, 27, 25, 5
4, 23, 16, 15, 22, 27, 18, 17, 25
5, 8, 21, 27, 9, 1, 20, 26, 3
6, 21, 14, 18, 27, 20, 11, 12, 26
7, 9, 27, 25, 5, 3, 26, 24, 2
8, 27, 18, 17, 25, 26, 12, 10, 24

This code can be called two ways. The first, when vertex==NULL and tree_to_vertex==NULL, is used to count the number of tress 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.

Parameters
[in,out]streamfile stream to read the connectivity from
[in,out]num_verticesthe number of vertices in the connectivity
[in,out]num_treesthe number of trees in the connectivity
[out]verticesthe list of vertices of the connectivity
[out]tree_to_vertexthe tree_to_vertex map of the connectivity
Returns
0 if successful and nonzero if not
void p8est_connectivity_reduce ( p8est_connectivity_t conn)

Removes corner and edge information of a connectivity such that enough information is left to run p8est_connectivity_complete successfully.

The reduced connectivity still passes p8est_connectivity_is_valid.

Parameters
[in,out]connThe connectivity to be reduced.
int p8est_connectivity_save ( const char *  filename,
p8est_connectivity_t connectivity 
)

Save a connectivity structure to disk.

Parameters
[in]filenameName of the file to write.
[in]connectivityValid connectivity structure.
Returns
Returns 0 on success, nonzero on file error.
void p8est_connectivity_set_attr ( p8est_connectivity_t conn,
size_t  bytes_per_tree 
)

Allocate or free the attribute fields in a connectivity.

Parameters
[in,out]connThe conn->*_to_attr fields must either be NULL or previously be allocated by this function.
[in]bytes_per_treeIf 0, tree_to_attr is freed (being NULL is ok). If positive, requested space is allocated.
int p8est_connectivity_sink ( p8est_connectivity_t conn,
sc_io_sink_t *  sink 
)

Write connectivity to a sink object.

Parameters
[in]connThe connectivity to be written.
[in,out]sinkThe connectivity is written into this sink.
Returns
0 on success, nonzero on error.
p8est_connectivity_t* p8est_connectivity_source ( sc_io_source_t *  source)

Read connectivity from a source object.

Parameters
[in,out]sourceThe connectivity is read from this source.
Returns
The newly created connectivity, or NULL on error.
static p8est_corner_transform_t* p8est_corner_array_index ( sc_array_t array,
size_t  it 
)
inlinestatic

Return a pointer to a p8est_corner_transform_t array element.

static p8est_edge_transform_t* p8est_edge_array_index ( sc_array_t array,
size_t  it 
)
inlinestatic

Return a pointer to a p8est_edge_transform_t array element.

void p8est_expand_face_transform ( int  iface,
int  nface,
int  ftransform[] 
)

Fill an array with the axis combination of a face neighbor transform.

Parameters
[in]ifaceThe number of the originating face.
[in]nfaceEncoded as nface = r * 6 + nf, where nf = 0..5 is the neigbbor's connecting face number and r = 0..3 is the relative orientation to the neighbor's face. This encoding matches p8est_connectivity_t.
[out]ftransformThis array holds 9 integers. [0]..[2] The coordinate axis sequence of the origin face, the first two referring to the tangentials and the third to the normal. A permutation of (0, 1, 2). [3]..[5] The coordinate axis sequence of the target face. [6]..[8] Edge reversal flags for tangential axes (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
void p8est_find_corner_transform ( p8est_connectivity_t connectivity,
p4est_topidx_t  itree,
int  icorner,
p8est_corner_info_t ci 
)

Fills an array with information about corner neighbors.

Parameters
[in]itreeThe number of the originating tree.
[in]icornerThe number of the originating corner.
[in,out]ciA p8est_corner_info_t structure with initialized array.
void p8est_find_edge_transform ( p8est_connectivity_t connectivity,
p4est_topidx_t  itree,
int  iedge,
p8est_edge_info_t ei 
)

Fills an array with information about edge neighbors.

Parameters
[in]itreeThe number of the originating tree.
[in]iedgeThe number of the originating edge.
[in,out]eiA p8est_edge_info_t structure with initialized array.
p4est_topidx_t p8est_find_face_transform ( p8est_connectivity_t connectivity,
p4est_topidx_t  itree,
int  iface,
int  ftransform[] 
)

Fill an array with the axis combination of a face neighbor transform.

Parameters
[in]itreeThe number of the originating tree.
[in]ifaceThe number of the originating tree's face.
[out]ftransformThis 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 axes t1, t2; face code for n.
Returns
The face neighbor tree if it exists, -1 otherwise.

Variable Documentation

const int p8est_child_corner_edges[8][8]

Store the edges for each child and corner, can be -1.

const int p8est_child_corner_faces[8][8]

Store the faces for each child and corner, can be -1.

const int p8est_child_edge_faces[8][12]

Store the faces for each child and edge, can be -1.

const int p8est_corner_edges[8][3]

Store the edge numbers 0..11 for each tree corner.

const int p8est_corner_face_corners[8][6]

Store the face corner numbers for the faces touching a tree corner.

const int p8est_corner_faces[8][3]

Store the face numbers 0..5 for each tree corner.

const int p8est_edge_corners[12][2]

Store the corner numbers 0..8 for each tree edge.

const int p8est_edge_face_corners[12][6][2]

Store the face corner numbers for the faces touching a tree edge.

const int p8est_edge_faces[12][2]

Store the face numbers 0..5 for each tree edge.

const int p8est_face_corners[6][4]

Store the corner numbers 0..7 for each tree face.

const int p8est_face_dual[6]

Store the face numbers in the face neighbor's system.

const int p8est_face_edges[6][4]

Store the face numbers 0..12 for each tree face.

const int p8est_face_permutation_refs[6][6]

For each face combination store the permutation set.

The order is [my_face][neighbor_face]

const int p8est_face_permutation_sets[3][4]

Store the 3 occurring sets of 4 permutations per face.

const int p8est_face_permutations[8][4]

Store only the 8 out of 24 possible permutations that occur.