Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 1234]

▼NDune
▼NFem
CTwistUtility< MMesh< HostGrid, dim > >	Specialization of TwistUtility for MMesh
CTwistUtility< MMeshInterfaceGrid< MMesh > >	Specialization of TwistUtility for MMesh InterfaceGrid
▼NMMeshDefaults
CDelaunay< 2 >	A Delaunay triangulation in 2D
CDelaunay< 3 >	A Delaunay triangulation in 3D
CElementInfo	The element and vertex infos used by the dune-mmesh implementation
CTriangulation< 2 >	A triangulation in 2D
CTriangulation< 3 >	A triangulation in 3D
▼NPython
▼NMMesh
CInterfaceNeighborStencil	Stencil contaning the entries (en,ien) for all entities en in the bulk and interface edges ien
CNeighborInterfaceStencil	Stencil contaning the entries (ien,en) for all interface entities ien and adjacent bulk entities en
CCurvatureOperator	Class defining an operator that assigns a curvature to each element or each vertex of the interface grid. The curvature is approximated by interpolation with a sphere (through the center points of an interface element and its neighbors). The enum CurvatureLayout determines whether the curvature is approximated at the vertices or elements of the grid. NOTE that the algorithm IN 3D might provide poor approximations for non-spherical interfaces and IN 3D the algorithm in general does not converge under grid refinement
CDelaunayTriangulationWrapper	DelaunayTriangulationWrapper
CDistance	Class for computing the distance to the interface
CGridFactory< MMesh< HostGrid, dim > >	Specialization of the GridFactory for MMesh
CGridFactory< MMeshInterfaceGrid< MMeshImp > >	Specialization of the GridFactory for MMesh InterfaceGrid
CHashUIntArray	Hash a UInt array
CHashUIntVector	Hash a UInt vector
CLongestEdgeRefinement	Class defining a longest edge refinement strategy
CMMesh	The MMesh class templatized by the CGAL host grid type and the dimension
CMMeshCachingEntity< 0, dim, GridImp >	The implementation of caching entities in a MMeshThe caching entity copys the CGAL face object instead of holding a Face_handle pointer
CMMeshConnectedComponent	The implementation of a connected component of entities in MMeshThe connected component stores a list of connected entities providing geometrical information for the remeshing step
CMMeshEdgeIncidentInterfaceElementsIteratorImp	Forward declaration
CMMeshEdgeIncidentInterfaceElementsIteratorImp< GridImp, 2 >	3D
CMMeshEdgeIncidentIteratorImp	Forward declaration
CMMeshEdgeIncidentIteratorImp< GridImp, 3 >	3D
CMMeshEntity	The implementation of entities in a MMesh
CMMeshEntity< 0, dim, GridImp >	The implementation of entities in MMesh
CMMeshEntitySeed	The EntitySeed class provides the minimal information needed to restore an Entity using the grid.We use the host grid entity as seed
CMMeshExplicitGridFactory	Specialization of the explicit GridFactory for MMesh
CMMeshGeometry	Geometry
CMMeshGeometry< md, 2, GridImp >	2D Geometry
CMMeshGeometry< md, 3, GridImp >	3D Geometry
CMMeshHierarchicIterator	Iterator over the descendants of an entity.Mesh entities of codimension 0 ("elements") allow to visit all entities of codimension 0 obtained through nested, hierarchic refinement of the entity. Iteration over this set of entities is provided by the HierarchicIterator, starting from a given entity
CMMeshImplicitGridFactory	Specialization of the implicit GridFactory for MMesh
CMMeshIncidentFacetsIteratorImp	Forward declaration
CMMeshIncidentFacetsIteratorImp< GridImp, 2 >	Iterator over all incident facets
CMMeshIncidentFacetsIteratorImp< GridImp, 3 >	3D
CMMeshIncidentInterfaceElementsIteratorImp	Iterator over all incident interface elements
CMMeshIncidentInterfaceElementsIteratorImp< GridImp, 1 >	2D
CMMeshIncidentInterfaceElementsIteratorImp< GridImp, 2 >	3D
CMMeshIncidentInterfaceVerticesIteratorImp	Iterator over all incident interface vertices
CMMeshIncidentInterfaceVerticesIteratorImp< GridImp, 1 >	2D
CMMeshIncidentInterfaceVerticesIteratorImp< GridImp, 2 >	3D
CMMeshIncidentIteratorImp	Forward declaration
CMMeshIncidentIteratorImp< GridImp, 2 >	Iterator over all incident entities
CMMeshIncidentIteratorImp< GridImp, 3 >	3D
CMMeshIncidentVerticesIteratorImp	Forward declaration
CMMeshIncidentVerticesIteratorImp< GridImp, 2 >	Iterator over all incident vertices
CMMeshIncidentVerticesIteratorImp< GridImp, 3 >	3D
CMMeshInterfaceCachingEntity< 0, dim, GridImp >	The implementation of caching entities in a MMesh interface grid
CMMeshInterfaceConnectedComponent	The implementation of connected components in a MMeshInterfaceGridThe connected component copies the vertex coordinates and ids
CMMeshInterfaceGrid	Provides a DUNE grid interface class for the interface of a MMesh interface grid
CMMeshInterfaceGridEntity	The implementation of entities in a MMesh interface grid
CMMeshInterfaceGridEntity< 0, dim, GridImp >	Specialization for codim-0-entities
CMMeshInterfaceGridEntitySeed	The EntitySeed class provides the minimal information needed to restore an Entity using the grid.We use the host grid entity as seed
CMMeshInterfaceGridGeometry	Geometry
CMMeshInterfaceGridGeometry< md, 1, GridImp >	The local geometry (2D)
CMMeshInterfaceGridGeometry< md, 2, GridImp >	2D Geometry
CMMeshInterfaceGridGeometry< md, 3, GridImp >	3D Geometry
CMMeshInterfaceGridHierarchicIterator	Iterator over the descendants of an entity.Mesh entities of codimension 0 ("elements") allow to visit all entities of codimension 0 obtained through nested, hierarchic refinement of the entity. Iteration over this set of entities is provided by the HierarchicIterator, starting from a given entity
CMMeshInterfaceGridLeafIntersection	An intersection with a leaf neighbor elementMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
CMMeshInterfaceGridLeafIntersectionIterator	Iterator over all element neighborsMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
CMMeshInterfaceGridLeafIteratorImp	Iterator over all entities of a given codimension and level of a grid (2D)
CMMeshInterfaceGridLeafIteratorImp< 0, pitype, GridImp, std::enable_if_t< GridImp::dimensionworld==2 > >	MMeshInterfaceGridLeafIteratorImp for 2D
CMMeshInterfaceGridLeafIteratorImp< 0, pitype, GridImp, std::enable_if_t< GridImp::dimensionworld==3 > >	MMeshInterfaceGridLeafIteratorImp for 3D
CMMeshInterfaceIteratorImp	Forward declarations
CMMeshInterfaceIteratorImp< 1, GridImp, 2 >	Iterator over all interface entities of a given codimension
CMMeshInterfaceIteratorImp< 1, GridImp, 3 >	3D codim 1
CMMeshInterfaceVertexIteratorImp	Forward declarations
CMMeshLeafIntersection	An intersection with a leaf neighbor elementMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
CMMeshLeafIntersectionIterator	Iterator over all element neighborsMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
CMMeshLeafIteratorImp	Iterator over all entities of a given codimension and level of a grid (2D)
CMMeshLeafIteratorImp< 0, pitype, GridImp, std::enable_if_t< GridImp::dimension==2 > >	MMeshLeafIterator for 2D
CMMeshLeafIteratorImp< 0, pitype, GridImp, std::enable_if_t< GridImp::dimension==3 > >	MMeshLeafIterator for 3D
CMMeshLeafIteratorImp< 1, pitype, GridImp, std::enable_if_t< GridImp::dimension==3 > >	Facet iterator
CMMeshLeafIteratorImp< 2, pitype, GridImp, std::enable_if_t< GridImp::dimension==3 > >	Edge iterator
CMMeshLeafIteratorImp< 3, pitype, GridImp, std::enable_if_t< GridImp::dimension==3 > >	Vertex iterator
CRatioIndicator	Class defining an indicator for grid remeshing regarding the edge length ratio. By default, we take 2x length of the longest edge contained in the interface as maximal edge length and 0.5x length of the shortest edge as minimal edge length
CTriangulationWrapper< 2 >	TriangulationWrapper<2>
CTriangulationWrapper< 3 >	TriangulationWrapper<3>
▼Nstd	STL namespace
Chash< Dune::MMeshImpl::MultiId >	Overload std::hash