27 #ifndef T8_DTRI_BITS_H
28 #define T8_DTRI_BITS_H
110 const size_t skip_coords,
double *out_coords);
238 int is_smaller_face);
305 t8_dtri_type_t parenttype);
399 #ifdef T8_ENABLE_DEBUG
uint64_t t8_linearidx_t
A type for storing SFC indices.
Definition: t8.h:107
#define T8_DTRI_CHILDREN
The number of children that a triangle is refined into.
Definition: t8_dtri.h:35
void t8_dtri_compute_reference_coords(const t8_dtri_t *elem, const double *ref_coords, const size_t num_coords, const size_t skip_coords, double *out_coords)
Convert points in the reference space of a tri element to points in the reference space of the tree (...
Definition: t8_dtri_bits.c:381
int t8_dtri_compare(const t8_dtri_t *t1, const t8_dtri_t *t2)
Compare two triangle in their linear order.
Definition: t8_dtri_bits.c:119
int t8_dtri_face_child_face(const t8_dtri_t *triangle, int face, int face_child)
Given a face of a triangle and a child number of a child of that face, return the face number of the ...
Definition: t8_dtri_bits.c:919
void t8_dtri_ancestor(const t8_dtri_t *t, int level, t8_dtri_t *ancestor)
Compute the ancestor of a triangle at a given level.
Definition: t8_dtri_bits.c:166
void t8_dtri_init_linear_id_with_level(t8_dtri_t *t, t8_linearidx_t id, const int start_level, const int end_level, t8_dtri_type_t parenttype)
Same as init_linear_id, but we only consider the subtree.
Definition: t8_dtri_bits.c:1452
int t8_dtri_ancestor_id(const t8_dtri_t *t, int level)
Compute the position of the ancestor of this child at level level within its siblings.
Definition: t8_dtri_bits.c:1652
int t8_dtri_face_neighbour(const t8_dtri_t *t, int face, t8_dtri_t *n)
Compute the face neighbor of a triangle.
Definition: t8_dtri_bits.c:686
int t8_dtri_equal(const t8_dtri_t *elem1, const t8_dtri_t *elem2)
Check if two elements are equal.
Definition: t8_dtri_bits.c:109
void t8_dtri_copy(const t8_dtri_t *t, t8_dtri_t *dest)
Copy the values of one triangle to another.
Definition: t8_dtri_bits.c:99
void t8_dtri_predecessor(const t8_dtri_t *t, t8_dtri_t *s, int level)
Computes the predecessor of a triangle in a uniform grid of level level.
Definition: t8_dtri_bits.c:1645
t8_linearidx_t t8_dtri_linear_id(const t8_dtri_t *t, int level)
Computes the linear position of a triangle in a uniform grid.
Definition: t8_dtri_bits.c:1419
void t8_dtri_init_linear_id(t8_dtri_t *t, t8_linearidx_t id, int level)
Initialize a triangle as the triangle with a given global id in a uniform refinement of a given level...
Definition: t8_dtri_bits.c:1487
int t8_dtri_child_id(const t8_dtri_t *t)
Compute the position of the ancestor of this child at level level within its siblings.
Definition: t8_dtri_bits.c:1666
int t8_dtri_face_parent_face(const t8_dtri_t *triangle, int face)
Given a face of an triangle return the face number of the parent of the triangle that matches the tri...
Definition: t8_dtri_bits.c:954
int t8_dtri_is_inside_root(t8_dtri_t *t)
Test if a triangle lies inside of the root triangle, that is the triangle of level 0,...
Definition: t8_dtri_bits.c:1107
int t8_dtri_is_sibling(const t8_dtri_t *t1, const t8_dtri_t *t2)
Test if two triangles are siblings.
Definition: t8_dtri_bits.c:1215
int t8_dtri_is_familypv(const t8_dtri_t *f[])
Check whether a collection of eight triangles is a family in Morton order.
Definition: t8_dtri_bits.c:641
void t8_dtri_nearest_common_ancestor(const t8_dtri_t *t1, const t8_dtri_t *t2, t8_dtri_t *r)
Computes the nearest common ancestor of two triangles in the same tree.
Definition: t8_dtri_bits.c:761
void t8_dtri_compute_vertex_ref_coords(const t8_dtri_t *elem, const int vertex, double coordinates[2])
Compute the reference coordinates of a vertex of a triangle when the tree (level 0 triangle) is embed...
void t8_dtri_init_root(t8_dtri_t *t)
Initialize a triangle as the root triangle (type 0 at level 0)
Definition: t8_dtri_bits.c:1524
void t8_dtri_last_descendant(const t8_dtri_t *t, t8_dtri_t *s, int level)
Compute the last descendant of a triangle at a given level.
Definition: t8_dtri_bits.c:1603
int t8_dtri_tree_face(t8_dtri_t *t, int face)
Given a triangle and a face of this triangle.
Definition: t8_dtri_bits.c:839
int t8_dtri_is_root_boundary(const t8_dtri_t *t, int face)
Compute whether a given triangle shares a given face with its root tree.
Definition: t8_dtri_bits.c:1146
void t8_dtri_first_descendant(const t8_dtri_t *t, t8_dtri_t *s, int level)
Compute the first descendant of a triangle at a given level.
Definition: t8_dtri_bits.c:1591
void t8_dtri_childrenpv(const t8_dtri_t *t, t8_dtri_t *c[T8_DTRI_CHILDREN])
Compute the 4 children of a triangle, array version.
Definition: t8_dtri_bits.c:585
void t8_dtri_successor(const t8_dtri_t *t, t8_dtri_t *s, int level)
Computes the successor of a triangle in a uniform grid of level level.
Definition: t8_dtri_bits.c:1584
void t8_dtri_compute_coords(const t8_dtri_t *elem, const int vertex, t8_dtri_coord_t coordinates[2])
Compute the coordinates of a vertex of a triangle.
void t8_dtri_compute_all_coords(const t8_dtri_t *elem, t8_dtri_coord_t coordinates[3][2])
Compute the coordinates of the four vertices of a triangle.
void t8_dtri_init(t8_dtri_t *t)
Set sensible default values for a triangle.
Definition: t8_dtri_bits.c:1712
void t8_dtri_corner_descendant(const t8_dtri_t *t, t8_dtri_t *s, int corner, int level)
Compute the descendant of a triangle in a given corner.
Definition: t8_dtri_bits.c:1615
int t8_dtri_is_ancestor(const t8_dtri_t *t, const t8_dtri_t *c)
Test if a triangle is an ancestor of another triangle.
Definition: t8_dtri_bits.c:1263
void t8_dtri_child(const t8_dtri_t *t, int childid, t8_dtri_t *child)
Compute the childid-th child in Morton order of a triangle.
Definition: t8_dtri_bits.c:544
int t8_dtri_is_valid(const t8_dtri_t *t)
Query whether all entries of a triangle are in valid ranges.
Definition: t8_dtri_bits.c:1678
void t8_dtri_transform_face(const t8_dtri_t *trianglein, t8_dtri_t *triangle2, int orientation, int sign, int is_smaller_face)
Suppose we have two trees that share a common triangle f.
Definition: t8_dtri_bits.c:1027
void t8_dtri_sibling(const t8_dtri_t *elem, int sibid, t8_dtri_t *sibling)
Compute a specific sibling of a triangle.
Definition: t8_dtri_bits.c:675
int t8_dtri_is_parent(const t8_dtri_t *t, const t8_dtri_t *c)
Test if a triangle is the parent of another triangle.
Definition: t8_dtri_bits.c:1249
int t8_dtri_root_face_to_face(t8_dtri_t *t, int root_face)
Given a triangle and a face of the root triangle.
Definition: t8_dtri_bits.c:878
int t8_dtri_get_level(const t8_dtri_t *t)
Return the level of a triangle.
Definition: t8_dtri_bits.c:1672
void t8_dtri_parent(const t8_dtri_t *t, t8_dtri_t *parent)
Compute the parent of a triangle.
Definition: t8_dtri_bits.c:139
void t8_dtri_children_at_face(const t8_dtri_t *tri, int face, t8_dtri_t *children[], int num_children, int *child_indices)
Given a triangle and a face of the triangle, compute all children of the triangle that touch the face...
Definition: t8_dtri_bits.c:803
int t8_dtri_is_equal(const t8_dtri_t *t1, const t8_dtri_t *t2)
Test if two triangles have the same coordinates, type and level.
Definition: t8_dtri_bits.c:1203
This file defines basic operations on an element in a refinement tree.