p4est 2.8.6
p4est is a software library for parallel adaptive mesh refinement.
p8est_connectivity.h
Go to the documentation of this file.
1/*
2 This file is part of p4est.
3 p4est is a C library to manage a collection (a forest) of multiple
4 connected adaptive quadtrees or octrees in parallel.
5
6 Copyright (C) 2010 The University of Texas System
7 Additional copyright (C) 2011 individual authors
8 Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
9
10 p4est is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2 of the License, or
13 (at your option) any later version.
14
15 p4est is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
19
20 You should have received a copy of the GNU General Public License
21 along with p4est; if not, write to the Free Software Foundation, Inc.,
22 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
23*/
24
61#ifndef P8EST_CONNECTIVITY_H
62#define P8EST_CONNECTIVITY_H
63
64#include <sc_io.h>
65#include <p4est_base.h>
66
67SC_EXTERN_C_BEGIN;
68
70#define P8EST_DIM 3
75#define P8EST_FACES (2 * P8EST_DIM)
79#define P8EST_CHILDREN 8
81#define P8EST_HALF (P8EST_CHILDREN / 2)
83#define P8EST_EDGES 12
85#define P8EST_INSUL 27
86
88#define P8EST_ONLY_P8_LAND(x) && (x)
89
91#define P8EST_ONLY_P8_COMMA(x) , (x)
92
94#define P8EST_DIM_POW(a) ((a) * (a) * (a))
95
97#define P8EST_FTRANSFORM 9
98
100#define P8EST_STRING "p8est"
101
106#define P8EST_ONDISK_FORMAT 0x3000009
107
118typedef enum
119{
120 /* make sure to have different values 2D and 3D */
129
130#ifdef P4EST_BACKWARD_DEALII
131typedef p8est_connect_type_t p8est_balance_type_t;
132#endif
133
135typedef enum
136{
137 P8EST_CONN_ENCODE_NONE = SC_IO_ENCODE_NONE,
141
147
153
214typedef struct p8est_connectivity
215{
225 double *vertices;
236 int8_t *tree_to_face;
243 int8_t *edge_to_edge;
252}
254
260 conn);
261
263typedef struct
264{
266 int8_t nedge;
267 int8_t naxis[3];
268 int8_t nflip;
269 int8_t corners;
270}
272
274typedef struct
275{
276 int8_t iedge;
277 sc_array_t edge_transforms;
279}
281
283typedef struct
284{
286 int8_t ncorner;
287}
289
291typedef struct
292{
294 sc_array_t corner_transforms;
296}
298
300typedef struct
301{
304 int8_t index_self;
308 int8_t perm[P8EST_DIM];
311 int8_t sign[P8EST_DIM];
315 p4est_qcoord_t origin_neighbor[P8EST_DIM];
318}
320
321/* *INDENT-OFF* */
322
330 (const p8est_neighbor_transform_t * nt,
331 const p4est_qcoord_t self_coords[P8EST_DIM],
332 p4est_qcoord_t neigh_coords[P8EST_DIM]);
333
341 (const p8est_neighbor_transform_t * nt,
342 const p4est_qcoord_t neigh_coords[P8EST_DIM],
343 p4est_qcoord_t self_coords[P8EST_DIM]);
344
356 p4est_topidx_t tree_id,
357 p8est_connect_type_t boundary_type,
358 int boundary_index,
359 sc_array_t *neighbor_transform_array);
360
361/* *INDENT-ON* */
362
364extern const int p8est_face_corners[6][4];
365
367extern const int p8est_face_edges[6][4];
368
370extern const int p8est_face_dual[6];
371
372/* face corners */
373
375extern const int p8est_face_permutations[8][4];
376
378extern const int p8est_face_permutation_sets[3][4];
379
382extern const int p8est_face_permutation_refs[6][6];
383
384/* face edges */
385
387extern const int p8est_face_edge_permutations[8][4];
388
390extern const int p8est_face_edge_permutation_sets[3][4];
391
393extern const int p8est_edge_faces[12][2];
394
396extern const int p8est_edge_corners[12][2];
397
400extern const int p8est_edge_edge_corners[12][8];
401
404extern const int p8est_edge_face_corners[12][6][2];
405
408extern const int p8est_edge_face_edges[12][6];
409
411extern const int p8est_corner_faces[8][3];
412
414extern const int p8est_corner_edges[8][3];
415
418extern const int p8est_corner_face_corners[8][6];
419
422extern const int p8est_corner_edge_corners[8][12];
423
425extern const int p8est_child_edge_faces[8][12];
426
428extern const int p8est_child_corner_faces[8][8];
429
431extern const int p8est_child_corner_edges[8][8];
432
445 (int c, int f, int nf, int set);
446
456 (int fc, int f, int nf, int o);
457
467 (int c, int f, int nf, int o);
468
478 (int fe, int f, int nf, int o);
479
489 (int e, int f, int nf, int o);
490
497 (int ec, int o);
498
508 (int c, int e, int ne, int o);
509
521 p4est_topidx_t num_trees,
522 p4est_topidx_t num_edges,
523 p4est_topidx_t num_ett,
524 p4est_topidx_t num_corners,
525 p4est_topidx_t num_ctt);
526
552 num_vertices,
553 p4est_topidx_t num_trees,
554 p4est_topidx_t num_edges,
555 p4est_topidx_t num_corners,
556 const double *vertices,
557 const p4est_topidx_t * ttv,
558 const p4est_topidx_t * ttt,
559 const int8_t * ttf,
560 const p4est_topidx_t * tte,
561 const p4est_topidx_t *
562 eoff,
563 const p4est_topidx_t * ett,
564 const int8_t * ete,
565 const p4est_topidx_t * ttc,
566 const p4est_topidx_t *
567 coff,
568 const p4est_topidx_t * ctt,
569 const int8_t * ctc);
570
583 conn_in, int root,
584 sc_MPI_Comm comm);
585
589 connectivity);
590
598 size_t bytes_per_tree);
599
604 connectivity);
605
611 conn2);
612
619 sc_io_sink_t * sink);
620
628 code);
629
635int p8est_connectivity_save (const char *filename,
637 connectivity);
638
644
652
659 size_t *bytes);
660
664
668
674
680
684
692 int r_face,
693 int orientation);
694
699
704
709 int periodic_a,
710 int periodic_b,
711 int periodic_c);
712
719
726
742
757
769 int num_per_dim);
770
789void p8est_expand_face_transform (int iface, int nface,
790 int ftransform[]);
791
804 connectivity,
805 p4est_topidx_t itree,
806 int iface, int ftransform[]);
807
815 connectivity,
816 p4est_topidx_t itree,
817 int iedge,
818 p8est_edge_info_t * ei);
819
827 connectivity,
828 p4est_topidx_t itree,
829 int icorner,
831
842
849
865 sc_array_t * perm,
866 int is_current_to_new);
867
868#ifdef P4EST_WITH_METIS
869
892void p8est_connectivity_reorder (sc_MPI_Comm comm, int k,
895
916sc_array_t *p8est_connectivity_reorder_newid (sc_MPI_Comm comm, int k,
918 conn,
920 ctype,
921 sc_array_t * newid);
922
923#endif /* P4EST_WITH_METIS */
924
941 conn,
942 p4est_topidx_t tree_left,
943 p4est_topidx_t tree_right,
944 int face_left,
945 int face_right,
946 int orientation);
947
959 conn1,
961 conn2);
962
964/*@unused@*/
965static inline p8est_edge_transform_t *
966p8est_edge_array_index (sc_array_t * array, size_t it)
967{
968 P4EST_ASSERT (array->elem_size == sizeof (p8est_edge_transform_t));
969 P4EST_ASSERT (it < array->elem_count);
970
971 return (p8est_edge_transform_t *) (array->array +
972 sizeof (p8est_edge_transform_t) * it);
973}
974
976/*@unused@*/
977static inline p8est_corner_transform_t *
978p8est_corner_array_index (sc_array_t * array, size_t it)
979{
980 P4EST_ASSERT (array->elem_size == sizeof (p8est_corner_transform_t));
981 P4EST_ASSERT (it < array->elem_count);
982
983 return
984 (p8est_corner_transform_t *) (array->array +
985 sizeof (p8est_corner_transform_t) * it);
986}
987
1089 num_vertices,
1091 num_trees,
1092 double *vertices,
1094 tree_to_vertex);
1095
1186
1187SC_EXTERN_C_END;
1188
1189#endif /* !P8EST_CONNECTIVITY_H */
General support types and functions.
int32_t p4est_qcoord_t
Typedef for quadrant coordinates.
Definition: p4est_base.h:81
int32_t p4est_topidx_t
Typedef for counting topological entities (trees, tree vertices).
Definition: p4est_base.h:93
const int p8est_face_edge_permutation_sets[3][4]
Store the 3 occurring sets of 4 permutations per face.
p8est_connectivity_t * p8est_connectivity_new_drop(void)
Create a connectivity structure for a five-trees geometry with a hole.
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,...
p8est_connectivity_t * p8est_connectivity_inflate(sc_array_t *buffer)
Create new connectivity from a memory buffer.
p8est_connectivity_t * p8est_connectivity_new_torus(int nSegments)
Create a connectivity structure that builds a revolution torus.
const int p8est_edge_face_edges[12][6]
Store the face edge numbers 0..3 for the faces touching a tree edge.
void p8est_connectivity_set_attr(p8est_connectivity_t *conn, size_t bytes_per_tree)
Allocate or free the attribute fields in a connectivity.
const int p8est_face_corners[6][4]
Store the corner numbers 0..7 for each tree face.
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.
p8est_connectivity_t * p8est_connectivity_bcast(p8est_connectivity_t *conn_in, int root, sc_MPI_Comm comm)
Broadcast a connectivity structure that exists only on one process to all.
const int p8est_face_permutation_sets[3][4]
Store the 3 occurring sets of 4 permutations per face.
void p8est_neighbor_transform_coordinates(const p8est_neighbor_transform_t *nt, const p4est_qcoord_t self_coords[P8EST_DIM], p4est_qcoord_t neigh_coords[P8EST_DIM])
Transform from self's coordinate system to neighbor's coordinate system.
void p8est_neighbor_transform_coordinates_reverse(const p8est_neighbor_transform_t *nt, const p4est_qcoord_t neigh_coords[P8EST_DIM], p4est_qcoord_t self_coords[P8EST_DIM])
Transform from neighbor's coordinate system to self's coordinate system.
const int p8est_face_dual[6]
Store the face numbers in the face neighbor's system.
p8est_connectivity_t * p8est_connectivity_new_rotcubes(void)
Create a connectivity structure that contains a few cubes.
void p8est_connectivity_reorder(sc_MPI_Comm comm, int k, p8est_connectivity_t *conn, p8est_connect_type_t ctype)
Reorder a connectivity using METIS.
void p8est_connectivity_get_neighbor_transforms(p8est_connectivity_t *conn, p4est_topidx_t tree_id, p8est_connect_type_t boundary_type, int boundary_index, sc_array_t *neighbor_transform_array)
Fill an array with the neighbor transforms based on a specific boundary type.
p8est_connectivity_t * p8est_connectivity_load(const char *filename, size_t *bytes)
Load a connectivity structure from disk.
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.
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.
p8est_connectivity_t * p8est_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 tr...
p8est_connectivity_t * p8est_connectivity_new_twowrap(void)
Create a connectivity structure that contains two cubes where the two far ends are identified periodi...
int p8est_connectivity_edge_neighbor_corner(int c, int e, int ne, int o)
Transform a corner across one of the adjacent edges into a neighbor tree.
p8est_connectivity_t * p8est_connectivity_new_unitcube(void)
Create a connectivity structure for the unit cube.
const int p8est_corner_faces[8][3]
Store the face numbers 0..5 for each tree corner.
const int p8est_face_edges[6][4]
Store the edge numbers 0..12 for each tree face.
int p8est_connectivity_is_equal(p8est_connectivity_t *conn1, p8est_connectivity_t *conn2)
Check two connectivity structures for equality.
int p8est_connect_type_int(p8est_connect_type_t btype)
Convert the p8est_connect_type_t into a number.
size_t p8est_connectivity_memory_used(p8est_connectivity_t *conn)
Calculate memory usage of a connectivity structure.
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.
int p8est_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.
#define P8EST_DIM
The spatial dimension.
Definition: p8est_connectivity.h:70
const int p8est_edge_corners[12][2]
Store the corner numbers 0..8 for each tree edge.
const int p8est_edge_edge_corners[12][8]
Store the edge corner numbers 0..1 for the corners touching a tree edge or -1 if combination is inval...
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.
const int p8est_child_edge_faces[8][12]
Store the faces for each child and edge, can be -1.
void p8est_expand_face_transform(int iface, int nface, int ftransform[])
Fill an array with the axis combination of a face neighbor transform.
void p8est_connectivity_destroy(p8est_connectivity_t *connectivity)
Destroy a connectivity structure.
p8est_connectivity_t * p8est_connectivity_new_shell(void)
Create a connectivity structure that builds a spherical shell.
const int p8est_child_corner_faces[8][8]
Store the faces for each child and corner, can be -1.
const int p8est_corner_face_corners[8][6]
Store the face corner numbers for the faces touching a tree corner.
const int p8est_corner_edges[8][3]
Store the edge numbers 0..11 for each tree corner.
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...
p8est_connectivity_t * p8est_connectivity_new_sphere(void)
Create a connectivity structure that builds a solid sphere.
int p8est_connectivity_face_neighbor_face_edge(int fe, int f, int nf, int o)
Transform a face-edge across one of the adjacent faces into a neighbor tree.
void p8est_connectivity_reduce(p8est_connectivity_t *conn)
Removes corner and edge information of a connectivity such that enough information is left to run p8e...
const int p8est_child_corner_edges[8][8]
Store the edges for each child and corner, can be -1.
sc_array_t * p8est_connectivity_deflate(p8est_connectivity_t *conn, p8est_connectivity_encode_t code)
Allocate memory and store the connectivity information there.
p8est_connectivity_t * p8est_connectivity_new_byname(const char *name)
Create connectivity structure from predefined catalogue.
p8est_connect_type_t
Characterize a type of adjacency.
Definition: p8est_connectivity.h:119
@ P8EST_CONNECT_CORNER
Balance faces, edges, corners.
Definition: p8est_connectivity.h:125
@ P8EST_CONNECT_FULL
= CORNER.
Definition: p8est_connectivity.h:126
@ P8EST_CONNECT_ALMOST
= CORNER - 1.
Definition: p8est_connectivity.h:124
@ P8EST_CONNECT_SELF
No balance whatsoever.
Definition: p8est_connectivity.h:121
@ P8EST_CONNECT_FACE
Balance across faces only.
Definition: p8est_connectivity.h:122
@ P8EST_CONNECT_EDGE
Balance across faces and edges.
Definition: p8est_connectivity.h:123
p8est_connectivity_t * p8est_connectivity_new_twocubes(void)
Create a connectivity structure that contains two cubes.
p8est_connectivity_t * p8est_connectivity_source(sc_io_source_t *source)
Read connectivity from a source object.
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 return...
const int p8est_edge_faces[12][2]
Store the face numbers 0..5 adjacent to each tree edge.
const int p8est_face_permutations[8][4]
Store only the 8 out of 24 possible permutations that occur.
sc_array_t * p8est_connectivity_reorder_newid(sc_MPI_Comm comm, int k, p8est_connectivity_t *conn, p8est_connect_type_t ctype, sc_array_t *newid)
Reorder a connectivity using METIS.
const int p8est_face_edge_permutations[8][4]
Store only the 8 out of 24 possible permutations that occur.
void p8est_connectivity_complete(p8est_connectivity_t *conn)
Internally connect a connectivity based on tree_to_vertex information.
p8est_connectivity_t * p8est_connectivity_new_periodic(void)
Create a connectivity structure for an all-periodic unit cube.
p8est_connectivity_t * p8est_connectivity_new_rotwrap(void)
Create a connectivity structure for a mostly periodic unit cube.
p8est_connectivity_t * p8est_connectivity_new_twotrees(int l_face, int r_face, int orientation)
Create a connectivity structure for two trees being rotated w.r.t.
const char * p8est_connect_type_string(p8est_connect_type_t btype)
Convert the p8est_connect_type_t into a const string.
const int p8est_edge_face_corners[12][6][2]
Store the face corner numbers 0..3 for the faces touching a tree edge.
p8est_connectivity_t * p8est_connectivity_refine(p8est_connectivity_t *conn, int num_per_dim)
Uniformly refine a connectivity.
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.
int p8est_connectivity_is_valid(p8est_connectivity_t *connectivity)
Examine a connectivity structure.
int p8est_connectivity_face_neighbor_edge(int e, int f, int nf, int o)
Transform an edge across one of the adjacent faces into a neighbor tree.
int p8est_connectivity_sink(p8est_connectivity_t *conn, sc_io_sink_t *sink)
Write connectivity to a sink object.
struct p8est_connectivity p8est_connectivity_t
This structure holds the 3D inter-tree connectivity information.
p8est_connectivity_encode_t
Typedef for serialization method.
Definition: p8est_connectivity.h:136
@ P8EST_CONN_ENCODE_LAST
Invalid entry to close the list.
Definition: p8est_connectivity.h:138
int p8est_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.
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.
const int p8est_face_permutation_refs[6][6]
For each face combination store the permutation set.
const int p8est_corner_edge_corners[8][12]
Store the edge corner numbers for the edges touching a tree corner.
p8est_connectivity_t * p8est_connectivity_read_inp(const char *filename)
Create a p4est connectivity from an ABAQUS input file.
int p8est_connectivity_edge_neighbor_edge_corner(int ec, int o)
Transform an edge corner across one of the adjacent edges into a neighbor tree.
int p8est_connectivity_save(const char *filename, p8est_connectivity_t *connectivity)
Save a connectivity structure to disk.
This structure holds the 3D inter-tree connectivity information.
Definition: p8est_connectivity.h:215
double * vertices
an array of size (3 * num_vertices)
Definition: p8est_connectivity.h:225
p4est_topidx_t num_corners
the number of corners that help define the topology
Definition: p8est_connectivity.h:222
p4est_topidx_t * tree_to_vertex
embed each tree into for e.g.
Definition: p8est_connectivity.h:227
int8_t * corner_to_corner
list of tree-corners that meet at a corner
Definition: p8est_connectivity.h:250
int8_t * edge_to_edge
list of tree-edges+orientations that meet at an edge (see description)
Definition: p8est_connectivity.h:243
p4est_topidx_t * tree_to_corner
(8 * num_trees) or NULL (see description)
Definition: p8est_connectivity.h:245
p4est_topidx_t * tree_to_edge
(12 * num_trees) or NULL (see description)
Definition: p8est_connectivity.h:238
char * tree_to_attr
not touched by p4est
Definition: p8est_connectivity.h:232
p4est_topidx_t * edge_to_tree
list of trees that meet at an edge
Definition: p8est_connectivity.h:242
p4est_topidx_t * ett_offset
edge to offset in edge_to_tree and edge_to_edge
Definition: p8est_connectivity.h:240
p4est_topidx_t num_vertices
the number of vertices that define the embedding of the forest (not the topology)
Definition: p8est_connectivity.h:216
size_t tree_attr_bytes
bytes per tree in tree_to_attr
Definition: p8est_connectivity.h:231
p4est_topidx_t * corner_to_tree
list of trees that meet at a corner
Definition: p8est_connectivity.h:249
p4est_topidx_t * ctt_offset
corner to offset in corner_to_tree and corner_to_corner
Definition: p8est_connectivity.h:247
int8_t * tree_to_face
(6 * num_trees) face to face+orientation (see description)
Definition: p8est_connectivity.h:236
p4est_topidx_t num_edges
the number of edges that help define the topology
Definition: p8est_connectivity.h:220
p4est_topidx_t * tree_to_tree
(6 * num_trees) neighbors across faces
Definition: p8est_connectivity.h:234
p4est_topidx_t num_trees
the number of trees
Definition: p8est_connectivity.h:219
Information about the neighbors of a corner.
Definition: p8est_connectivity.h:292
p4est_topidx_t icorner
The number of the originating corner.
Definition: p8est_connectivity.h:293
sc_array_t corner_transforms
The array of neighbors of the originating corner.
Definition: p8est_connectivity.h:294
Generic interface for transformations between a tree and any of its corner.
Definition: p8est_connectivity.h:284
int8_t ncorner
The number of the corner.
Definition: p8est_connectivity.h:286
p4est_topidx_t ntree
The number of the tree.
Definition: p8est_connectivity.h:285
Information about the neighbors of an edge.
Definition: p8est_connectivity.h:275
int8_t iedge
The information of the edge.
Definition: p8est_connectivity.h:276
sc_array_t edge_transforms
The array of neighbors of the originating edge.
Definition: p8est_connectivity.h:277
Generic interface for transformations between a tree and any of its edge.
Definition: p8est_connectivity.h:264
int8_t corners
The corners connected to the edge.
Definition: p8est_connectivity.h:269
int8_t nedge
The number of the edge.
Definition: p8est_connectivity.h:266
p4est_topidx_t ntree
The number of the tree.
Definition: p8est_connectivity.h:265
int8_t nflip
The orientation of the edge.
Definition: p8est_connectivity.h:268
Generic interface for transformations between a tree and any of its neighbors.
Definition: p8est_connectivity.h:301
p4est_topidx_t neighbor
neighbor tree index
Definition: p8est_connectivity.h:303
int8_t index_self
index of interface from self's perspective
Definition: p8est_connectivity.h:304
p8est_connect_type_t neighbor_type
type of connection to neighbor
Definition: p8est_connectivity.h:302
int8_t index_neighbor
index of interface from neighbor's perspective
Definition: p8est_connectivity.h:306