DOLFINx
0.3.0
DOLFINx C++ interface
|
Right cuboid mesh creation. More...
Functions | |
mesh::Mesh | create (MPI_Comm comm, const std::array< std::array< double, 3 >, 2 > &p, std::array< std::size_t, 3 > n, mesh::CellType celltype, const mesh::GhostMode ghost_mode, const mesh::CellPartitionFunction &partitioner=static_cast< graph::AdjacencyList< std::int32_t >(*)(MPI_Comm, int, int, const graph::AdjacencyList< std::int64_t > &, mesh::GhostMode)>(&mesh::partition_cells_graph)) |
Create a uniform mesh::Mesh over the rectangular prism spanned by the two points p . The order of the two points is not important in terms of minimum and maximum coordinates. The total number of vertices will be (n[0] + 1)*(n[1] + 1)*(n[2] + 1) . For tetrahedra there will be will be 6*n[0]*n[1]*n[2] cells. For hexahedra the number of cells will be n[0]*n[1]*n[2] . More... | |
Right cuboid mesh creation.
mesh::Mesh dolfinx::generation::BoxMesh::create | ( | MPI_Comm | comm, |
const std::array< std::array< double, 3 >, 2 > & | p, | ||
std::array< std::size_t, 3 > | n, | ||
mesh::CellType | celltype, | ||
const mesh::GhostMode | ghost_mode, | ||
const mesh::CellPartitionFunction & | partitioner = static_cast<graph::AdjacencyList<std::int32_t> (*)( MPI_Comm, int, int, const graph::AdjacencyList<std::int64_t>&, mesh::GhostMode)>(&mesh::partition_cells_graph) |
||
) |
Create a uniform mesh::Mesh over the rectangular prism spanned by the two points p
. The order of the two points is not important in terms of minimum and maximum coordinates. The total number of vertices will be (n[0] + 1)*(n[1] + 1)*(n[2] + 1)
. For tetrahedra there will be will be 6*n[0]*n[1]*n[2]
cells. For hexahedra the number of cells will be n[0]*n[1]*n[2]
.
[in] | comm | MPI communicator to build mesh on |
[in] | p | Points of box |
[in] | n | Number of cells in each direction. |
[in] | celltype | Cell shape |
[in] | ghost_mode | Ghost mode |
[in] | partitioner | Partitioning function to use for determining the parallel distribution of cells across MPI ranks |