4#ifndef DUNE_GMSHREADER_HH
5#define DUNE_GMSHREADER_HH
47 template<
int dimension,
int dimWorld = dimension >
48 class GmshReaderQuadraticBoundarySegment
63 template<
int dimWorld >
64 struct GmshReaderQuadraticBoundarySegment< 2, dimWorld >
69 GmshReaderQuadraticBoundarySegment (
const GlobalVector &p0_,
const GlobalVector &p1_,
const GlobalVector &p2_)
70 : p0(p0_), p1(p1_), p2(p2_)
77 alpha=d1.two_norm()/(d1.two_norm()+d2.two_norm());
78 if (alpha<1E-6 || alpha>1-1E-6)
86 y.axpy((local[0]-alpha)*(local[0]-1.0)/alpha,p0);
87 y.axpy(local[0]*(local[0]-1.0)/(alpha*(alpha-1.0)),p1);
88 y.axpy(local[0]*(local[0]-alpha)/(1.0-alpha),p2);
93 GlobalVector p0,p1,p2;
122 class GmshReaderQuadraticBoundarySegment< 3, 3 >
129 : p0(p0_), p1(p1_), p2(p2_), p3(p3_), p4(p4_), p5(p5_)
137 if (alpha<1E-6 || alpha>1-1E-6)
143 if (beta<1E-6 || beta>1-1E-6)
149 if (gamma<1E-6 || gamma>1-1E-6)
157 y.
axpy(phi0(local),p0);
158 y.
axpy(phi1(local),p1);
159 y.
axpy(phi2(local),p2);
160 y.
axpy(phi3(local),p3);
161 y.
axpy(phi4(local),p4);
162 y.
axpy(phi5(local),p5);
172 return (alpha*beta-beta*local[0]-alpha*local[1])*(1-local[0]-local[1])/(alpha*beta);
176 return local[0]*(1-local[0]-local[1])/(alpha*(1-alpha));
180 return local[0]*(gamma*local[0]-(sqrt2-gamma-sqrt2*alpha)*local[1]-alpha*gamma)/(gamma*(1-alpha));
184 return local[1]*(1-local[0]-local[1])/(beta*(1-beta));
188 return local[0]*local[1]/((1-gamma/sqrt2)*gamma/sqrt2);
192 return local[1]*(beta*(1-gamma/sqrt2)-local[0]*(beta-gamma/sqrt2)-local[1]*(1-gamma/sqrt2))/((1-gamma/sqrt2)*(beta-1));
196 double alpha,beta,gamma,sqrt2;
202 template<
typename Gr
idType>
209 bool insert_boundary_segments;
210 unsigned int number_of_real_vertices;
211 int boundary_element_count;
215 std::string fileName;
217 std::vector<int> boundary_id_to_physical_entity;
218 std::vector<int> element_index_to_physical_entity;
221 static const int dim = GridType::dimension;
222 static const int dimWorld = GridType::dimensionworld;
223 static_assert( (dimWorld <= 3),
"GmshReader requires dimWorld <= 3." );
232 void readfile(FILE * file,
int cnt,
const char * format,
233 void* t1,
void* t2 = 0,
void* t3 = 0,
void* t4 = 0,
234 void* t5 = 0,
void* t6 = 0,
void* t7 = 0,
void* t8 = 0,
235 void* t9 = 0,
void* t10 = 0)
237 off_t pos = ftello(file);
238 int c = fscanf(file, format, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10);
242 <<
": Expected '" << format <<
"', only read " << c <<
" entries instead of " << cnt <<
".");
246 void skipline(FILE * file)
250 c = std::fgetc(file);
251 }
while(c !=
'\n' && c != EOF);
257 factory(_factory), verbose(v), insert_boundary_segments(i) {}
259 std::vector<int> & boundaryIdMap()
261 return boundary_id_to_physical_entity;
264 std::vector<int> & elementIndexMap()
266 return element_index_to_physical_entity;
269 void read (
const std::string& f)
271 if (verbose) std::cout <<
"Reading " << dim <<
"d Gmsh grid..." << std::endl;
275 FILE* file = fopen(fileName.c_str(),
"r");
284 number_of_real_vertices = 0;
285 boundary_element_count = 0;
289 double version_number;
290 int file_type, data_size;
292 readfile(file,1,
"%s\n",buf);
293 if (strcmp(buf,
"$MeshFormat")!=0)
295 readfile(file,3,
"%lg %d %d\n",&version_number,&file_type,&data_size);
296 if( (version_number < 2.0) || (version_number > 2.2) )
298 if (verbose) std::cout <<
"version " << version_number <<
" Gmsh file detected" << std::endl;
299 readfile(file,1,
"%s\n",buf);
300 if (strcmp(buf,
"$EndMeshFormat")!=0)
306 readfile(file,1,
"%s\n",buf);
307 if (strcmp(buf,
"$Nodes")!=0)
309 readfile(file,1,
"%d\n",&number_of_nodes);
310 if (verbose) std::cout <<
"file contains " << number_of_nodes <<
" nodes" << std::endl;
314 std::vector< GlobalVector > nodes( number_of_nodes+1 );
318 for(
int i = 1; i <= number_of_nodes; ++i )
320 readfile(file,4,
"%d %lg %lg %lg\n", &
id, &x[ 0 ], &x[ 1 ], &x[ 2 ] );
322 if (
id > number_of_nodes) {
324 "Only dense sequences of node indices are currently supported (node index "
325 <<
id <<
" is invalid).");
329 for(
int j = 0; j < dimWorld; ++j )
330 nodes[
id ][ j ] = x[ j ];
332 readfile(file,1,
"%s\n",buf);
333 if (strcmp(buf,
"$EndNodes")!=0)
338 readfile(file,1,
"%s\n",buf);
339 if (strcmp(buf,
"$Elements")!=0)
341 int number_of_elements;
342 readfile(file,1,
"%d\n",&number_of_elements);
343 if (verbose) std::cout <<
"file contains " << number_of_elements <<
" elements" << std::endl;
350 long section_element_offset = ftell(file);
351 std::map<int,unsigned int> renumber;
352 for (
int i=1; i<=number_of_elements; i++)
354 int id, elm_type, number_of_tags;
355 readfile(file,3,
"%d %d %d ",&
id,&elm_type,&number_of_tags);
356 for (
int k=1; k<=number_of_tags; k++)
359 readfile(file,1,
"%d ",&blub);
370 if (verbose) std::cout <<
"number of real vertices = " << number_of_real_vertices << std::endl;
371 if (verbose) std::cout <<
"number of boundary elements = " << boundary_element_count << std::endl;
372 if (verbose) std::cout <<
"number of elements = " << element_count << std::endl;
373 readfile(file,1,
"%s\n",buf);
374 if (strcmp(buf,
"$EndElements")!=0)
376 boundary_id_to_physical_entity.resize(boundary_element_count);
377 element_index_to_physical_entity.resize(element_count);
383 fseek(file, section_element_offset, SEEK_SET);
384 boundary_element_count = 0;
386 for (
int i=1; i<=number_of_elements; i++)
388 int id, elm_type, number_of_tags;
389 readfile(file,3,
"%d %d %d ",&
id,&elm_type,&number_of_tags);
390 int physical_entity = -1;
392 for (
int k=1; k<=number_of_tags; k++)
395 readfile(file,1,
"%d ",&blub);
396 if (k==1) physical_entity = blub;
400 readfile(file,1,
"%s\n",buf);
401 if (strcmp(buf,
"$EndElements")!=0)
413 std::map<int,unsigned int> & renumber,
414 const std::vector< GlobalVector > & nodes)
417 const int nDofs[12] = {-1, 2, 3, 4, 4, 8, 6, 5, 3, 6, -1, 10};
418 const int nVertices[12] = {-1, 2, 3, 4, 4, 8, 6, 5, 2, 3, -1, 4};
419 const int elementDim[12] = {-1, 1, 2, 2, 3, 3, 3, 3, 1, 2, -1, 3};
422 if ( not (elm_type >= 0 && elm_type < 12
423 && (elementDim[elm_type] == dim || elementDim[elm_type] == (dim-1) ) ) )
431 for (
int i=1; i<nDofs[elm_type]; i++)
436 std::vector<int> elementDofs(10);
439 &(elementDofs[0]),&(elementDofs[1]),&(elementDofs[2]),
440 &(elementDofs[3]),&(elementDofs[4]),&(elementDofs[5]),
441 &(elementDofs[6]),&(elementDofs[7]),&(elementDofs[8]),
445 for (
int i=0; i<nVertices[elm_type]; i++)
446 if (renumber.find(elementDofs[i])==renumber.end())
448 renumber[elementDofs[i]] = number_of_real_vertices++;
453 if (elementDim[elm_type] == dim)
456 boundary_element_count++;
463 template <
class E,
class V,
class V2>
464 void boundarysegment_insert(
466 const E& elementDofs,
474 template <
class E,
class V>
475 void boundarysegment_insert(
476 const std::vector<FieldVector<double, 3> >& nodes,
477 const E& elementDofs,
481 std::array<FieldVector<double,dimWorld>, 6> v;
482 for (
int i=0; i<6; i++)
483 for (
int j=0; j<dimWorld; j++)
484 v[i][j] = nodes[elementDofs[i]][j];
486 BoundarySegment<dim,dimWorld>* newBoundarySegment
487 = (BoundarySegment<dim,dimWorld>*)
new GmshReaderQuadraticBoundarySegment< 3, 3 >( v[0], v[1], v[2],
491 std::shared_ptr<BoundarySegment<dim,dimWorld> >(newBoundarySegment) );
501 std::map<int,unsigned int> & renumber,
502 const std::vector< GlobalVector > & nodes,
503 const int physical_entity)
506 const int nDofs[12] = {-1, 2, 3, 4, 4, 8, 6, 5, 3, 6, -1, 10};
507 const int nVertices[12] = {-1, 2, 3, 4, 4, 8, 6, 5, 2, 3, -1, 4};
508 const int elementDim[12] = {-1, 1, 2, 2, 3, 3, 3, 3, 1, 2, -1, 3};
511 if ( not (elm_type >= 0 && elm_type < 12
512 && (elementDim[elm_type] == dim || elementDim[elm_type] == (dim-1) ) ) )
520 for (
int i=1; i<nDofs[elm_type]; i++)
525 std::vector<int> elementDofs(10);
528 &(elementDofs[0]),&(elementDofs[1]),&(elementDofs[2]),
529 &(elementDofs[3]),&(elementDofs[4]),&(elementDofs[5]),
530 &(elementDofs[6]),&(elementDofs[7]),&(elementDofs[8]),
537 std::swap(elementDofs[2],elementDofs[3]);
540 std::swap(elementDofs[2],elementDofs[3]);
541 std::swap(elementDofs[6],elementDofs[7]);
544 std::swap(elementDofs[2],elementDofs[3]);
550 std::vector<unsigned int> vertices(nVertices[elm_type]);
552 for (
int i=0; i<nVertices[elm_type]; i++)
553 vertices[i] = renumber[elementDofs[i]];
556 if (elementDim[elm_type] == dim) {
591 if (insert_boundary_segments) {
604 std::array<FieldVector<double,dimWorld>, 3> v;
605 for (
int i=0; i<dimWorld; i++) {
606 v[0][i] = nodes[elementDofs[0]][i];
607 v[1][i] = nodes[elementDofs[2]][i];
608 v[2][i] = nodes[elementDofs[1]][i];
617 boundarysegment_insert(nodes, elementDofs, vertices);
627 if (elementDim[elm_type] == dim) {
628 element_index_to_physical_entity[element_count] = physical_entity;
631 boundary_id_to_physical_entity[boundary_element_count] = physical_entity;
632 boundary_element_count++;
655 template<
typename Gr
idType>
659 typedef GridType Grid;
662 static Grid*
read (
const std::string& fileName,
bool verbose =
true,
bool insertBoundarySegments=
true)
669 parser.read(fileName);
675 static Grid*
read (
const std::string& fileName,
676 std::vector<int>& boundarySegmentToPhysicalEntity,
677 std::vector<int>& elementToPhysicalEntity,
678 bool verbose =
true,
bool insertBoundarySegments=
true)
685 parser.read(fileName);
687 boundarySegmentToPhysicalEntity.swap(parser.boundaryIdMap());
688 elementToPhysicalEntity.swap(parser.elementIndexMap());
695 bool verbose =
true,
bool insertBoundarySegments=
true)
699 parser.read(fileName);
704 const std::string& fileName,
705 std::vector<int>& boundarySegmentToPhysicalEntity,
706 std::vector<int>& elementToPhysicalEntity,
707 bool verbose =
true,
bool insertBoundarySegments=
true)
711 parser.read(fileName);
713 boundarySegmentToPhysicalEntity.swap(parser.boundaryIdMap());
714 elementToPhysicalEntity.swap(parser.elementIndexMap());
Base class for grid boundary segments of arbitrary geometry.
FieldTraits< value_type >::real_type two_norm() const
two norm sqrt(sum over squared values of entries)
Definition: densevector.hh:590
derived_type & axpy(const field_type &a, const DenseVector< Other > &y)
vector space axpy operation ( *this += a y )
Definition: densevector.hh:524
vector space out of a tensor product of fields.
Definition: fvector.hh:93
dimension independent parts for GmshReaderParser
Definition: gmshreader.hh:204
void pass1HandleElement(FILE *file, const int elm_type, std::map< int, unsigned int > &renumber, const std::vector< GlobalVector > &nodes)
Process one element during the first pass through the list of all elements.
Definition: gmshreader.hh:412
virtual void pass2HandleElement(FILE *file, const int elm_type, std::map< int, unsigned int > &renumber, const std::vector< GlobalVector > &nodes, const int physical_entity)
Process one element during the second pass through the list of all elements.
Definition: gmshreader.hh:500
Read Gmsh mesh file.
Definition: gmshreader.hh:657
static Grid * read(const std::string &fileName, std::vector< int > &boundarySegmentToPhysicalEntity, std::vector< int > &elementToPhysicalEntity, bool verbose=true, bool insertBoundarySegments=true)
Definition: gmshreader.hh:675
static Grid * read(const std::string &fileName, bool verbose=true, bool insertBoundarySegments=true)
Definition: gmshreader.hh:662
static void read(Dune::GridFactory< Grid > &factory, const std::string &fileName, bool verbose=true, bool insertBoundarySegments=true)
Definition: gmshreader.hh:694
static void read(Dune::GridFactory< Grid > &factory, const std::string &fileName, std::vector< int > &boundarySegmentToPhysicalEntity, std::vector< int > &elementToPhysicalEntity, bool verbose=true, bool insertBoundarySegments=true)
Definition: gmshreader.hh:703
Provide a generic factory class for unstructured grids.
Definition: gridfactory.hh:263
virtual void insertElement(const GeometryType &type, const std::vector< unsigned int > &vertices)
Insert an element into the coarse grid.
Definition: gridfactory.hh:290
virtual GridType * createGrid()
Finalize grid creation and hand over the grid.
Definition: gridfactory.hh:316
virtual void insertVertex(const FieldVector< ctype, dimworld > &pos)
Insert a vertex into the coarse grid.
Definition: gridfactory.hh:279
virtual void insertBoundarySegment(const std::vector< unsigned int > &vertices)
insert a boundary segment
Definition: gridfactory.hh:308
Default exception class for I/O errors.
Definition: exceptions.hh:229
Provide a generic factory class for unstructured grids.
A few common exception classes.
Implements a vector constructed from a given type representing a field and a compile-time given size.
#define DUNE_THROW(E, m)
Definition: exceptions.hh:216
constexpr GeometryType line
GeometryType representing a line.
Definition: type.hh:733
constexpr GeometryType prism
GeometryType representing a 3D prism.
Definition: type.hh:763
constexpr GeometryType triangle
GeometryType representing a triangle.
Definition: type.hh:739
constexpr GeometryType quadrilateral
GeometryType representing a quadrilateral (a square).
Definition: type.hh:745
constexpr GeometryType hexahedron
GeometryType representing a hexahedron.
Definition: type.hh:769
constexpr GeometryType pyramid
GeometryType representing a 3D pyramid.
Definition: type.hh:757
constexpr GeometryType tetrahedron
GeometryType representing a tetrahedron.
Definition: type.hh:751
static std::string formatString(const std::string &s, const T &... args)
Format values according to printf format string.
Definition: stringutility.hh:72
Dune namespace.
Definition: alignedallocator.hh:10
Base class for classes implementing geometries of boundary segments.
Definition: boundarysegment.hh:30
Options for read operation.
Definition: gmshreader.hh:35
GeometryOrder
Definition: gmshreader.hh:36
@ firstOrder
edges are straight lines.
Definition: gmshreader.hh:38
@ secondOrder
quadratic boundary approximation.
Definition: gmshreader.hh:40
A unique label for each type of element that can occur in a grid.