3#ifndef DUNE_POLYHEDRALGRID_GRIDFACTORY_HH
4#define DUNE_POLYHEDRALGRID_GRIDFACTORY_HH
9#include <dune/common/typetraits.hh>
10#include <dune/common/version.hh>
11#if DUNE_VERSION_LT(DUNE_GRID, 2, 8)
12#include <dune/common/to_unique_ptr.hh>
15#include <dune/grid/common/gridfactory.hh>
25 template<
int dim,
int dimworld,
class coord_t >
27 :
public GridFactoryInterface< PolyhedralGrid< dim, dimworld, coord_t > >
32 const static int dimension = Grid::dimension;
33 const static int dimensionworld = Grid::dimensionworld;
37 typedef typename Grid::template Codim<0>::Entity
Element;
38 typedef typename Grid::template Codim<dimension>::Entity
Vertex;
43#if DUNE_VERSION_LT(DUNE_GRID, 2, 8)
58 nodes_.push_back( pos );
71 const std::vector<unsigned int>& items)
76 std::vector< int > numbers( items.size() );
77 std::copy( items.begin(), items.end(), numbers.begin() );
79 if( type.dim() == dimension-1 )
81 faces_.push_back( numbers );
83 else if( type.dim() == dimension )
87 cells_.push_back( numbers );
91 DUNE_THROW(Dune::NotImplemented,
"insertElement not implemented for type " << type );
103 DUNE_THROW(NotImplemented,
"yet");
108 std::vector< CoordinateType >& nodes = nodes_;
109 std::vector< std::vector< int > >& faces = faces_;
110 std::vector< std::vector< int > >& cells = cells_;
114 DUNE_THROW( GridError,
"No cells found for PolyhedralGrid" );
117 const auto sumSize = [] ( std::size_t s,
const std::vector< int > &v ) {
return s + v.size(); };
118 const std::size_t numFaceNodes = std::accumulate( faces.begin(), faces.end(), std::size_t( 0 ), sumSize );
119 const std::size_t
numCellFaces = std::accumulate( cells.begin(), cells.end(), std::size_t( 0 ), sumSize );
122 Grid::allocateGrid( cells.size(), faces.size(), numFaceNodes,
numCellFaces, nodes.size() );
127 std::map< std::vector< int >, std::vector< int > > faceMap;
130 const int nFaces = faces.size();
132 std::fill( ug->face_cells, ug->face_cells + 2*nFaces, -1 );
135 std::vector< int > faceVertices;
136 faceVertices.reserve( 30 );
137 for(
int face = 0; face < nFaces; ++face )
140 faceVertices.clear();
141 ug->face_nodepos[ face ] = facepos;
142 const int nVertices = faces[ face ].size();
143 for(
int vx = 0; vx < nVertices; ++vx, ++facepos )
146 ug->face_nodes[ facepos ] = faces[ face ][ vx ];
147 faceVertices.push_back( faces[ face ][ vx ] );
153 std::sort( faceVertices.begin(), faceVertices.end() );
155 faceMap[ faceVertices ].push_back( face );
156 assert( faceMap[ faceVertices ].size() == 1 );
159 ug->face_nodepos[ nFaces ] = facepos ;
164 const int nCells = cells.size();
166 for(
int cell = 0; cell < nCells; ++cell )
169 ug->cell_facepos[ cell ] = cellpos;
170 const int nFaces = cells[ cell ].size();
171 for(
int f = 0; f < nFaces; ++f, ++cellpos )
173 const int face = cells[ cell ][ f ];
175 ug->cell_faces[ cellpos ] = face;
178 if( ug->face_cells[ 2*face ] == -1 )
180 ug->face_cells[ 2*face ] = cell;
185 ug->face_cells[ 2*face+1 ] = cell;
190 ug->cell_facepos[ nCells ] = cellpos ;
195 const int nNodes = nodes.size();
197 for(
int vx = 0 ; vx < nNodes; ++vx )
199 for(
int d=0; d<dim; ++d, ++nodepos )
200 ug->node_coordinates[ nodepos ] = nodes[ vx ][ d ];
213 if( ug->cell_facetag )
215 std::free( ug->cell_facetag );
216 ug->cell_facetag = nullptr ;
217 for(
int i=0; i<3; ++i ) ug->cartdims[ i ] = 0;
221 Grid::computeGeometry( ug );
225 for(
int face = 0 ; face < ug->number_of_faces; ++face )
227 const int a = ug->face_cells[ 2*face ];
228 const int b = ug->face_cells[ 2*face + 1 ];
235 for(
int d=0; d<dim; ++d )
238 centerDiff[ d ] = ug->cell_centroids[
b*dim + d ] - ug->cell_centroids[ a*dim + d ];
239 normal[ d ] = ug->face_normals[ face*dim + d ];
243 if( centerDiff * normal > 0 )
245 ug->face_cells[ 2*face ] =
b;
246 ug->face_cells[ 2*face + 1 ] = a;
256 std::vector< std::vector< int > >
faces_;
257 std::vector< std::vector< int > >
cells_;
virtual void insertElement(const GeometryType &type, const std::vector< unsigned int > &items)
Insert an element into the coarse grid.
Definition: gridfactory.hh:70
std::vector< std::vector< int > > faces_
Definition: gridfactory.hh:256
void insertBoundarySegment(const std::vector< unsigned int > &)
Definition: gridfactory.hh:101
virtual void insertVertex(const CoordinateType &pos)
Definition: gridfactory.hh:56
PolyhedralGrid< dim, dimworld, coord_t > Grid
Definition: gridfactory.hh:30
Grid::template Codim< 0 >::Entity Element
Definition: gridfactory.hh:37
std::unique_ptr< Grid > UniquePtrType
Definition: gridfactory.hh:46
GridFactory(const MPICommunicatorType &=MPIHelper::getCommunicator())
Default constructor.
Definition: gridfactory.hh:50
std::vector< CoordinateType > nodes_
Definition: gridfactory.hh:255
Grid::template Codim< dimension >::Entity Vertex
Definition: gridfactory.hh:38
MPIHelper::MPICommunicator MPICommunicatorType
Definition: gridfactory.hh:36
Dune::FieldVector< ctype, dimensionworld > CoordinateType
Definition: gridfactory.hh:40
UniquePtrType createGrid()
Definition: gridfactory.hh:106
CoordinateType Coordinate
Definition: gridfactory.hh:41
Grid::ctype ctype
Definition: gridfactory.hh:34
std::vector< std::vector< int > > cells_
Definition: gridfactory.hh:257
identical grid wrapper
Definition: grid.hh:159
Traits::ctype ctype
type of vector coordinates (e.g., double)
Definition: grid.hh:308
std::unique_ptr< UnstructuredGridType, UnstructuredGridDeleter > UnstructuredGridPtr
Definition: grid.hh:178
The namespace Dune is the main namespace for all Dune code.
Definition: common/CartesianIndexMapper.hpp:10
int numCellFaces(const Dune::CpGrid &grid)
Get the number of faces, where each face counts as many times as there are adjacent faces.
double b(const Dune::FieldVector< ct, dimworld > &x, double t)
Definition: transportproblem2.hh:25