MeshHierarchy¶
-
class
dolfin.cpp.mesh.MeshHierarchy(*args)¶ Bases:
objectExperimental implementation of a list of Meshes as a hierarchy.
Constructor with initial mesh.
Parameters: const Mesh > mesh (std::shared_ptr<) – -
coarsen()¶ Coarsen finest mesh by one level, based on markers (level n->n)
Parameters: MeshFunction< bool > & markers (const) – Return type: std::shared_ptr< const MeshHierarchy >
-
coarsest()¶ Get the coarsest mesh of the
MeshHierarchy.Return type: std::shared_ptr< const Mesh >
-
finest()¶ Get the finest mesh of the
MeshHierarchy.Return type: std::shared_ptr< const Mesh >
-
rebalance()¶ Rebalance across processes.
Return type: std::shared_ptr< Mesh >
-
refine()¶ Refine finest mesh of existing hierarchy, creating a new hierarchy (level n -> n+1)
Parameters: MeshFunction< bool > & markers (const) – Return type: std::shared_ptr< const MeshHierarchy >
-
size()¶ Number of meshes.
Return type: unsigned int
-
thisown¶ The membership flag
-
unrefine()¶ Unrefine by returning the previous
MeshHierarchy(level n -> n-1) Returns NULL for aMeshHierarchycontaining a singleMeshReturn type: std::shared_ptr< const MeshHierarchy >
-
weight()¶ Calculate the number of cells on the finest
Meshwhich are descendents of each cell on the coarsestMesh, returning a vector over the cells of the coarsestMesh.Return type: std::vector< std::size_t >
-