1 // Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // SMESH SMESH : implementaion of SMESH idl descriptions
23 // File : StdMeshers_Hexa_3D.cxx
24 // Moved here from SMESH_Hexa_3D.cxx
25 // Author : Paul RASCLE, EDF
28 #include "StdMeshers_Hexa_3D.hxx"
29 #include "StdMeshers_CompositeHexa_3D.hxx"
30 #include "StdMeshers_FaceSide.hxx"
31 #include "StdMeshers_Penta_3D.hxx"
32 #include "StdMeshers_Prism_3D.hxx"
33 #include "StdMeshers_Quadrangle_2D.hxx"
35 #include "SMESH_Gen.hxx"
36 #include "SMESH_Mesh.hxx"
37 #include "SMESH_subMesh.hxx"
38 #include "SMESH_Comment.hxx"
40 #include "SMDS_MeshElement.hxx"
41 #include "SMDS_MeshNode.hxx"
42 #include "SMDS_FacePosition.hxx"
43 #include "SMDS_VolumeTool.hxx"
44 #include "SMDS_VolumeOfNodes.hxx"
47 #include <TopExp_Explorer.hxx>
48 #include <TopTools_IndexedDataMapOfShapeListOfShape.hxx>
49 #include <TopTools_ListIteratorOfListOfShape.hxx>
50 #include <TopTools_ListOfShape.hxx>
51 #include <TopTools_SequenceOfShape.hxx>
52 #include <TopTools_MapOfShape.hxx>
54 #include <gp_Pnt2d.hxx>
56 #include "utilities.h"
57 #include "Utils_ExceptHandlers.hxx"
59 typedef SMESH_Comment TComm;
63 static SMESH_ComputeErrorPtr ComputePentahedralMesh(SMESH_Mesh &,
64 const TopoDS_Shape &);
66 static bool EvaluatePentahedralMesh(SMESH_Mesh &, const TopoDS_Shape &,
69 //=============================================================================
73 //=============================================================================
75 StdMeshers_Hexa_3D::StdMeshers_Hexa_3D(int hypId, int studyId, SMESH_Gen * gen)
76 :SMESH_3D_Algo(hypId, studyId, gen)
78 MESSAGE("StdMeshers_Hexa_3D::StdMeshers_Hexa_3D");
80 _shapeType = (1 << TopAbs_SHELL) | (1 << TopAbs_SOLID); // 1 bit /shape type
83 //=============================================================================
87 //=============================================================================
89 StdMeshers_Hexa_3D::~StdMeshers_Hexa_3D()
91 MESSAGE("StdMeshers_Hexa_3D::~StdMeshers_Hexa_3D");
94 //================================================================================
96 * \brief Clear fields and return the argument
97 * \param res - the value to return
98 * \retval bool - the argument value
100 //================================================================================
102 bool StdMeshers_Hexa_3D::ClearAndReturn(FaceQuadStruct* theQuads[6], const bool res)
104 for (int i = 0; i < 6; i++) {
112 //=============================================================================
116 //=============================================================================
118 bool StdMeshers_Hexa_3D::CheckHypothesis
120 const TopoDS_Shape& aShape,
121 SMESH_Hypothesis::Hypothesis_Status& aStatus)
123 // check nb of faces in the shape
125 aStatus = SMESH_Hypothesis::HYP_BAD_GEOMETRY;
127 for (TopExp_Explorer exp(aShape, TopAbs_FACE); exp.More(); exp.Next())
133 aStatus = SMESH_Hypothesis::HYP_OK;
137 //=======================================================================
138 //function : isCloser
140 //=======================================================================
142 inline bool isCloser(const int i, const int j, const int nbhoriz,
143 const FaceQuadStruct* quad, const gp_Pnt2d uv,
146 int ij = j * nbhoriz + i;
147 gp_Pnt2d uv2( quad->uv_grid[ij].u, quad->uv_grid[ij].v );
148 double dist = uv.SquareDistance( uv2 );
149 if ( dist < minDist ) {
156 //=======================================================================
158 //purpose : return i,j of the node
159 //=======================================================================
161 static bool findIJ (const SMDS_MeshNode* node, const FaceQuadStruct * quad, int& I, int& J)
163 const SMDS_FacePosition* fpos =
164 static_cast<const SMDS_FacePosition*>(node->GetPosition().get());
165 if ( ! fpos ) return false;
166 gp_Pnt2d uv( fpos->GetUParameter(), fpos->GetVParameter() );
168 double minDist = DBL_MAX;
169 const int nbhoriz = quad->side[0]->NbPoints();
170 const int nbvertic = quad->side[1]->NbPoints();
171 I = nbhoriz/2; J = nbvertic/2;
175 while ( I + 2 < nbhoriz && isCloser( I + 1, J, nbhoriz, quad, uv, minDist ))
178 while ( I - 1 > 0 && isCloser( I - 1, J, nbhoriz, quad, uv, minDist ))
180 if ( minDist < DBL_MIN )
183 while ( J + 2 < nbvertic && isCloser( I, J + 1, nbhoriz, quad, uv, minDist ))
186 while ( J - 1 > 0 && isCloser( I, J - 1, nbhoriz, quad, uv, minDist ))
188 if ( minDist < DBL_MIN )
191 } while ( I != oldI || J != oldJ );
193 if ( minDist > DBL_MIN ) {
194 for (int i = 1; i < nbhoriz - 1; i++)
195 for (int j = 1; j < nbvertic - 1; j++)
196 if ( isCloser( i, j, nbhoriz, quad, uv, minDist ))
203 //=============================================================================
205 * Hexahedron mesh on hexaedron like form
206 * -0. - shape and face mesh verification
207 * -1. - identify faces and vertices of the "cube"
208 * -2. - Algorithm from:
209 * "Application de l'interpolation transfinie à la création de maillages
210 * C0 ou G1 continus sur des triangles, quadrangles, tetraedres, pentaedres
211 * et hexaedres déformés."
212 * Alain PERONNET - 8 janvier 1999
214 //=============================================================================
216 bool StdMeshers_Hexa_3D::Compute(SMESH_Mesh & aMesh,
217 const TopoDS_Shape & aShape)// throw(SALOME_Exception)
219 // PAL14921. Enable catching std::bad_alloc and Standard_OutOfMemory outside
220 //Unexpect aCatch(SalomeException);
221 MESSAGE("StdMeshers_Hexa_3D::Compute");
222 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
224 // 0. - shape and face mesh verification
225 // 0.1 - shape must be a solid (or a shell) with 6 faces
227 vector < SMESH_subMesh * >meshFaces;
228 for (TopExp_Explorer exp(aShape, TopAbs_FACE); exp.More(); exp.Next()) {
229 SMESH_subMesh *aSubMesh = aMesh.GetSubMeshContaining(exp.Current());
231 meshFaces.push_back(aSubMesh);
233 if (meshFaces.size() != 6) {
234 //return error(COMPERR_BAD_SHAPE, TComm(meshFaces.size())<<" instead of 6 faces in a block");
235 static StdMeshers_CompositeHexa_3D compositeHexa(-10, 0, aMesh.GetGen());
236 if ( !compositeHexa.Compute( aMesh, aShape ))
237 return error( compositeHexa.GetComputeError() );
241 // 0.2 - is each face meshed with Quadrangle_2D? (so, with a wire of 4 edges)
243 // tool for working with quadratic elements
244 SMESH_MesherHelper aTool (aMesh);
245 _quadraticMesh = aTool.IsQuadraticSubMesh(aShape);
248 typedef struct cubeStruct
258 faceQuadStruct* quad_X0;
259 faceQuadStruct* quad_X1;
260 faceQuadStruct* quad_Y0;
261 faceQuadStruct* quad_Y1;
262 faceQuadStruct* quad_Z0;
263 faceQuadStruct* quad_Z1;
264 Point3DStruct* np; // normalised 3D coordinates
270 FaceQuadStruct* aQuads[6];
271 for (int i = 0; i < 6; i++)
274 for (int i = 0; i < 6; i++)
276 TopoDS_Shape aFace = meshFaces[i]->GetSubShape();
277 SMESH_Algo *algo = _gen->GetAlgo(aMesh, aFace);
278 string algoName = algo->GetName();
279 bool isAllQuad = false;
280 if (algoName == "Quadrangle_2D") {
281 SMESHDS_SubMesh * sm = meshDS->MeshElements( aFace );
284 SMDS_ElemIteratorPtr eIt = sm->GetElements();
285 while ( isAllQuad && eIt->more() ) {
286 const SMDS_MeshElement* elem = eIt->next();
287 isAllQuad = ( elem->NbNodes()==4 ||(_quadraticMesh && elem->NbNodes()==8) );
292 SMESH_ComputeErrorPtr err = ComputePentahedralMesh(aMesh, aShape);
293 return ClearAndReturn( aQuads, error(err));
295 StdMeshers_Quadrangle_2D *quadAlgo =
296 dynamic_cast < StdMeshers_Quadrangle_2D * >(algo);
299 aQuads[i] = quadAlgo->CheckAnd2Dcompute(aMesh, aFace, _quadraticMesh);
301 return error( quadAlgo->GetComputeError());
304 catch(SALOME_Exception & S_ex) {
305 return ClearAndReturn( aQuads, error(COMPERR_SLM_EXCEPTION,TComm(S_ex.what()) <<
306 " Raised by StdMeshers_Quadrangle_2D "
307 " on face #" << meshDS->ShapeToIndex( aFace )));
310 // 0.2.1 - number of points on the opposite edges must be the same
311 if (aQuads[i]->side[0]->NbPoints() != aQuads[i]->side[2]->NbPoints() ||
312 aQuads[i]->side[1]->NbPoints() != aQuads[i]->side[3]->NbPoints()
313 /*aQuads[i]->side[0]->NbEdges() != 1 ||
314 aQuads[i]->side[1]->NbEdges() != 1 ||
315 aQuads[i]->side[2]->NbEdges() != 1 ||
316 aQuads[i]->side[3]->NbEdges() != 1*/) {
317 MESSAGE("different number of points on the opposite edges of face " << i);
318 // Try to go into penta algorithm 'cause it has been improved.
319 SMESH_ComputeErrorPtr err = ComputePentahedralMesh(aMesh, aShape);
320 return ClearAndReturn( aQuads, error(err));
324 // 1. - identify faces and vertices of the "cube"
325 // 1.1 - ancestor maps vertex->edges in the cube
327 // TopTools_IndexedDataMapOfShapeListOfShape MS;
328 // TopExp::MapShapesAndAncestors(aShape, TopAbs_VERTEX, TopAbs_EDGE, MS);
330 // 1.2 - first face is choosen as face Y=0 of the unit cube
332 const TopoDS_Shape & aFace = meshFaces[0]->GetSubShape();
333 //const TopoDS_Face & F = TopoDS::Face(aFace);
335 // 1.3 - identify the 4 vertices of the face Y=0: V000, V100, V101, V001
337 aCube.V000 = aQuads[0]->side[0]->FirstVertex(); // will be (0,0,0) on the unit cube
338 aCube.V100 = aQuads[0]->side[0]->LastVertex(); // will be (1,0,0) on the unit cube
339 aCube.V001 = aQuads[0]->side[2]->FirstVertex(); // will be (0,0,1) on the unit cube
340 aCube.V101 = aQuads[0]->side[2]->LastVertex(); // will be (1,0,1) on the unit cube
342 TopTools_IndexedMapOfShape MV0;
343 TopExp::MapShapes(aFace, TopAbs_VERTEX, MV0);
345 aCube.V010 = OppositeVertex( aCube.V000, MV0, aQuads);
346 aCube.V110 = OppositeVertex( aCube.V100, MV0, aQuads);
347 aCube.V011 = OppositeVertex( aCube.V001, MV0, aQuads);
348 aCube.V111 = OppositeVertex( aCube.V101, MV0, aQuads);
350 // 1.6 - find remaining faces given 4 vertices
353 int _indY1 = GetFaceIndex(aMesh, aShape, meshFaces,
354 aCube.V010, aCube.V011, aCube.V110, aCube.V111);
355 int _indZ0 = GetFaceIndex(aMesh, aShape, meshFaces,
356 aCube.V000, aCube.V010, aCube.V100, aCube.V110);
357 int _indZ1 = GetFaceIndex(aMesh, aShape, meshFaces,
358 aCube.V001, aCube.V011, aCube.V101, aCube.V111);
359 int _indX0 = GetFaceIndex(aMesh, aShape, meshFaces,
360 aCube.V000, aCube.V001, aCube.V010, aCube.V011);
361 int _indX1 = GetFaceIndex(aMesh, aShape, meshFaces,
362 aCube.V100, aCube.V101, aCube.V110, aCube.V111);
364 // IPAL21120: SIGSEGV on Meshing attached Compound with Automatic Hexadralization
365 if ( _indY1 < 1 || _indZ0 < 1 || _indZ1 < 1 || _indX0 < 1 || _indX1 < 1 )
366 return error(COMPERR_BAD_SHAPE);
368 aCube.quad_Y0 = aQuads[_indY0];
369 aCube.quad_Y1 = aQuads[_indY1];
370 aCube.quad_Z0 = aQuads[_indZ0];
371 aCube.quad_Z1 = aQuads[_indZ1];
372 aCube.quad_X0 = aQuads[_indX0];
373 aCube.quad_X1 = aQuads[_indX1];
375 // 1.7 - get convertion coefs from face 2D normalized to 3D normalized
377 Conv2DStruct cx0; // for face X=0
378 Conv2DStruct cx1; // for face X=1
384 GetConv2DCoefs(*aCube.quad_X0, meshFaces[_indX0]->GetSubShape(),
385 aCube.V000, aCube.V010, aCube.V011, aCube.V001, cx0);
386 GetConv2DCoefs(*aCube.quad_X1, meshFaces[_indX1]->GetSubShape(),
387 aCube.V100, aCube.V110, aCube.V111, aCube.V101, cx1);
388 GetConv2DCoefs(*aCube.quad_Y0, meshFaces[_indY0]->GetSubShape(),
389 aCube.V000, aCube.V100, aCube.V101, aCube.V001, cy0);
390 GetConv2DCoefs(*aCube.quad_Y1, meshFaces[_indY1]->GetSubShape(),
391 aCube.V010, aCube.V110, aCube.V111, aCube.V011, cy1);
392 GetConv2DCoefs(*aCube.quad_Z0, meshFaces[_indZ0]->GetSubShape(),
393 aCube.V000, aCube.V100, aCube.V110, aCube.V010, cz0);
394 GetConv2DCoefs(*aCube.quad_Z1, meshFaces[_indZ1]->GetSubShape(),
395 aCube.V001, aCube.V101, aCube.V111, aCube.V011, cz1);
397 // 1.8 - create a 3D structure for normalized values
399 int nbx = aCube.quad_Z0->side[0]->NbPoints();
400 if (cz0.a1 == 0.) nbx = aCube.quad_Z0->side[1]->NbPoints();
402 int nby = aCube.quad_X0->side[0]->NbPoints();
403 if (cx0.a1 == 0.) nby = aCube.quad_X0->side[1]->NbPoints();
405 int nbz = aCube.quad_Y0->side[0]->NbPoints();
406 if (cy0.a1 != 0.) nbz = aCube.quad_Y0->side[1]->NbPoints();
408 int i1, j1, nbxyz = nbx * nby * nbz;
409 Point3DStruct *np = new Point3DStruct[nbxyz];
411 // 1.9 - store node indexes of faces
414 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indX0]->GetSubShape());
416 faceQuadStruct *quad = aCube.quad_X0;
417 int i = 0; // j = x/face , k = y/face
418 int nbdown = quad->side[0]->NbPoints();
419 int nbright = quad->side[1]->NbPoints();
421 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
424 const SMDS_MeshNode * node = itf->next();
425 if(aTool.IsMedium(node))
427 if ( !findIJ( node, quad, i1, j1 ))
428 return ClearAndReturn( aQuads, false );
429 int ij1 = j1 * nbdown + i1;
430 quad->uv_grid[ij1].node = node;
433 for (int i1 = 0; i1 < nbdown; i1++)
434 for (int j1 = 0; j1 < nbright; j1++) {
435 int ij1 = j1 * nbdown + i1;
436 int j = cx0.ia * i1 + cx0.ib * j1 + cx0.ic; // j = x/face
437 int k = cx0.ja * i1 + cx0.jb * j1 + cx0.jc; // k = y/face
438 int ijk = k * nbx * nby + j * nbx + i;
439 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
440 np[ijk].node = quad->uv_grid[ij1].node;
441 //SCRUTE(np[ijk].nodeId);
446 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indX1]->GetSubShape());
448 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
450 faceQuadStruct *quad = aCube.quad_X1;
451 int i = nbx - 1; // j = x/face , k = y/face
452 int nbdown = quad->side[0]->NbPoints();
453 int nbright = quad->side[1]->NbPoints();
456 const SMDS_MeshNode * node = itf->next();
457 if(aTool.IsMedium(node))
459 if ( !findIJ( node, quad, i1, j1 ))
460 return ClearAndReturn( aQuads, false );
461 int ij1 = j1 * nbdown + i1;
462 quad->uv_grid[ij1].node = node;
465 for (int i1 = 0; i1 < nbdown; i1++)
466 for (int j1 = 0; j1 < nbright; j1++) {
467 int ij1 = j1 * nbdown + i1;
468 int j = cx1.ia * i1 + cx1.ib * j1 + cx1.ic; // j = x/face
469 int k = cx1.ja * i1 + cx1.jb * j1 + cx1.jc; // k = y/face
470 int ijk = k * nbx * nby + j * nbx + i;
471 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
472 np[ijk].node = quad->uv_grid[ij1].node;
473 //SCRUTE(np[ijk].nodeId);
478 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indY0]->GetSubShape());
480 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
482 faceQuadStruct *quad = aCube.quad_Y0;
483 int j = 0; // i = x/face , k = y/face
484 int nbdown = quad->side[0]->NbPoints();
485 int nbright = quad->side[1]->NbPoints();
488 const SMDS_MeshNode * node = itf->next();
489 if(aTool.IsMedium(node))
491 if ( !findIJ( node, quad, i1, j1 ))
492 return ClearAndReturn( aQuads, false );
493 int ij1 = j1 * nbdown + i1;
494 quad->uv_grid[ij1].node = node;
497 for (int i1 = 0; i1 < nbdown; i1++)
498 for (int j1 = 0; j1 < nbright; j1++) {
499 int ij1 = j1 * nbdown + i1;
500 int i = cy0.ia * i1 + cy0.ib * j1 + cy0.ic; // i = x/face
501 int k = cy0.ja * i1 + cy0.jb * j1 + cy0.jc; // k = y/face
502 int ijk = k * nbx * nby + j * nbx + i;
503 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
504 np[ijk].node = quad->uv_grid[ij1].node;
505 //SCRUTE(np[ijk].nodeId);
510 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indY1]->GetSubShape());
512 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
514 faceQuadStruct *quad = aCube.quad_Y1;
515 int j = nby - 1; // i = x/face , k = y/face
516 int nbdown = quad->side[0]->NbPoints();
517 int nbright = quad->side[1]->NbPoints();
520 const SMDS_MeshNode * node = itf->next();
521 if(aTool.IsMedium(node))
523 if ( !findIJ( node, quad, i1, j1 ))
524 return ClearAndReturn( aQuads, false );
525 int ij1 = j1 * nbdown + i1;
526 quad->uv_grid[ij1].node = node;
529 for (int i1 = 0; i1 < nbdown; i1++)
530 for (int j1 = 0; j1 < nbright; j1++) {
531 int ij1 = j1 * nbdown + i1;
532 int i = cy1.ia * i1 + cy1.ib * j1 + cy1.ic; // i = x/face
533 int k = cy1.ja * i1 + cy1.jb * j1 + cy1.jc; // k = y/face
534 int ijk = k * nbx * nby + j * nbx + i;
535 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
536 np[ijk].node = quad->uv_grid[ij1].node;
537 //SCRUTE(np[ijk].nodeId);
542 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indZ0]->GetSubShape());
544 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
546 faceQuadStruct *quad = aCube.quad_Z0;
547 int k = 0; // i = x/face , j = y/face
548 int nbdown = quad->side[0]->NbPoints();
549 int nbright = quad->side[1]->NbPoints();
552 const SMDS_MeshNode * node = itf->next();
553 if(aTool.IsMedium(node))
555 if ( !findIJ( node, quad, i1, j1 ))
556 return ClearAndReturn( aQuads, false );
557 int ij1 = j1 * nbdown + i1;
558 quad->uv_grid[ij1].node = node;
561 for (int i1 = 0; i1 < nbdown; i1++)
562 for (int j1 = 0; j1 < nbright; j1++) {
563 int ij1 = j1 * nbdown + i1;
564 int i = cz0.ia * i1 + cz0.ib * j1 + cz0.ic; // i = x/face
565 int j = cz0.ja * i1 + cz0.jb * j1 + cz0.jc; // j = y/face
566 int ijk = k * nbx * nby + j * nbx + i;
567 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
568 np[ijk].node = quad->uv_grid[ij1].node;
569 //SCRUTE(np[ijk].nodeId);
574 const TopoDS_Face & F = TopoDS::Face(meshFaces[_indZ1]->GetSubShape());
576 SMDS_NodeIteratorPtr itf= aMesh.GetSubMesh(F)->GetSubMeshDS()->GetNodes();
578 faceQuadStruct *quad = aCube.quad_Z1;
579 int k = nbz - 1; // i = x/face , j = y/face
580 int nbdown = quad->side[0]->NbPoints();
581 int nbright = quad->side[1]->NbPoints();
584 const SMDS_MeshNode * node = itf->next();
585 if(aTool.IsMedium(node))
587 if ( !findIJ( node, quad, i1, j1 ))
588 return ClearAndReturn( aQuads, false );
589 int ij1 = j1 * nbdown + i1;
590 quad->uv_grid[ij1].node = node;
593 for (int i1 = 0; i1 < nbdown; i1++)
594 for (int j1 = 0; j1 < nbright; j1++) {
595 int ij1 = j1 * nbdown + i1;
596 int i = cz1.ia * i1 + cz1.ib * j1 + cz1.ic; // i = x/face
597 int j = cz1.ja * i1 + cz1.jb * j1 + cz1.jc; // j = y/face
598 int ijk = k * nbx * nby + j * nbx + i;
599 //MESSAGE(" "<<ij1<<" "<<i<<" "<<j<<" "<<ijk);
600 np[ijk].node = quad->uv_grid[ij1].node;
601 //SCRUTE(np[ijk].nodeId);
605 // 2.0 - for each node of the cube:
606 // - get the 8 points 3D = 8 vertices of the cube
607 // - get the 12 points 3D on the 12 edges of the cube
608 // - get the 6 points 3D on the 6 faces with their ID
609 // - compute the point 3D
610 // - store the point 3D in SMESHDS, store its ID in 3D structure
612 int shapeID = meshDS->ShapeToIndex( aShape );
614 Pt3 p000, p001, p010, p011, p100, p101, p110, p111;
615 Pt3 px00, px01, px10, px11;
616 Pt3 p0y0, p0y1, p1y0, p1y1;
617 Pt3 p00z, p01z, p10z, p11z;
618 Pt3 pxy0, pxy1, px0z, px1z, p0yz, p1yz;
620 GetPoint(p000, 0, 0, 0, nbx, nby, nbz, np, meshDS);
621 GetPoint(p001, 0, 0, nbz - 1, nbx, nby, nbz, np, meshDS);
622 GetPoint(p010, 0, nby - 1, 0, nbx, nby, nbz, np, meshDS);
623 GetPoint(p011, 0, nby - 1, nbz - 1, nbx, nby, nbz, np, meshDS);
624 GetPoint(p100, nbx - 1, 0, 0, nbx, nby, nbz, np, meshDS);
625 GetPoint(p101, nbx - 1, 0, nbz - 1, nbx, nby, nbz, np, meshDS);
626 GetPoint(p110, nbx - 1, nby - 1, 0, nbx, nby, nbz, np, meshDS);
627 GetPoint(p111, nbx - 1, nby - 1, nbz - 1, nbx, nby, nbz, np, meshDS);
629 for (int i = 1; i < nbx - 1; i++) {
630 for (int j = 1; j < nby - 1; j++) {
631 for (int k = 1; k < nbz - 1; k++) {
632 // *** seulement maillage regulier
633 // 12 points on edges
634 GetPoint(px00, i, 0, 0, nbx, nby, nbz, np, meshDS);
635 GetPoint(px01, i, 0, nbz - 1, nbx, nby, nbz, np, meshDS);
636 GetPoint(px10, i, nby - 1, 0, nbx, nby, nbz, np, meshDS);
637 GetPoint(px11, i, nby - 1, nbz - 1, nbx, nby, nbz, np, meshDS);
639 GetPoint(p0y0, 0, j, 0, nbx, nby, nbz, np, meshDS);
640 GetPoint(p0y1, 0, j, nbz - 1, nbx, nby, nbz, np, meshDS);
641 GetPoint(p1y0, nbx - 1, j, 0, nbx, nby, nbz, np, meshDS);
642 GetPoint(p1y1, nbx - 1, j, nbz - 1, nbx, nby, nbz, np, meshDS);
644 GetPoint(p00z, 0, 0, k, nbx, nby, nbz, np, meshDS);
645 GetPoint(p01z, 0, nby - 1, k, nbx, nby, nbz, np, meshDS);
646 GetPoint(p10z, nbx - 1, 0, k, nbx, nby, nbz, np, meshDS);
647 GetPoint(p11z, nbx - 1, nby - 1, k, nbx, nby, nbz, np, meshDS);
649 // 12 points on faces
650 GetPoint(pxy0, i, j, 0, nbx, nby, nbz, np, meshDS);
651 GetPoint(pxy1, i, j, nbz - 1, nbx, nby, nbz, np, meshDS);
652 GetPoint(px0z, i, 0, k, nbx, nby, nbz, np, meshDS);
653 GetPoint(px1z, i, nby - 1, k, nbx, nby, nbz, np, meshDS);
654 GetPoint(p0yz, 0, j, k, nbx, nby, nbz, np, meshDS);
655 GetPoint(p1yz, nbx - 1, j, k, nbx, nby, nbz, np, meshDS);
657 int ijk = k * nbx * nby + j * nbx + i;
658 double x = double (i) / double (nbx - 1); // *** seulement
659 double y = double (j) / double (nby - 1); // *** maillage
660 double z = double (k) / double (nbz - 1); // *** regulier
663 for (int i = 0; i < 3; i++) {
664 X[i] = (1 - x) * p0yz[i] + x * p1yz[i]
665 + (1 - y) * px0z[i] + y * px1z[i]
666 + (1 - z) * pxy0[i] + z * pxy1[i]
667 - (1 - x) * ((1 - y) * p00z[i] + y * p01z[i])
668 - x * ((1 - y) * p10z[i] + y * p11z[i])
669 - (1 - y) * ((1 - z) * px00[i] + z * px01[i])
670 - y * ((1 - z) * px10[i] + z * px11[i])
671 - (1 - z) * ((1 - x) * p0y0[i] + x * p1y0[i])
672 - z * ((1 - x) * p0y1[i] + x * p1y1[i])
673 + (1 - x) * ((1 - y) * ((1 - z) * p000[i] + z * p001[i])
674 + y * ((1 - z) * p010[i] + z * p011[i]))
675 + x * ((1 - y) * ((1 - z) * p100[i] + z * p101[i])
676 + y * ((1 - z) * p110[i] + z * p111[i]));
679 SMDS_MeshNode * node = meshDS->AddNode(X[0], X[1], X[2]);
681 meshDS->SetNodeInVolume(node, shapeID);
686 // find orientation of furute volumes according to MED convention
687 vector< bool > forward( nbx * nby );
688 SMDS_VolumeTool vTool;
689 for (int i = 0; i < nbx - 1; i++) {
690 for (int j = 0; j < nby - 1; j++) {
691 int n1 = j * nbx + i;
692 int n2 = j * nbx + i + 1;
693 int n3 = (j + 1) * nbx + i + 1;
694 int n4 = (j + 1) * nbx + i;
695 int n5 = nbx * nby + j * nbx + i;
696 int n6 = nbx * nby + j * nbx + i + 1;
697 int n7 = nbx * nby + (j + 1) * nbx + i + 1;
698 int n8 = nbx * nby + (j + 1) * nbx + i;
700 SMDS_VolumeOfNodes tmpVol (np[n1].node,np[n2].node,np[n3].node,np[n4].node,
701 np[n5].node,np[n6].node,np[n7].node,np[n8].node);
702 vTool.Set( &tmpVol );
703 forward[ n1 ] = vTool.IsForward();
707 //2.1 - for each node of the cube (less 3 *1 Faces):
708 // - store hexahedron in SMESHDS
709 MESSAGE("Storing hexahedron into the DS");
710 for (int i = 0; i < nbx - 1; i++) {
711 for (int j = 0; j < nby - 1; j++) {
712 bool isForw = forward.at( j * nbx + i );
713 for (int k = 0; k < nbz - 1; k++) {
714 int n1 = k * nbx * nby + j * nbx + i;
715 int n2 = k * nbx * nby + j * nbx + i + 1;
716 int n3 = k * nbx * nby + (j + 1) * nbx + i + 1;
717 int n4 = k * nbx * nby + (j + 1) * nbx + i;
718 int n5 = (k + 1) * nbx * nby + j * nbx + i;
719 int n6 = (k + 1) * nbx * nby + j * nbx + i + 1;
720 int n7 = (k + 1) * nbx * nby + (j + 1) * nbx + i + 1;
721 int n8 = (k + 1) * nbx * nby + (j + 1) * nbx + i;
723 SMDS_MeshVolume * elt;
725 elt = aTool.AddVolume(np[n1].node, np[n2].node,
726 np[n3].node, np[n4].node,
727 np[n5].node, np[n6].node,
728 np[n7].node, np[n8].node);
731 elt = aTool.AddVolume(np[n1].node, np[n4].node,
732 np[n3].node, np[n2].node,
733 np[n5].node, np[n8].node,
734 np[n7].node, np[n6].node);
737 meshDS->SetMeshElementOnShape(elt, shapeID);
741 if ( np ) delete [] np;
742 return ClearAndReturn( aQuads, true );
746 //=============================================================================
750 //=============================================================================
752 bool StdMeshers_Hexa_3D::Evaluate(SMESH_Mesh & aMesh,
753 const TopoDS_Shape & aShape,
754 MapShapeNbElems& aResMap)
756 vector < SMESH_subMesh * >meshFaces;
757 TopTools_SequenceOfShape aFaces;
758 for (TopExp_Explorer exp(aShape, TopAbs_FACE); exp.More(); exp.Next()) {
759 aFaces.Append(exp.Current());
760 SMESH_subMesh *aSubMesh = aMesh.GetSubMeshContaining(exp.Current());
762 meshFaces.push_back(aSubMesh);
764 if (meshFaces.size() != 6) {
765 //return error(COMPERR_BAD_SHAPE, TComm(meshFaces.size())<<" instead of 6 faces in a block");
766 static StdMeshers_CompositeHexa_3D compositeHexa(-10, 0, aMesh.GetGen());
767 return compositeHexa.Evaluate(aMesh, aShape, aResMap);
772 //TopoDS_Shape aFace = meshFaces[i]->GetSubShape();
773 TopoDS_Shape aFace = aFaces.Value(i+1);
774 SMESH_Algo *algo = _gen->GetAlgo(aMesh, aFace);
776 std::vector<int> aResVec(SMDSEntity_Last);
777 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
778 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
779 aResMap.insert(std::make_pair(sm,aResVec));
780 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
781 smError.reset( new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
784 string algoName = algo->GetName();
785 bool isAllQuad = false;
786 if (algoName == "Quadrangle_2D") {
787 MapShapeNbElemsItr anIt = aResMap.find(meshFaces[i]);
788 if( anIt == aResMap.end() ) continue;
789 std::vector<int> aVec = (*anIt).second;
790 int nbtri = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
795 return EvaluatePentahedralMesh(aMesh, aShape, aResMap);
799 // find number of 1d elems for 1 face
801 TopTools_MapOfShape Edges1;
802 bool IsQuadratic = false;
804 for (TopExp_Explorer exp(aFaces.Value(1), TopAbs_EDGE); exp.More(); exp.Next()) {
805 Edges1.Add(exp.Current());
806 SMESH_subMesh *sm = aMesh.GetSubMesh(exp.Current());
808 MapShapeNbElemsItr anIt = aResMap.find(sm);
809 if( anIt == aResMap.end() ) continue;
810 std::vector<int> aVec = (*anIt).second;
811 nb1d += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
813 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
818 // find face opposite to 1 face
820 for(i=2; i<=6; i++) {
821 bool IsOpposite = true;
822 for(TopExp_Explorer exp(aFaces.Value(i), TopAbs_EDGE); exp.More(); exp.Next()) {
823 if( Edges1.Contains(exp.Current()) ) {
833 // find number of 2d elems on side faces
835 for(i=2; i<=6; i++) {
836 if( i == OppNum ) continue;
837 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[i-1] );
838 if( anIt == aResMap.end() ) continue;
839 std::vector<int> aVec = (*anIt).second;
840 nb2d += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
843 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[0] );
844 std::vector<int> aVec = (*anIt).second;
845 int nb2d_face0 = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
846 int nb0d_face0 = aVec[SMDSEntity_Node];
848 std::vector<int> aResVec(SMDSEntity_Last);
849 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
851 aResVec[SMDSEntity_Quad_Hexa] = nb2d_face0 * ( nb2d/nb1d );
852 int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
853 aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
856 aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
857 aResVec[SMDSEntity_Hexa] = nb2d_face0 * ( nb2d/nb1d );
859 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
860 aResMap.insert(std::make_pair(sm,aResVec));
866 //=============================================================================
870 //=============================================================================
872 void StdMeshers_Hexa_3D::GetPoint(Pt3 p, int i, int j, int k, int nbx, int nby, int nbz,
873 Point3DStruct * np, const SMESHDS_Mesh * meshDS)
875 int ijk = k * nbx * nby + j * nbx + i;
876 const SMDS_MeshNode * node = np[ijk].node;
880 //MESSAGE(" "<<i<<" "<<j<<" "<<k<<" "<<p[0]<<" "<<p[1]<<" "<<p[2]);
883 //=============================================================================
887 //=============================================================================
889 int StdMeshers_Hexa_3D::GetFaceIndex(SMESH_Mesh & aMesh,
890 const TopoDS_Shape & aShape,
891 const vector < SMESH_subMesh * >&meshFaces,
892 const TopoDS_Vertex & V0,
893 const TopoDS_Vertex & V1,
894 const TopoDS_Vertex & V2, const TopoDS_Vertex & V3)
896 //MESSAGE("StdMeshers_Hexa_3D::GetFaceIndex");
898 for (int i = 1; i < 6; i++)
900 const TopoDS_Shape & aFace = meshFaces[i]->GetSubShape();
901 //const TopoDS_Face& F = TopoDS::Face(aFace);
902 TopTools_IndexedMapOfShape M;
903 TopExp::MapShapes(aFace, TopAbs_VERTEX, M);
904 bool verticesInShape = false;
909 verticesInShape = true;
916 //IPAL21120 ASSERT(faceIndex > 0);
921 //=============================================================================
925 //=============================================================================
928 StdMeshers_Hexa_3D::EdgeNotInFace(SMESH_Mesh & aMesh,
929 const TopoDS_Shape & aShape,
930 const TopoDS_Face & aFace,
931 const TopoDS_Vertex & aVertex,
932 const TopTools_IndexedDataMapOfShapeListOfShape & MS)
934 //MESSAGE("StdMeshers_Hexa_3D::EdgeNotInFace");
935 TopTools_IndexedDataMapOfShapeListOfShape MF;
936 TopExp::MapShapesAndAncestors(aFace, TopAbs_VERTEX, TopAbs_EDGE, MF);
937 const TopTools_ListOfShape & ancestorsInSolid = MS.FindFromKey(aVertex);
938 const TopTools_ListOfShape & ancestorsInFace = MF.FindFromKey(aVertex);
939 // SCRUTE(ancestorsInSolid.Extent());
940 // SCRUTE(ancestorsInFace.Extent());
941 ASSERT(ancestorsInSolid.Extent() == 6); // 6 (edges doublees)
942 ASSERT(ancestorsInFace.Extent() == 2);
946 TopTools_ListIteratorOfListOfShape its(ancestorsInSolid);
947 for (; its.More(); its.Next())
949 TopoDS_Shape ancestor = its.Value();
950 TopTools_ListIteratorOfListOfShape itf(ancestorsInFace);
951 bool isInFace = false;
952 for (; itf.More(); itf.Next())
954 TopoDS_Shape ancestorInFace = itf.Value();
955 if (ancestorInFace.IsSame(ancestor))
963 E = TopoDS::Edge(ancestor);
970 //=============================================================================
974 //=============================================================================
976 void StdMeshers_Hexa_3D::GetConv2DCoefs(const faceQuadStruct & quad,
977 const TopoDS_Shape & aShape,
978 const TopoDS_Vertex & V0,
979 const TopoDS_Vertex & V1,
980 const TopoDS_Vertex & V2, const TopoDS_Vertex & V3, Conv2DStruct & conv)
982 // MESSAGE("StdMeshers_Hexa_3D::GetConv2DCoefs");
983 // const TopoDS_Face & F = TopoDS::Face(aShape);
984 // TopoDS_Edge E = quad.edge[0];
986 // Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
987 // TopoDS_Vertex VFirst, VLast;
988 // TopExp::Vertices(E, VFirst, VLast); // corresponds to f and l
989 // bool isForward = (((l - f) * (quad.last[0] - quad.first[0])) > 0);
990 TopoDS_Vertex VA, VB;
1001 VA = quad.side[0]->FirstVertex();
1002 VB = quad.side[0]->LastVertex();
1004 int a1, b1, c1, a2, b2, c2;
1017 ASSERT(VB.IsSame(V3));
1037 ASSERT(VB.IsSame(V0));
1057 ASSERT(VB.IsSame(V1));
1077 ASSERT(VB.IsSame(V2));
1085 // MESSAGE("X = " << c1 << "+ " << a1 << "*x + " << b1 << "*y");
1086 // MESSAGE("Y = " << c2 << "+ " << a2 << "*x + " << b2 << "*y");
1094 int nbdown = quad.side[0]->NbPoints();
1095 int nbright = quad.side[1]->NbPoints();
1099 int (c1 * a1 * a1) * (nbdown - 1) + int (c1 * b1 * b1) * (nbright - 1);
1103 int (c2 * a2 * a2) * (nbdown - 1) + int (c2 * b2 * b2) * (nbright - 1);
1104 // MESSAGE("I " << conv.ia << " " << conv.ib << " " << conv.ic);
1105 // MESSAGE("J " << conv.ja << " " << conv.jb << " " << conv.jc);
1108 //================================================================================
1110 * \brief Find a vertex opposite to the given vertex of aQuads[0]
1111 * \param aVertex - the vertex
1112 * \param aFace - the face aVertex belongs to
1113 * \param aQuads - quads
1114 * \retval TopoDS_Vertex - found vertex
1116 //================================================================================
1118 TopoDS_Vertex StdMeshers_Hexa_3D::OppositeVertex(const TopoDS_Vertex& aVertex,
1119 const TopTools_IndexedMapOfShape& aQuads0Vertices,
1120 FaceQuadStruct* aQuads[6])
1123 for ( i = 1; i < 6; ++i )
1125 TopoDS_Vertex VV[] = { aQuads[i]->side[0]->FirstVertex(),
1126 aQuads[i]->side[0]->LastVertex() ,
1127 aQuads[i]->side[2]->LastVertex() ,
1128 aQuads[i]->side[2]->FirstVertex() };
1129 for ( j = 0; j < 4; ++j )
1130 if ( aVertex.IsSame( VV[ j ]))
1133 int jPrev = j ? j - 1 : 3;
1134 int jNext = (j + 1) % 4;
1135 if ( aQuads0Vertices.Contains( VV[ jPrev ] ))
1141 return TopoDS_Vertex();
1144 //modified by NIZNHY-PKV Wed Nov 17 15:34:13 2004 f
1145 ///////////////////////////////////////////////////////////////////////////////
1147 //#include <stdio.h>
1149 //=======================================================================
1150 //function : ComputePentahedralMesh
1152 //=======================================================================
1154 SMESH_ComputeErrorPtr ComputePentahedralMesh(SMESH_Mesh & aMesh,
1155 const TopoDS_Shape & aShape)
1157 //printf(" ComputePentahedralMesh HERE\n");
1160 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New();
1162 StdMeshers_Penta_3D anAlgo;
1164 bOK=anAlgo.Compute(aMesh, aShape);
1166 err = anAlgo.GetComputeError();
1168 if ( !bOK && anAlgo.ErrorStatus() == 5 )
1170 static StdMeshers_Prism_3D * aPrism3D = 0;
1172 SMESH_Gen* gen = aMesh.GetGen();
1173 aPrism3D = new StdMeshers_Prism_3D( gen->GetANewId(), 0, gen );
1175 SMESH_Hypothesis::Hypothesis_Status aStatus;
1176 if ( aPrism3D->CheckHypothesis( aMesh, aShape, aStatus ) ) {
1177 aPrism3D->InitComputeError();
1178 bOK = aPrism3D->Compute( aMesh, aShape );
1179 err = aPrism3D->GetComputeError();
1186 //=======================================================================
1187 //function : EvaluatePentahedralMesh
1189 //=======================================================================
1191 bool EvaluatePentahedralMesh(SMESH_Mesh & aMesh,
1192 const TopoDS_Shape & aShape,
1193 MapShapeNbElems& aResMap)
1195 StdMeshers_Penta_3D anAlgo;
1196 bool bOK = anAlgo.Evaluate(aMesh, aShape, aResMap);
1198 //err = anAlgo.GetComputeError();
1199 //if ( !bOK && anAlgo.ErrorStatus() == 5 )
1201 static StdMeshers_Prism_3D * aPrism3D = 0;
1203 SMESH_Gen* gen = aMesh.GetGen();
1204 aPrism3D = new StdMeshers_Prism_3D( gen->GetANewId(), 0, gen );
1206 SMESH_Hypothesis::Hypothesis_Status aStatus;
1207 if ( aPrism3D->CheckHypothesis( aMesh, aShape, aStatus ) ) {
1208 return aPrism3D->Evaluate(aMesh, aShape, aResMap);