8 #include <dolfinx/graph/AdjacencyList.h>
59 std::tuple<graph::AdjacencyList<std::int64_t>, xt::xtensor<double, 2>,
60 std::vector<std::int32_t>>
69 std::tuple<graph::AdjacencyList<std::int64_t>, xt::xtensor<double, 2>,
70 std::vector<std::int32_t>>
A Mesh consists of a set of connected and numbered mesh topological entities, and geometry data.
Definition: Mesh.h:53
Mesh data structures and algorithms on meshes.
Definition: DirichletBC.h:20
std::tuple< graph::AdjacencyList< std::int64_t >, xt::xtensor< double, 2 >, std::vector< std::int32_t > > compute_refinement_data(const mesh::Mesh &mesh, const mesh::MeshTags< std::int8_t > &refinement_marker)
Refine with markers returning new mesh data.
Definition: plaza.cpp:606
mesh::Mesh refine(const mesh::Mesh &mesh, bool redistribute)
Uniform refine, optionally redistributing and optionally calculating the parent-child relation for fa...
Definition: plaza.cpp:514
Mesh refinement algorithms.