1 // Copyright (C) 2004-2010 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
20 //=============================================================================
21 // File : GHS3DPlugin_GHS3D.cxx
23 // Author : Edward AGAPOV, modified by Lioka RAZAFINDRAZAKA (CEA) 09/02/2007
25 //=============================================================================
27 #include "GHS3DPlugin_GHS3D.hxx"
28 #include "GHS3DPlugin_Hypothesis.hxx"
30 #include <Basics_Utils.hxx>
32 //#include "SMESH_Gen.hxx"
33 #include <SMESH_Client.hxx>
34 #include "SMESH_Mesh.hxx"
35 #include "SMESH_Comment.hxx"
36 #include "SMESH_MesherHelper.hxx"
37 #include "SMESH_MeshEditor.hxx"
38 #include "SMESH_OctreeNode.hxx"
40 #include "SMDS_MeshElement.hxx"
41 #include "SMDS_MeshNode.hxx"
42 #include "SMDS_FaceOfNodes.hxx"
43 #include "SMDS_VolumeOfNodes.hxx"
45 #include <StdMeshers_QuadToTriaAdaptor.hxx>
46 #include <StdMeshers_ViscousLayers.hxx>
48 #include <BRepAdaptor_Surface.hxx>
49 #include <BRepBndLib.hxx>
50 #include <BRepBuilderAPI_MakeVertex.hxx>
51 #include <BRepClass3d_SolidClassifier.hxx>
52 #include <BRepExtrema_DistShapeShape.hxx>
53 #include <BRepTools.hxx>
54 #include <BRep_Tool.hxx>
55 #include <Bnd_Box.hxx>
56 #include <GeomAPI_ProjectPointOnSurf.hxx>
57 #include <OSD_File.hxx>
58 #include <Precision.hxx>
59 #include <Quantity_Parameter.hxx>
60 #include <Standard_ProgramError.hxx>
61 #include <Standard_ErrorHandler.hxx>
62 #include <Standard_Failure.hxx>
64 #include <TopExp_Explorer.hxx>
65 #include <TopTools_IndexedMapOfShape.hxx>
66 #include <TopTools_ListIteratorOfListOfShape.hxx>
68 //#include <BRepClass_FaceClassifier.hxx>
69 #include <TopTools_MapOfShape.hxx>
70 #include <BRepGProp.hxx>
71 #include <GProp_GProps.hxx>
73 #include "utilities.h"
78 #include <sys/sysinfo.h>
84 //#include <Standard_Stream.hxx>
87 #define castToNode(n) static_cast<const SMDS_MeshNode *>( n );
100 #include <sys/mman.h>
102 #include <sys/stat.h>
108 #ifndef GHS3D_VERSION
109 #define GHS3D_VERSION 41
112 typedef const list<const SMDS_MeshFace*> TTriaList;
114 static void removeFile( const TCollection_AsciiString& fileName )
117 OSD_File( fileName ).Remove();
119 catch ( Standard_ProgramError ) {
120 MESSAGE("Can't remove file: " << fileName.ToCString() << " ; file does not exist or permission denied");
124 //=============================================================================
128 //=============================================================================
130 GHS3DPlugin_GHS3D::GHS3DPlugin_GHS3D(int hypId, int studyId, SMESH_Gen* gen)
131 : SMESH_3D_Algo(hypId, studyId, gen)
133 MESSAGE("GHS3DPlugin_GHS3D::GHS3DPlugin_GHS3D");
135 _shapeType = (1 << TopAbs_SHELL) | (1 << TopAbs_SOLID);// 1 bit /shape type
136 _onlyUnaryInput = false; // Compute() will be called on a compound of solids
139 _compatibleHypothesis.push_back("GHS3D_Parameters");
140 _compatibleHypothesis.push_back( StdMeshers_ViscousLayers::GetHypType() );
141 _requireShape = false; // can work without shape
142 #ifdef WITH_SMESH_CANCEL_COMPUTE
143 _compute_canceled = false;
147 //=============================================================================
151 //=============================================================================
153 GHS3DPlugin_GHS3D::~GHS3DPlugin_GHS3D()
155 MESSAGE("GHS3DPlugin_GHS3D::~GHS3DPlugin_GHS3D");
158 //=============================================================================
162 //=============================================================================
164 bool GHS3DPlugin_GHS3D::CheckHypothesis ( SMESH_Mesh& aMesh,
165 const TopoDS_Shape& aShape,
166 Hypothesis_Status& aStatus )
168 aStatus = SMESH_Hypothesis::HYP_OK;
171 _viscousLayersHyp = 0;
174 const list <const SMESHDS_Hypothesis * >& hyps =
175 GetUsedHypothesis(aMesh, aShape, /*ignoreAuxiliary=*/false);
176 list <const SMESHDS_Hypothesis* >::const_iterator h = hyps.begin();
177 for ( ; h != hyps.end(); ++h )
180 _hyp = dynamic_cast< const GHS3DPlugin_Hypothesis*> ( *h );
181 if ( !_viscousLayersHyp )
182 _viscousLayersHyp = dynamic_cast< const StdMeshers_ViscousLayers*> ( *h );
185 _keepFiles = _hyp->GetKeepFiles();
191 //=======================================================================
192 //function : findShape
194 //=======================================================================
196 static TopoDS_Shape findShape(const SMDS_MeshNode *aNode[],
198 const TopoDS_Shape shape[],
201 TopAbs_State * state = 0)
204 int j, iShape, nbNode = 4;
206 for ( j=0; j<nbNode; j++ ) {
207 gp_XYZ p ( aNode[j]->X(), aNode[j]->Y(), aNode[j]->Z() );
208 if ( aNode[j]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE ) {
215 BRepClass3d_SolidClassifier SC (aShape, aPnt, Precision::Confusion());
216 if (state) *state = SC.State();
217 if ( SC.State() != TopAbs_IN || aShape.IsNull() || aShape.ShapeType() != TopAbs_SOLID) {
218 for (iShape = 0; iShape < nShape; iShape++) {
219 aShape = shape[iShape];
220 if ( !( aPnt.X() < box[iShape][0] || box[iShape][1] < aPnt.X() ||
221 aPnt.Y() < box[iShape][2] || box[iShape][3] < aPnt.Y() ||
222 aPnt.Z() < box[iShape][4] || box[iShape][5] < aPnt.Z()) ) {
223 BRepClass3d_SolidClassifier SC (aShape, aPnt, Precision::Confusion());
224 if (state) *state = SC.State();
225 if (SC.State() == TopAbs_IN)
233 //=======================================================================
234 //function : readMapIntLine
236 //=======================================================================
238 static char* readMapIntLine(char* ptr, int tab[]) {
240 std::cout << std::endl;
242 for ( int i=0; i<17; i++ ) {
243 intVal = strtol(ptr, &ptr, 10);
250 //================================================================================
252 * \brief returns true if a triangle defined by the nodes is a temporary face on a
253 * side facet of pyramid and defines sub-domian inside the pyramid
255 //================================================================================
257 static bool isTmpFace(const SMDS_MeshNode* node1,
258 const SMDS_MeshNode* node2,
259 const SMDS_MeshNode* node3)
261 // find a pyramid sharing the 3 nodes
262 //const SMDS_MeshElement* pyram = 0;
263 SMDS_ElemIteratorPtr vIt1 = node1->GetInverseElementIterator(SMDSAbs_Volume);
264 while ( vIt1->more() )
266 const SMDS_MeshElement* pyram = vIt1->next();
267 if ( pyram->NbCornerNodes() != 5 ) continue;
269 if ( (i2 = pyram->GetNodeIndex( node2 )) >= 0 &&
270 (i3 = pyram->GetNodeIndex( node3 )) >= 0 )
272 // Triangle defines sub-domian inside the pyramid if it's
273 // normal points out of the pyram
275 // make i2 and i3 hold indices of base nodes of the pyram while
276 // keeping the nodes order in the triangle
279 i2 = i3, i3 = pyram->GetNodeIndex( node1 );
280 else if ( i3 == iApex )
281 i3 = i2, i2 = pyram->GetNodeIndex( node1 );
283 int i3base = (i2+1) % 4; // next index after i2 within the pyramid base
284 return ( i3base != i3 );
290 //=======================================================================
291 //function : findShapeID
292 //purpose : find the solid corresponding to GHS3D sub-domain following
293 // the technique proposed in GHS3D manual (available within
294 // ghs3d installation) in chapter "B.4 Subdomain (sub-region) assignment".
295 // In brief: normal of the triangle defined by the given nodes
296 // points out of the domain it is associated to
297 //=======================================================================
299 static int findShapeID(SMESH_Mesh& mesh,
300 const SMDS_MeshNode* node1,
301 const SMDS_MeshNode* node2,
302 const SMDS_MeshNode* node3,
303 const bool toMeshHoles)
305 const int invalidID = 0;
306 SMESHDS_Mesh* meshDS = mesh.GetMeshDS();
308 // face the nodes belong to
309 const SMDS_MeshElement * face = meshDS->FindFace(node1,node2,node3);
311 return isTmpFace(node1, node2, node3) ? HOLE_ID : invalidID;
313 std::cout << "bnd face " << face->GetID() << " - ";
315 // geom face the face assigned to
316 SMESH_MeshEditor editor(&mesh);
317 int geomFaceID = editor.FindShape( face );
319 return isTmpFace(node1, node2, node3) ? HOLE_ID : invalidID;
320 TopoDS_Shape shape = meshDS->IndexToShape( geomFaceID );
321 if ( shape.IsNull() || shape.ShapeType() != TopAbs_FACE )
323 TopoDS_Face geomFace = TopoDS::Face( shape );
325 // solids bounded by geom face
326 TopTools_IndexedMapOfShape solids, shells;
327 TopTools_ListIteratorOfListOfShape ansIt = mesh.GetAncestors(geomFace);
328 for ( ; ansIt.More(); ansIt.Next() ) {
329 switch ( ansIt.Value().ShapeType() ) {
331 solids.Add( ansIt.Value() ); break;
333 shells.Add( ansIt.Value() ); break;
337 // analyse found solids
338 if ( solids.Extent() == 0 || shells.Extent() == 0)
341 const TopoDS_Solid& solid1 = TopoDS::Solid( solids(1) );
342 if ( solids.Extent() == 1 )
345 return meshDS->ShapeToIndex( solid1 );
347 // - Are we at a hole boundary face?
348 if ( shells(1).IsSame( BRepTools::OuterShell( solid1 )) )
349 { // - No, but maybe a hole is bound by two shapes? Does shells(1) touches another shell?
351 TopExp_Explorer eExp( shells(1), TopAbs_EDGE );
352 // check if any edge of shells(1) belongs to another shell
353 for ( ; eExp.More() && !touch; eExp.Next() ) {
354 ansIt = mesh.GetAncestors( eExp.Current() );
355 for ( ; ansIt.More() && !touch; ansIt.Next() ) {
356 if ( ansIt.Value().ShapeType() == TopAbs_SHELL )
357 touch = ( !ansIt.Value().IsSame( shells(1) ));
361 return meshDS->ShapeToIndex( solid1 );
364 // find orientation of geom face within the first solid
365 TopExp_Explorer fExp( solid1, TopAbs_FACE );
366 for ( ; fExp.More(); fExp.Next() )
367 if ( geomFace.IsSame( fExp.Current() )) {
368 geomFace = TopoDS::Face( fExp.Current() );
372 return invalidID; // face not found
374 // normale to triangle
375 gp_Pnt node1Pnt ( node1->X(), node1->Y(), node1->Z() );
376 gp_Pnt node2Pnt ( node2->X(), node2->Y(), node2->Z() );
377 gp_Pnt node3Pnt ( node3->X(), node3->Y(), node3->Z() );
378 gp_Vec vec12( node1Pnt, node2Pnt );
379 gp_Vec vec13( node1Pnt, node3Pnt );
380 gp_Vec meshNormal = vec12 ^ vec13;
381 if ( meshNormal.SquareMagnitude() < DBL_MIN )
384 // get normale to geomFace at any node
385 bool geomNormalOK = false;
387 const SMDS_MeshNode* nodes[3] = { node1, node2, node3 };
388 SMESH_MesherHelper helper( mesh ); helper.SetSubShape( geomFace );
389 for ( int i = 0; !geomNormalOK && i < 3; ++i )
391 // find UV of i-th node on geomFace
392 const SMDS_MeshNode* nNotOnSeamEdge = 0;
393 if ( helper.IsSeamShape( nodes[i]->getshapeId() )) {
394 if ( helper.IsSeamShape( nodes[(i+1)%3]->getshapeId() ))
395 nNotOnSeamEdge = nodes[(i+2)%3];
397 nNotOnSeamEdge = nodes[(i+1)%3];
400 gp_XY uv = helper.GetNodeUV( geomFace, nodes[i], nNotOnSeamEdge, &uvOK );
401 // check that uv is correct
404 TopoDS_Shape nodeShape = helper.GetSubShapeByNode( nodes[i], meshDS );
405 if ( !nodeShape.IsNull() )
406 switch ( nodeShape.ShapeType() )
408 case TopAbs_FACE: tol = BRep_Tool::Tolerance( TopoDS::Face( nodeShape )); break;
409 case TopAbs_EDGE: tol = BRep_Tool::Tolerance( TopoDS::Edge( nodeShape )); break;
410 case TopAbs_VERTEX: tol = BRep_Tool::Tolerance( TopoDS::Vertex( nodeShape )); break;
413 gp_Pnt nodePnt ( nodes[i]->X(), nodes[i]->Y(), nodes[i]->Z() );
414 BRepAdaptor_Surface surface( geomFace );
415 uvOK = ( nodePnt.Distance( surface.Value( uv.X(), uv.Y() )) < 2 * tol );
417 // normale to geomFace at UV
419 surface.D1( uv.X(), uv.Y(), nodePnt, du, dv );
420 geomNormal = du ^ dv;
421 if ( geomFace.Orientation() == TopAbs_REVERSED )
422 geomNormal.Reverse();
423 geomNormalOK = ( geomNormal.SquareMagnitude() > DBL_MIN * 1e3 );
431 bool isReverse = ( meshNormal * geomNormal ) < 0;
433 return meshDS->ShapeToIndex( solid1 );
435 if ( solids.Extent() == 1 )
436 return HOLE_ID; // we are inside a hole
438 return meshDS->ShapeToIndex( solids(2) );
441 //=======================================================================
442 //function : countShape
444 //=======================================================================
446 // template < class Mesh, class Shape >
447 // static int countShape( Mesh* mesh, Shape shape ) {
448 // TopExp_Explorer expShape ( mesh->ShapeToMesh(), shape );
449 // TopTools_MapOfShape mapShape;
451 // for ( ; expShape.More(); expShape.Next() ) {
452 // if (mapShape.Add(expShape.Current())) {
459 //=======================================================================
460 //function : getShape
462 //=======================================================================
464 // template < class Mesh, class Shape, class Tab >
465 // void getShape(Mesh* mesh, Shape shape, Tab *t_Shape) {
466 // TopExp_Explorer expShape ( mesh->ShapeToMesh(), shape );
467 // TopTools_MapOfShape mapShape;
468 // for ( int i=0; expShape.More(); expShape.Next() ) {
469 // if (mapShape.Add(expShape.Current())) {
470 // t_Shape[i] = expShape.Current();
477 // //=======================================================================
478 // //function : findEdgeID
480 // //=======================================================================
482 // static int findEdgeID(const SMDS_MeshNode* aNode,
483 // const SMESHDS_Mesh* theMesh,
485 // const TopoDS_Shape* t_Edge) {
487 // TopoDS_Shape aPntShape, foundEdge;
488 // TopoDS_Vertex aVertex;
489 // gp_Pnt aPnt( aNode->X(), aNode->Y(), aNode->Z() );
491 // int foundInd, ind;
492 // double nearest = RealLast(), *t_Dist;
493 // double epsilon = Precision::Confusion();
495 // t_Dist = new double[ nEdge ];
496 // aPntShape = BRepBuilderAPI_MakeVertex( aPnt ).Shape();
497 // aVertex = TopoDS::Vertex( aPntShape );
499 // for ( ind=0; ind < nEdge; ind++ ) {
500 // BRepExtrema_DistShapeShape aDistance ( aVertex, t_Edge[ind] );
501 // t_Dist[ind] = aDistance.Value();
502 // if ( t_Dist[ind] < nearest ) {
503 // nearest = t_Dist[ind];
504 // foundEdge = t_Edge[ind];
506 // if ( nearest < epsilon )
512 // return theMesh->ShapeToIndex( foundEdge );
516 //=======================================================================
517 //function : readGMFFile
518 //purpose : read GMF file with geometry associated to mesh
520 //=======================================================================
522 // static bool readGMFFile(
523 // const int fileOpen,
524 // const char* theFileName,
525 // SMESH_Mesh& theMesh,
526 // const int nbShape,
527 // const TopoDS_Shape* tabShape,
529 // map <int,const SMDS_MeshNode*>& theGhs3dIdToNodeMap,
531 // int nbEnforcedVertices,
532 // int nbEnforcedNodes,
533 // TIDSortedNodeSet & theEnforcedNodes,
534 // TIDSortedElemSet & theEnforcedTriangles,
535 // TIDSortedElemSet & theEnforcedQuadrangles)
537 // TopoDS_Shape aShape;
538 // TopoDS_Vertex aVertex;
539 // SMESHDS_Mesh* theMeshDS = theMesh.GetMeshDS();
540 // int nbElem = 0, nbRef = 0, IdShapeRef = 1;
542 // int aGMFNodeID = 0;
544 // nbShape ? theMeshDS->ShapeToIndex( tabShape[0] ) : theMeshDS->ShapeToIndex( theMeshDS->ShapeToMesh() );
545 // int tetraShapeID = compoundID;
546 // double epsilon = Precision::Confusion();
547 // int *nodeAssigne, *GMFNodeAssigne;
548 // SMDS_MeshNode** GMFNode;
549 // TopoDS_Shape *tabCorner, *tabEdge;
550 // std::map <GmfKwdCod,int> tabRef;
554 // MESSAGE("Read " << theFileName << " file");
555 // int InpMsh = GmfOpenMesh(theFileName, GmfRead, &ver, &dim);
559 // // ===========================
560 // // Fill the tabID array: BEGIN
561 // // ===========================
564 // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
566 // Kernel_Utils::Localizer loc;
567 // struct stat status;
570 // char *ptr, *mapPtr;
572 // int *tab = new int[3];
574 // // Read the file state
575 // fstat(fileOpen, &status);
576 // length = status.st_size;
578 // // Mapping the result file into memory
580 // HANDLE fd = CreateFile(theFileName, GENERIC_READ, FILE_SHARE_READ,
581 // NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
582 // HANDLE hMapObject = CreateFileMapping(fd, NULL, PAGE_READONLY,
583 // 0, (DWORD)length, NULL);
584 // ptr = ( char* ) MapViewOfFile(hMapObject, FILE_MAP_READ, 0, 0, 0 );
586 // ptr = (char *) mmap(0,length,PROT_READ,MAP_PRIVATE,fileOpen,0);
590 // ptr = readMapIntLine(ptr, tab);
594 // int nbNodes = tab[1];
596 // for (int i=0; i < 4*nbElem; i++)
597 // strtol(ptr, &ptr, 10);
599 // for (int iNode=1; iNode <= nbNodes; iNode++)
600 // for (int iCoor=0; iCoor < 3; iCoor++)
601 // strtod(ptr, &ptr);
604 // // Reading the number of triangles which corresponds to the number of sub-domains
605 // int nbTriangle = strtol(ptr, &ptr, 10);
608 // // The keyword does not exist yet => to update when it is created
609 // // int nbTriangle = GmfStatKwd(InpMsh, GmfSubdomain);
613 // tabID = new int[nbTriangle];
614 // for (int i=0; i < nbTriangle; i++) {
616 // int nodeId1, nodeId2, nodeId3;
617 // // find the solid corresponding to GHS3D sub-domain following
618 // // the technique proposed in GHS3D manual in chapter
619 // // "B.4 Subdomain (sub-region) assignment"
621 // nodeId1 = strtol(ptr, &ptr, 10);
622 // nodeId2 = strtol(ptr, &ptr, 10);
623 // nodeId3 = strtol(ptr, &ptr, 10);
625 // // // The keyword does not exist yet => to update when it is created
626 // // GmfGetLin(InpMsh, GmfSubdomain, &id_tri[0], &id_tri[1], &id_tri[2]);
627 // // nodeId1 = id_tri[0];
628 // // nodeId2 = id_tri[1];
629 // // nodeId3 = id_tri[2];
631 // if ( nbTriangle > 1 ) {
632 // // get the nodes indices
633 // const SMDS_MeshNode* n1 = theGhs3dIdToNodeMap[ nodeId1 ];
634 // const SMDS_MeshNode* n2 = theGhs3dIdToNodeMap[ nodeId2 ];
635 // const SMDS_MeshNode* n3 = theGhs3dIdToNodeMap[ nodeId3 ];
637 // OCC_CATCH_SIGNALS;
638 // tabID[i] = findShapeID( theMesh, n1, n2, n3, toMeshHoles );
639 // // -- 0020330: Pb with ghs3d as a submesh
640 // // check that found shape is to be meshed
641 // if ( tabID[i] > 0 ) {
642 // const TopoDS_Shape& foundShape = theMeshDS->IndexToShape( tabID[i] );
643 // bool isToBeMeshed = false;
644 // for ( int iS = 0; !isToBeMeshed && iS < nbShape; ++iS )
645 // isToBeMeshed = foundShape.IsSame( tabShape[ iS ]);
646 // if ( !isToBeMeshed )
647 // tabID[i] = HOLE_ID;
649 // // END -- 0020330: Pb with ghs3d as a submesh
651 // std::cout << i+1 << " subdomain: findShapeID() returns " << tabID[i] << std::endl;
654 // catch ( Standard_Failure & ex)
657 // std::cout << i+1 << " subdomain: Exception caugt: " << ex.GetMessageString() << std::endl;
662 // std::cout << i+1 << " subdomain: unknown exception caught " << std::endl;
668 // // ===========================
669 // // Fill the tabID array: END
670 // // ===========================
673 // tabRef[GmfVertices] = 3;
674 // tabRef[GmfCorners] = 1;
675 // tabRef[GmfEdges] = 2;
676 // tabRef[GmfRidges] = 1;
677 // tabRef[GmfTriangles] = 3;
678 // // tabRef[GmfQuadrilaterals] = 4;
679 // tabRef[GmfTetrahedra] = 4;
680 // // tabRef[GmfHexahedra] = 8;
682 // SMDS_NodeIteratorPtr itOnGMFInputNode = theMeshDS->nodesIterator();
683 // while ( itOnGMFInputNode->more() )
684 // theMeshDS->RemoveNode( itOnGMFInputNode->next() );
687 // int nbVertices = GmfStatKwd(InpMsh, GmfVertices);
688 // int nbCorners = max(countShape( theMeshDS, TopAbs_VERTEX ) , GmfStatKwd(InpMsh, GmfCorners));
689 // int nbShapeEdge = countShape( theMeshDS, TopAbs_EDGE );
691 // tabCorner = new TopoDS_Shape[ nbCorners ];
692 // tabEdge = new TopoDS_Shape[ nbShapeEdge ];
693 // nodeAssigne = new int[ nbVertices + 1 ];
694 // GMFNodeAssigne = new int[ nbVertices + 1 ];
695 // GMFNode = new SMDS_MeshNode*[ nbVertices + 1 ];
697 // getShape(theMeshDS, TopAbs_VERTEX, tabCorner);
698 // getShape(theMeshDS, TopAbs_EDGE, tabEdge);
700 // std::map <GmfKwdCod,int>::const_iterator it = tabRef.begin();
701 // for ( ; it != tabRef.end() ; ++it)
704 // GmfKwdCod token = it->first;
705 // nbRef = it->second;
707 // nbElem = GmfStatKwd(InpMsh, token);
709 // GmfGotoKwd(InpMsh, token);
710 // std::cout << "Read " << nbElem;
715 // int id[nbElem*tabRef[token]];
716 // int ghs3dShapeID[nbElem];
718 // if (token == GmfVertices) {
719 // std::cout << " vertices" << std::endl;
722 // float VerTab_f[nbElem][3];
723 // double VerTab_d[nbElem][3];
724 // SMDS_MeshNode * aGMFNode;
726 // for ( int iElem = 0; iElem < nbElem; iElem++ ) {
727 // aGMFID = iElem + 1;
728 // if (ver == GmfFloat) {
729 // GmfGetLin(InpMsh, token, &VerTab_f[nbElem][0], &VerTab_f[nbElem][1], &VerTab_f[nbElem][2], &ghs3dShapeID[iElem]);
730 // aGMFNode = theMeshDS->AddNode(VerTab_f[nbElem][0], VerTab_f[nbElem][1], VerTab_f[nbElem][2]);
733 // GmfGetLin(InpMsh, token, &VerTab_d[nbElem][0], &VerTab_d[nbElem][1], &VerTab_d[nbElem][2], &ghs3dShapeID[iElem]);
734 // aGMFNode = theMeshDS->AddNode(VerTab_d[nbElem][0], VerTab_d[nbElem][1], VerTab_d[nbElem][2]);
736 // GMFNode[ aGMFID ] = aGMFNode;
737 // nodeAssigne[ aGMFID ] = 0;
738 // GMFNodeAssigne[ aGMFID ] = 0;
741 // else if (token == GmfCorners && nbElem > 0) {
742 // std::cout << " corners" << std::endl;
743 // for ( int iElem = 0; iElem < nbElem; iElem++ )
744 // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]]);
746 // else if (token == GmfRidges && nbElem > 0) {
747 // std::cout << " ridges" << std::endl;
748 // for ( int iElem = 0; iElem < nbElem; iElem++ )
749 // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]]);
751 // else if (token == GmfEdges && nbElem > 0) {
752 // std::cout << " edges" << std::endl;
753 // for ( int iElem = 0; iElem < nbElem; iElem++ )
754 // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &ghs3dShapeID[iElem]);
756 // else if (token == GmfTriangles && nbElem > 0) {
757 // std::cout << " triangles" << std::endl;
758 // for ( int iElem = 0; iElem < nbElem; iElem++ )
759 // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &ghs3dShapeID[iElem]);
761 // // else if (token == GmfQuadrilaterals && nbElem > 0) {
762 // // std::cout << " Quadrilaterals" << std::endl;
763 // // for ( int iElem = 0; iElem < nbElem; iElem++ )
764 // // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &id[iElem*tabRef[token]+3], &ghs3dShapeID[iElem]);
766 // else if (token == GmfTetrahedra && nbElem > 0) {
767 // std::cout << " Tetrahedra" << std::endl;
768 // for ( int iElem = 0; iElem < nbElem; iElem++ )
769 // GmfGetLin(InpMsh, token,
770 // &id[iElem*tabRef[token]],
771 // &id[iElem*tabRef[token]+1],
772 // &id[iElem*tabRef[token]+2],
773 // &id[iElem*tabRef[token]+3],
774 // &ghs3dShapeID[iElem]);
776 // // else if (token == GmfHexahedra && nbElem > 0) {
777 // // std::cout << " Hexahedra" << std::endl;
778 // // for ( int iElem = 0; iElem < nbElem; iElem++ )
779 // // GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &id[iElem*tabRef[token]+3],
780 // // &id[iElem*tabRef[token]+4], &id[iElem*tabRef[token]+5], &id[iElem*tabRef[token]+6], &id[iElem*tabRef[token]+7], &ghs3dShapeID[iElem]);
787 // case GmfTriangles:
788 // // case GmfQuadrilaterals:
789 // case GmfTetrahedra:
790 // // case GmfHexahedra:
792 // int nodeDim, shapeID, *nodeID;
793 // SMDS_MeshNode** node;
794 // // std::vector< SMDS_MeshNode* > enfNode( nbRef );
795 // SMDS_MeshElement * aGMFElement;
797 // node = new SMDS_MeshNode*[nbRef];
798 // nodeID = new int[ nbRef ];
800 // for ( int iElem = 0; iElem < nbElem; iElem++ )
802 // for ( int iRef = 0; iRef < nbRef; iRef++ )
804 // aGMFNodeID = id[iElem*tabRef[token]+iRef]; // read nbRef aGMFNodeID
805 // node [ iRef ] = GMFNode[ aGMFNodeID ];
806 // nodeID[ iRef ] = aGMFNodeID;
811 // case GmfCorners: {
813 // gp_Pnt GMFPnt ( node[0]->X(), node[0]->Y(), node[0]->Z() );
814 // for ( int i=0; i<nbElem; i++ ) {
815 // aVertex = TopoDS::Vertex( tabCorner[i] );
816 // gp_Pnt aPnt = BRep_Tool::Pnt( aVertex );
817 // if ( aPnt.Distance( GMFPnt ) < epsilon )
824 // aGMFElement = theMeshDS->AddEdge( node[0], node[1] );
826 // if ( GMFNodeAssigne[ nodeID[0] ] == 0 || GMFNodeAssigne[ nodeID[0] ] == 2 )
828 // shapeID = findEdgeID( node[iNode], theMeshDS, nbShapeEdge, tabEdge );
833 // case GmfTriangles: {
835 // aGMFElement = theMeshDS->AddFace( node[0], node[1], node[2]);
839 // // case GmfQuadrilaterals: {
841 // // aGMFElement = theMeshDS->AddFace( node[0], node[1], node[2], node[3] );
845 // case GmfTetrahedra: {
848 // TopoDS_Shape aSolid;
849 // // We always run GHS3D with "to mesh holes"==TRUE but we must not create
850 // // tetras within holes depending on hypo option,
851 // // so we first check if aTet is inside a hole and then create it
852 // if ( nbTriangle > 1 ) {
853 // tetraShapeID = HOLE_ID; // negative tetraShapeID means not to create tetras if !toMeshHoles
854 // int aGhs3dShapeID = ghs3dShapeID[iElem] - IdShapeRef;
855 // if ( tabID[ aGhs3dShapeID ] == 0 ) {
856 // TopAbs_State state;
857 // aSolid = findShape(node, aSolid, tabShape, tabBox, nbShape, &state);
858 // if ( toMeshHoles || state == TopAbs_IN )
859 // tetraShapeID = theMeshDS->ShapeToIndex( aSolid );
860 // tabID[ aGhs3dShapeID ] = tetraShapeID;
863 // tetraShapeID = tabID[ aGhs3dShapeID ];
865 // else if ( nbShape > 1 ) {
866 // // Case where nbTriangle == 1 while nbShape == 2 encountered
867 // // with compound of 2 boxes and "To mesh holes"==False,
868 // // so there are no subdomains specified for each tetrahedron.
869 // // Try to guess a solid by a node already bound to shape
871 // for ( int i=0; i<4 && tetraShapeID==0; i++ ) {
872 // if ( nodeAssigne[ nodeID[i] ] == 1 &&
873 // node[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE &&
874 // node[i]->getshapeId() > 1 )
876 // tetraShapeID = node[i]->getshapeId();
879 // if ( tetraShapeID==0 ) {
880 // aSolid = findShape(node, aSolid, tabShape, tabBox, nbShape);
881 // tetraShapeID = theMeshDS->ShapeToIndex( aSolid );
884 // // set new nodes and tetrahedron onto the shape
885 // for ( int i=0; i<4; i++ ) {
886 // if ( nodeAssigne[ nodeID[i] ] == 0 ) {
887 // if ( tetraShapeID != HOLE_ID )
888 // theMeshDS->SetNodeInVolume( node[i], tetraShapeID );
889 // nodeAssigne[ nodeID[i] ] = tetraShapeID;
892 // if ( toMeshHoles || tetraShapeID != HOLE_ID ) {
893 // aGMFElement = theMeshDS->AddVolume( node[1], node[0], node[2], node[3] );
894 // theMeshDS->SetMeshElementOnShape( aGMFElement, tetraShapeID );
902 // // case GmfHexahedra: {
904 // // aGMFElement = theMeshDS->AddVolume( node[0], node[3], node[2], node[1],
905 // // node[4], node[7], node[6], node[5] );
908 // default: continue;
910 // if (token != GmfRidges)
912 // for ( int i=0; i<nbRef; i++ ) {
913 // if ( GMFNodeAssigne[ nodeID[i] ] == 0 ) {
914 // if ( token == GmfCorners ) theMeshDS->SetNodeOnVertex( node[0], aVertex );
915 // else if ( token == GmfEdges ) theMeshDS->SetNodeOnEdge( node[i], shapeID );
916 // else if ( token == GmfTriangles ) theMeshDS->SetNodeOnFace( node[i], shapeID );
917 // GMFNodeAssigne[ nodeID[i] ] = nodeDim;
920 // if ( token != "Corners" )
921 // theMeshDS->SetMeshElementOnShape( aGMFElement, shapeID );
925 // if ( !toMeshHoles ) {
926 // map <int,const SMDS_MeshNode*>::iterator itOnNode = theGhs3dIdToNodeMap.find( nbVertices-(nbEnforcedVertices+nbEnforcedNodes) );
927 // for ( ; itOnNode != theGhs3dIdToNodeMap.end(); ++itOnNode) {
928 // if ( nodeAssigne[ itOnNode->first ] == HOLE_ID )
929 // theMeshDS->RemoveFreeNode( itOnNode->second, 0 );
936 // } // case GmfTetrahedra
937 // } // switch(token)
939 // cout << std::endl;
942 // UnmapViewOfFile(mapPtr);
943 // CloseHandle(hMapObject);
946 // munmap(mapPtr, length);
951 // delete [] tabCorner;
952 // delete [] tabEdge;
953 // delete [] nodeAssigne;
954 // delete [] GMFNodeAssigne;
955 // delete [] GMFNode;
961 //=======================================================================
962 //function : readGMFFile
963 //purpose : read GMF file w/o geometry associated to mesh
964 //=======================================================================
967 static bool readGMFFile(const char* theFile,
968 #ifdef WITH_SMESH_CANCEL_COMPUTE
969 GHS3DPlugin_GHS3D* theAlgo,
971 SMESH_MesherHelper* theHelper,
972 TIDSortedNodeSet & theEnforcedNodes,
973 TIDSortedElemSet & theEnforcedTriangles,
974 TIDSortedElemSet & theEnforcedQuadrangles)
976 SMESHDS_Mesh* theMesh = theHelper->GetMeshDS();
978 // ---------------------------------
979 // Read generated elements and nodes
980 // ---------------------------------
982 int nbElem = 0, nbRef = 0;
983 int aGMFNodeID = 0, shapeID;
985 SMDS_MeshNode** GMFNode;
986 std::map <GmfKwdCod,int> tabRef;
988 tabRef[GmfVertices] = 3;
989 tabRef[GmfCorners] = 1;
990 tabRef[GmfEdges] = 2;
991 tabRef[GmfRidges] = 1;
992 tabRef[GmfTriangles] = 3;
993 tabRef[GmfQuadrilaterals] = 4;
994 tabRef[GmfTetrahedra] = 4;
995 tabRef[GmfHexahedra] = 8;
997 theHelper->GetMesh()->Clear();
1000 MESSAGE("Read " << theFile << " file");
1001 int InpMsh = GmfOpenMesh(theFile, GmfRead, &ver, &dim);
1005 int nbVertices = GmfStatKwd(InpMsh, GmfVertices);
1006 GMFNode = new SMDS_MeshNode*[ nbVertices + 1 ];
1007 nodeAssigne = new int[ nbVertices + 1 ];
1009 std::map <GmfKwdCod,int>::const_iterator it = tabRef.begin();
1010 for ( ; it != tabRef.end() ; ++it)
1012 #ifdef WITH_SMESH_CANCEL_COMPUTE
1013 if(theAlgo->computeCanceled()) {
1014 GmfCloseMesh(InpMsh);
1016 delete [] nodeAssigne;
1021 GmfKwdCod token = it->first;
1024 nbElem = GmfStatKwd(InpMsh, token);
1026 GmfGotoKwd(InpMsh, token);
1027 std::cout << "Read " << nbElem;
1032 int id[nbElem*tabRef[token]];
1034 if (token == GmfVertices) {
1035 std::cout << " vertices" << std::endl;
1038 float VerTab_f[nbElem][3];
1039 double VerTab_d[nbElem][3];
1040 SMDS_MeshNode * aGMFNode;
1042 for ( int iElem = 0; iElem < nbElem; iElem++ ) {
1043 #ifdef WITH_SMESH_CANCEL_COMPUTE
1044 if(theAlgo->computeCanceled()) {
1045 GmfCloseMesh(InpMsh);
1047 delete [] nodeAssigne;
1052 if (ver == GmfFloat) {
1053 GmfGetLin(InpMsh, token, &VerTab_f[nbElem][0], &VerTab_f[nbElem][1], &VerTab_f[nbElem][2], &dummy);
1054 aGMFNode = theMesh->AddNode(VerTab_f[nbElem][0], VerTab_f[nbElem][1], VerTab_f[nbElem][2]);
1057 GmfGetLin(InpMsh, token, &VerTab_d[nbElem][0], &VerTab_d[nbElem][1], &VerTab_d[nbElem][2], &dummy);
1058 aGMFNode = theMesh->AddNode(VerTab_d[nbElem][0], VerTab_d[nbElem][1], VerTab_d[nbElem][2]);
1060 GMFNode[ aGMFID ] = aGMFNode;
1061 nodeAssigne[ aGMFID ] = 0;
1064 else if (token == GmfCorners && nbElem > 0) {
1065 std::cout << " corners" << std::endl;
1066 for ( int iElem = 0; iElem < nbElem; iElem++ )
1067 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]]);
1069 else if (token == GmfRidges && nbElem > 0) {
1070 std::cout << " ridges" << std::endl;
1071 for ( int iElem = 0; iElem < nbElem; iElem++ )
1072 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]]);
1074 else if (token == GmfEdges && nbElem > 0) {
1075 std::cout << " edges" << std::endl;
1076 for ( int iElem = 0; iElem < nbElem; iElem++ )
1077 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &dummy);
1079 else if (token == GmfTriangles && nbElem > 0) {
1080 std::cout << " triangles" << std::endl;
1081 for ( int iElem = 0; iElem < nbElem; iElem++ )
1082 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &dummy);
1084 else if (token == GmfQuadrilaterals && nbElem > 0) {
1085 std::cout << " Quadrilaterals" << std::endl;
1086 for ( int iElem = 0; iElem < nbElem; iElem++ )
1087 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &id[iElem*tabRef[token]+3], &dummy);
1089 else if (token == GmfTetrahedra && nbElem > 0) {
1090 std::cout << " Tetrahedra" << std::endl;
1091 for ( int iElem = 0; iElem < nbElem; iElem++ )
1092 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &id[iElem*tabRef[token]+3], &dummy);
1094 else if (token == GmfHexahedra && nbElem > 0) {
1095 std::cout << " Hexahedra" << std::endl;
1096 for ( int iElem = 0; iElem < nbElem; iElem++ )
1097 GmfGetLin(InpMsh, token, &id[iElem*tabRef[token]], &id[iElem*tabRef[token]+1], &id[iElem*tabRef[token]+2], &id[iElem*tabRef[token]+3],
1098 &id[iElem*tabRef[token]+4], &id[iElem*tabRef[token]+5], &id[iElem*tabRef[token]+6], &id[iElem*tabRef[token]+7], &dummy);
1100 std::cout << std::endl;
1107 case GmfQuadrilaterals:
1109 case GmfHexahedra: {
1110 std::vector< SMDS_MeshNode* > node( nbRef );
1111 std::vector< int > nodeID( nbRef );
1112 std::vector< SMDS_MeshNode* > enfNode( nbRef );
1114 for ( int iElem = 0; iElem < nbElem; iElem++ )
1116 #ifdef WITH_SMESH_CANCEL_COMPUTE
1117 if(theAlgo->computeCanceled()) {
1118 GmfCloseMesh(InpMsh);
1120 delete [] nodeAssigne;
1124 for ( int iRef = 0; iRef < nbRef; iRef++ )
1126 aGMFNodeID = id[iElem*tabRef[token]+iRef]; // read nbRef aGMFNodeID
1127 node [ iRef ] = GMFNode[ aGMFNodeID ];
1128 nodeID[ iRef ] = aGMFNodeID;
1134 theHelper->AddEdge( node[0], node[1] ); break;
1135 case GmfTriangles: {
1136 theMesh->AddFace( node[0], node[1], node[2]);
1139 case GmfQuadrilaterals: {
1140 theMesh->AddFace( node[0], node[1], node[2], node[3] );
1144 theHelper->AddVolume( node[0], node[1], node[2], node[3] ); break;
1146 theHelper->AddVolume( node[0], node[3], node[2], node[1],
1147 node[4], node[7], node[6], node[5] ); break;
1150 if ( token == GmfTriangles || token == GmfQuadrilaterals ) // "Quadrilaterals" and "Triangles"
1151 for ( int iRef = 0; iRef < nbRef; iRef++ )
1152 nodeAssigne[ nodeID[ iRef ]] = 1;
1159 shapeID = theHelper->GetSubShapeID();
1160 for ( int i = 0; i < nbVertices; ++i ) {
1161 #ifdef WITH_SMESH_CANCEL_COMPUTE
1162 if(theAlgo->computeCanceled()) {
1163 GmfCloseMesh(InpMsh);
1165 delete [] nodeAssigne;
1169 if ( !nodeAssigne[ i+1 ])
1170 theMesh->SetNodeInVolume( GMFNode[ i+1 ], shapeID );
1173 GmfCloseMesh(InpMsh);
1175 delete [] nodeAssigne;
1179 static bool writeGMFFile(const char* theMeshFileName,
1180 const char* theRequiredFileName,
1181 const char* theSolFileName,
1182 const SMESH_ProxyMesh& theProxyMesh,
1183 SMESH_Mesh * theMesh,
1184 vector <const SMDS_MeshNode*> & theNodeByGhs3dId,
1185 vector <const SMDS_MeshNode*> & theEnforcedNodeByGhs3dId,
1186 TIDSortedNodeSet & theEnforcedNodes,
1187 TIDSortedElemSet & theEnforcedEdges,
1188 TIDSortedElemSet & theEnforcedTriangles,
1189 TIDSortedElemSet & theEnforcedQuadrangles,
1190 GHS3DPlugin_Hypothesis::TEnforcedVertexValues & theEnforcedVertices)
1192 MESSAGE("writeGMFFile w/o geometry");
1193 int idx, idxRequired, idxSol;
1194 const int dummyint = 0;
1195 GHS3DPlugin_Hypothesis::TEnforcedVertexValues::const_iterator vertexIt;
1196 std::vector<double> enfVertexSizes;
1197 const SMDS_MeshElement* elem;
1198 TIDSortedElemSet anElemSet, anEnforcedEdgeSet, anEnforcedTriangleSet, anEnforcedQuadrangleSet;
1199 SMDS_ElemIteratorPtr nodeIt;
1200 map<const SMDS_MeshNode*,int> aNodeToGhs3dIdMap, anEnforcedNodeToGhs3dIdMap;
1201 TIDSortedElemSet::iterator elemIt;
1203 auto_ptr< SMESH_ElementSearcher > pntCls ( SMESH_MeshEditor( theMesh ).GetElementSearcher());
1205 int nbEnforcedVertices = theEnforcedVertices.size();
1206 // int nbEnforcedNodes = theEnforcedNodes.size();
1207 // int nbEnforcedEdges = theEnforcedEdges.size();
1208 // int nbEnforcedTriangles = theEnforcedTriangles.size();
1209 // int nbEnforcedQuadrangles = theEnforcedQuadrangles.size();
1212 int nbFaces = theProxyMesh.NbFaces();
1218 idx = GmfOpenMesh(theMeshFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1222 /* ========================== FACES ========================== */
1223 /* TRIANGLES ========================== */
1224 SMDS_ElemIteratorPtr eIt = theProxyMesh.GetFaces();
1225 while ( eIt->more() )
1228 anElemSet.insert(elem);
1229 // NODE_NB_1 NODE_NB_2 ...
1230 nodeIt = elem->nodesIterator();
1231 nbNodes = elem->NbCornerNodes();
1232 while ( nodeIt->more() && nbNodes-- )
1235 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1236 int newId = aNodeToGhs3dIdMap.size() + 1; // ghs3d ids count from 1
1237 aNodeToGhs3dIdMap.insert( make_pair( node, newId ));
1241 /* EDGES ========================== */
1243 // Iterate over the enforced edges
1244 for(elemIt = theEnforcedEdges.begin() ; elemIt != theEnforcedEdges.end() ; ++elemIt) {
1247 nodeIt = elem->nodesIterator();
1248 nbNodes = elem->NbCornerNodes();
1249 while ( nodeIt->more() && nbNodes-- ) {
1251 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1252 // Test if point is inside shape to mesh
1253 gp_Pnt myPoint(node->X(),node->Y(),node->Z());
1254 TopAbs_State result = pntCls->GetPointState( myPoint );
1255 if ( result != TopAbs_IN ) {
1261 nodeIt = elem->nodesIterator();
1262 nbNodes = elem->NbCornerNodes();
1263 while ( nodeIt->more() && nbNodes-- ) {
1265 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1266 int newId = aNodeToGhs3dIdMap.size() + anEnforcedNodeToGhs3dIdMap.size() + 1; // ghs3d ids count from 1
1267 anEnforcedNodeToGhs3dIdMap.insert( make_pair( node, newId ));
1269 anEnforcedEdgeSet.insert(elem);
1273 /* ENFORCED TRIANGLES ========================== */
1275 // Iterate over the enforced triangles
1276 for(elemIt = theEnforcedTriangles.begin() ; elemIt != theEnforcedTriangles.end() ; ++elemIt) {
1279 nodeIt = elem->nodesIterator();
1280 nbNodes = elem->NbCornerNodes();
1281 while ( nodeIt->more() && nbNodes-- ) {
1283 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1284 // Test if point is inside shape to mesh
1285 gp_Pnt myPoint(node->X(),node->Y(),node->Z());
1286 TopAbs_State result = pntCls->GetPointState( myPoint );
1287 if ( result != TopAbs_IN ) {
1293 nodeIt = elem->nodesIterator();
1294 nbNodes = elem->NbCornerNodes();
1295 while ( nodeIt->more() && nbNodes-- ) {
1297 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1298 int newId = aNodeToGhs3dIdMap.size() + anEnforcedNodeToGhs3dIdMap.size() + 1; // ghs3d ids count from 1
1299 anEnforcedNodeToGhs3dIdMap.insert( make_pair( node, newId ));
1301 anEnforcedTriangleSet.insert(elem);
1305 /* ENFORCED QUADRANGLES ========================== */
1307 // Iterate over the enforced quadrangles
1308 for(elemIt = theEnforcedQuadrangles.begin() ; elemIt != theEnforcedQuadrangles.end() ; ++elemIt) {
1311 nodeIt = elem->nodesIterator();
1312 nbNodes = elem->NbCornerNodes();
1313 while ( nodeIt->more() && nbNodes-- ) {
1315 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1316 // Test if point is inside shape to mesh
1317 gp_Pnt myPoint(node->X(),node->Y(),node->Z());
1318 TopAbs_State result = pntCls->GetPointState( myPoint );
1319 if ( result != TopAbs_IN ) {
1325 nodeIt = elem->nodesIterator();
1326 nbNodes = elem->NbCornerNodes();
1327 while ( nodeIt->more() && nbNodes-- ) {
1329 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1330 int newId = aNodeToGhs3dIdMap.size() + anEnforcedNodeToGhs3dIdMap.size() + 1; // ghs3d ids count from 1
1331 anEnforcedNodeToGhs3dIdMap.insert( make_pair( node, newId ));
1333 anEnforcedQuadrangleSet.insert(elem);
1338 // put nodes to theNodeByGhs3dId vector
1339 std::cout << "aNodeToGhs3dIdMap.size(): "<<aNodeToGhs3dIdMap.size()<<std::endl;
1340 theNodeByGhs3dId.resize( aNodeToGhs3dIdMap.size() );
1341 map<const SMDS_MeshNode*,int>::const_iterator n2id = aNodeToGhs3dIdMap.begin();
1342 for ( ; n2id != aNodeToGhs3dIdMap.end(); ++ n2id)
1344 // std::cout << "n2id->first: "<<n2id->first<<std::endl;
1345 theNodeByGhs3dId[ n2id->second - 1 ] = n2id->first; // ghs3d ids count from 1
1348 // put nodes to anEnforcedNodeToGhs3dIdMap vector
1349 std::cout << "anEnforcedNodeToGhs3dIdMap.size(): "<<anEnforcedNodeToGhs3dIdMap.size()<<std::endl;
1350 theEnforcedNodeByGhs3dId.resize( anEnforcedNodeToGhs3dIdMap.size() );
1351 n2id = anEnforcedNodeToGhs3dIdMap.begin();
1352 for ( ; n2id != anEnforcedNodeToGhs3dIdMap.end(); ++ n2id)
1354 // std::cout << "n2id->first: "<<n2id->first<<std::endl;
1355 theEnforcedNodeByGhs3dId[ n2id->second - aNodeToGhs3dIdMap.size() - 1 ] = n2id->first; // ghs3d ids count from 1
1359 /* ========================== NODES ========================== */
1360 vector<const SMDS_MeshNode*> theOrderedNodes, theRequiredNodes;
1361 std::set< std::vector<double> > nodesCoords;
1362 vector<const SMDS_MeshNode*>::const_iterator ghs3dNodeIt = theNodeByGhs3dId.begin();
1363 vector<const SMDS_MeshNode*>::const_iterator after = theNodeByGhs3dId.end();
1365 std::cout << theNodeByGhs3dId.size() << " nodes from mesh ..." << std::endl;
1366 for ( ; ghs3dNodeIt != after; ++ghs3dNodeIt )
1368 const SMDS_MeshNode* node = *ghs3dNodeIt;
1369 std::vector<double> coords;
1370 coords.push_back(node->X());
1371 coords.push_back(node->Y());
1372 coords.push_back(node->Z());
1373 nodesCoords.insert(coords);
1374 theOrderedNodes.push_back(node);
1377 // Iterate over the enforced nodes
1378 TIDSortedNodeSet::const_iterator enfNodeIt;
1379 std::cout << theEnforcedNodes.size() << " nodes from enforced nodes ..." << std::endl;
1380 for(enfNodeIt = theEnforcedNodes.begin() ; enfNodeIt != theEnforcedNodes.end() ; ++enfNodeIt)
1382 const SMDS_MeshNode* node = *enfNodeIt;
1383 std::vector<double> coords;
1384 coords.push_back(node->X());
1385 coords.push_back(node->Y());
1386 coords.push_back(node->Z());
1388 if (nodesCoords.find(coords) != nodesCoords.end()) {
1389 std::cout << "Node at " << node->X()<<", " <<node->Y()<<", " <<node->Z() << " found" << std::endl;
1393 if (theEnforcedVertices.find(coords) != theEnforcedVertices.end())
1396 // Test if point is inside shape to mesh
1397 gp_Pnt myPoint(node->X(),node->Y(),node->Z());
1398 TopAbs_State result = pntCls->GetPointState( myPoint );
1399 if ( result != TopAbs_IN )
1402 nodesCoords.insert(coords);
1403 theOrderedNodes.push_back(node);
1404 theRequiredNodes.push_back(node);
1406 // Iterate over the enforced nodes given by enforced elements
1407 ghs3dNodeIt = theEnforcedNodeByGhs3dId.begin();
1408 after = theEnforcedNodeByGhs3dId.end();
1409 std::cout << theEnforcedNodeByGhs3dId.size() << " nodes from enforced elements ..." << std::endl;
1410 for ( ; ghs3dNodeIt != after; ++ghs3dNodeIt )
1412 const SMDS_MeshNode* node = *ghs3dNodeIt;
1413 std::vector<double> coords;
1414 coords.push_back(node->X());
1415 coords.push_back(node->Y());
1416 coords.push_back(node->Z());
1418 if (nodesCoords.find(coords) != nodesCoords.end()) {
1419 std::cout << "Node at " << node->X()<<", " <<node->Y()<<", " <<node->Z() << " found" << std::endl;
1423 if (theEnforcedVertices.find(coords) != theEnforcedVertices.end())
1426 nodesCoords.insert(coords);
1427 theOrderedNodes.push_back(node);
1428 theRequiredNodes.push_back(node);
1431 int requiredNodes = theRequiredNodes.size();
1433 std::vector<std::vector<double> > ReqVerTab;
1434 if (nbEnforcedVertices) {
1435 // ReqVerTab.clear();
1436 std::cout << theEnforcedVertices.size() << " nodes from enforced vertices ..." << std::endl;
1437 // Iterate over the enforced vertices
1438 for(vertexIt = theEnforcedVertices.begin() ; vertexIt != theEnforcedVertices.end() ; ++vertexIt) {
1439 double x = vertexIt->first[0];
1440 double y = vertexIt->first[1];
1441 double z = vertexIt->first[2];
1442 // Test if point is inside shape to mesh
1443 gp_Pnt myPoint(x,y,z);
1444 TopAbs_State result = pntCls->GetPointState( myPoint );
1445 if ( result != TopAbs_IN )
1447 std::vector<double> coords;
1448 coords.push_back(x);
1449 coords.push_back(y);
1450 coords.push_back(z);
1451 ReqVerTab.push_back(coords);
1452 enfVertexSizes.push_back(vertexIt->second);
1458 std::cout << "Begin writting required nodes in GmfVertices" << std::endl;
1459 GmfSetKwd(idx, GmfVertices, theOrderedNodes.size()+solSize);
1460 for (ghs3dNodeIt = theOrderedNodes.begin();ghs3dNodeIt != theOrderedNodes.end();++ghs3dNodeIt)
1461 GmfSetLin(idx, GmfVertices, (*ghs3dNodeIt)->X(), (*ghs3dNodeIt)->Y(), (*ghs3dNodeIt)->Z(), dummyint);
1462 for (int i=0;i<solSize;i++) {
1463 std::cout << ReqVerTab[i][0] <<" "<< ReqVerTab[i][1] << " "<< ReqVerTab[i][2] << std::endl;
1464 GmfSetLin(idx, GmfVertices, ReqVerTab[i][0], ReqVerTab[i][1], ReqVerTab[i][2], dummyint);
1466 std::cout << "End writting required nodes in GmfVertices" << std::endl;
1468 if (requiredNodes + solSize) {
1469 GmfSetKwd(idx, GmfRequiredVertices, requiredNodes+solSize);
1470 if (requiredNodes) {
1471 std::cout << "Begin writting required nodes in GmfRequiredVertices" << std::endl;
1472 int startId = theOrderedNodes.size()-requiredNodes+1;
1473 std::cout << "startId: " << startId << std::endl;
1474 for (int i=0;i<requiredNodes;i++)
1475 GmfSetLin(idx, GmfRequiredVertices, startId+i);
1476 std::cout << "End writting required nodes in GmfRequiredVertices" << std::endl;
1479 std::cout << "Begin writting required vertices in GmfRequiredVertices" << std::endl;
1480 int startId = theOrderedNodes.size()+1;
1481 std::cout << "startId: " << startId << std::endl;
1482 for (int i=0;i<solSize;i++)
1483 GmfSetLin(idx, GmfRequiredVertices, startId+i);
1484 std::cout << "End writting required vertices in GmfRequiredVertices" << std::endl;
1486 std::cout << "Begin writting in sol file" << std::endl;
1487 idxSol = GmfOpenMesh(theSolFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1491 GmfCloseMesh(idxRequired);
1494 int TypTab[] = {GmfSca};
1495 GmfSetKwd(idxSol, GmfSolAtVertices, solSize, 1, TypTab);
1496 for (int i=0;i<solSize;i++) {
1497 std::cout << "enfVertexSizes.at(i): " << enfVertexSizes.at(i) << std::endl;
1498 double solTab[] = {enfVertexSizes.at(i)};
1499 GmfSetLin(idxSol, GmfSolAtVertices, solTab);
1501 std::cout << "End writting in sol file" << std::endl;
1505 // // GmfRequiredVertices + GmfSolAtVertices
1506 //// std::cout << "theRequiredNodes.size() + solSize: " << theRequiredNodes.size()+ solSize << std::endl;
1507 //// std::cout << "theRequiredNodes.size(): " << theRequiredNodes.size() << std::endl;
1508 // std::cout << "solSize: " << solSize << std::endl;
1509 //// if (theRequiredNodes.size()+ solSize) {
1510 //// GmfSetKwd(idx, GmfRequiredVertices, theRequiredNodes.size()+solSize);
1512 //// if (theRequiredNodes.size()) {
1513 //// std::cout << "Begin writting required nodes in GmfRequiredVertices" << std::endl;
1514 //// int startId = theOrderedNodes.size()-theRequiredNodes.size();
1515 //// std::cout << "startId: " << startId << std::endl;
1516 //// for (int i=1;i<=theRequiredNodes.size();i++)
1517 //// GmfSetLin(idx, GmfRequiredVertices, startId+i);
1518 //// std::cout << "End writting required nodes in GmfRequiredVertices" << std::endl;
1522 // std::cout << "Begin writting in sol file" << std::endl;
1523 // GmfSetKwd(idx, GmfRequiredVertices, solSize);
1524 // idxSol = GmfOpenMesh(theSolFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1526 // GmfCloseMesh(idx);
1528 // GmfCloseMesh(idxRequired);
1532 // int TypTab[] = {GmfSca};
1533 //// GmfSetKwd(idxRequired, GmfVertices, solSize);
1534 // GmfSetKwd(idxSol, GmfSolAtVertices, solSize, 1, TypTab);
1536 // for (int i=0;i<solSize;i++) {
1537 // double solTab[] = {enfVertexSizes.at(i)};
1538 // GmfSetLin(idx, GmfRequiredVertices, theOrderedNodes.size()+i+1);
1539 // GmfSetLin(idxSol, GmfSolAtVertices, solTab);
1540 //// GmfSetLin(idxRequired, GmfVertices, ReqVerTab[i][0], ReqVerTab[i][1], ReqVerTab[i][2], dummyint);
1542 // std::cout << "End writting in sol file" << std::endl;
1547 int nedge[2], ntri[3], nquad[4];
1549 int usedEnforcedEdges = 0;
1550 if (anEnforcedEdgeSet.size()) {
1551 // idxRequired = GmfOpenMesh(theRequiredFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1552 // if (!idxRequired)
1554 GmfSetKwd(idx, GmfEdges, anEnforcedEdgeSet.size());
1555 // GmfSetKwd(idxRequired, GmfEdges, anEnforcedEdgeSet.size());
1556 for(elemIt = anEnforcedEdgeSet.begin() ; elemIt != anEnforcedEdgeSet.end() ; ++elemIt) {
1558 nodeIt = elem->nodesIterator();
1560 while ( nodeIt->more() ) {
1562 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1563 map< const SMDS_MeshNode*,int >::iterator it = anEnforcedNodeToGhs3dIdMap.find(node);
1564 if (it == anEnforcedNodeToGhs3dIdMap.end())
1565 throw "Node not found";
1566 nedge[index] = it->second;
1569 GmfSetLin(idx, GmfEdges, nedge[0], nedge[1], dummyint);
1570 // GmfSetLin(idxRequired, GmfEdges, nedge[0], nedge[1], dummyint);
1571 usedEnforcedEdges++;
1573 // GmfCloseMesh(idxRequired);
1576 if (usedEnforcedEdges) {
1577 GmfSetKwd(idx, GmfRequiredEdges, usedEnforcedEdges);
1578 for (int enfID=1;enfID<=usedEnforcedEdges;enfID++) {
1579 GmfSetLin(idx, GmfRequiredEdges, enfID);
1583 if (anElemSet.size()+anEnforcedTriangleSet.size()) {
1584 GmfSetKwd(idx, GmfTriangles, anElemSet.size()+anEnforcedTriangleSet.size());
1585 for(elemIt = anElemSet.begin() ; elemIt != anElemSet.end() ; ++elemIt) {
1587 nodeIt = elem->nodesIterator();
1589 for ( int j = 0; j < 3; ++j ) {
1591 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1592 map< const SMDS_MeshNode*,int >::iterator it = aNodeToGhs3dIdMap.find(node);
1593 if (it == aNodeToGhs3dIdMap.end())
1594 throw "Node not found";
1595 ntri[index] = it->second;
1598 GmfSetLin(idx, GmfTriangles, ntri[0], ntri[1], ntri[2], dummyint);
1600 if (anEnforcedTriangleSet.size()) {
1601 int usedEnforcedTriangles = 0;
1602 for(elemIt = anEnforcedTriangleSet.begin() ; elemIt != anEnforcedTriangleSet.end() ; ++elemIt) {
1604 nodeIt = elem->nodesIterator();
1606 for ( int j = 0; j < 3; ++j ) {
1608 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1609 map< const SMDS_MeshNode*,int >::iterator it = anEnforcedNodeToGhs3dIdMap.find(node);
1610 if (it == anEnforcedNodeToGhs3dIdMap.end())
1611 throw "Node not found";
1612 ntri[index] = it->second;
1615 GmfSetLin(idx, GmfTriangles, ntri[0], ntri[1], ntri[2], dummyint);
1616 usedEnforcedTriangles++;
1618 if (usedEnforcedTriangles) {
1619 GmfSetKwd(idx, GmfRequiredTriangles, usedEnforcedTriangles);
1620 for (int enfID=1;enfID<=usedEnforcedTriangles;enfID++)
1621 GmfSetLin(idx, GmfRequiredTriangles, anElemSet.size()+enfID);
1626 if (anEnforcedQuadrangleSet.size()) {
1627 int usedEnforcedQuadrilaterals = 0;
1628 GmfSetKwd(idx, GmfQuadrilaterals, anEnforcedQuadrangleSet.size());
1629 for(elemIt = anEnforcedQuadrangleSet.begin() ; elemIt != anEnforcedQuadrangleSet.end() ; ++elemIt) {
1631 nodeIt = elem->nodesIterator();
1633 for ( int j = 0; j < 4; ++j ) {
1635 const SMDS_MeshNode* node = castToNode( nodeIt->next() );
1636 map< const SMDS_MeshNode*,int >::iterator it = anEnforcedNodeToGhs3dIdMap.find(node);
1637 if (it == anEnforcedNodeToGhs3dIdMap.end())
1638 throw "Node not found";
1639 nquad[index] = it->second;
1642 GmfSetLin(idx, GmfQuadrilaterals, nquad[0], nquad[1], nquad[2], nquad[3], dummyint);
1643 usedEnforcedQuadrilaterals++;
1645 if (usedEnforcedQuadrilaterals) {
1646 GmfSetKwd(idx, GmfRequiredQuadrilaterals, usedEnforcedQuadrilaterals);
1647 for (int enfID=1;enfID<=usedEnforcedQuadrilaterals;enfID++)
1648 GmfSetLin(idx, GmfRequiredQuadrilaterals, enfID);
1654 GmfCloseMesh(idxRequired);
1656 GmfCloseMesh(idxSol);
1662 static bool writeGMFFile(const char* theMeshFileName,
1663 const char* theRequiredFileName,
1664 const char* theSolFileName,
1665 SMESH_MesherHelper& theHelper,
1666 const SMESH_ProxyMesh& theProxyMesh,
1667 map <int,int> & theSmdsToGhs3dIdMap,
1668 map <int,const SMDS_MeshNode*> & theGhs3dIdToNodeMap,
1669 TIDSortedNodeSet & theEnforcedNodes,
1670 TIDSortedElemSet & theEnforcedEdges,
1671 TIDSortedElemSet & theEnforcedTriangles,
1672 TIDSortedElemSet & theEnforcedQuadrangles,
1673 GHS3DPlugin_Hypothesis::TEnforcedVertexValues & theEnforcedVertices)
1675 MESSAGE("writeGMFFile with geometry");
1676 int idx, nbv, nbev, nben, aGhs3dID = 0;
1677 const int dummyint = 0;
1678 GHS3DPlugin_Hypothesis::TEnforcedVertexValues::const_iterator vertexIt;
1679 std::vector<double> enfVertexSizes;
1680 TIDSortedNodeSet::const_iterator enfNodeIt;
1681 const SMDS_MeshNode* node;
1682 SMDS_NodeIteratorPtr nodeIt;
1683 std::map<int,int> theNodeId2NodeIndexMap;
1685 idx = GmfOpenMesh(theMeshFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1689 SMESHDS_Mesh * theMeshDS = theHelper.GetMeshDS();
1691 /* ========================== NODES ========================== */
1693 nbv = theMeshDS->NbNodes();
1696 nbev = theEnforcedVertices.size();
1697 nben = theEnforcedNodes.size();
1699 nodeIt = theMeshDS->nodesIterator();
1701 // Issue 020674: EDF 870 SMESH: Mesh generated by Netgen not usable by GHS3D
1702 // The problem is in nodes on degenerated edges, we need to skip them
1703 if ( theHelper.HasDegeneratedEdges() )
1705 // here we decrease total nb of nodes by nb of nodes on degenerated edges
1707 for (TopExp_Explorer e(theMeshDS->ShapeToMesh(), TopAbs_EDGE ); e.More(); e.Next())
1709 SMESH_subMesh* sm = theHelper.GetMesh()->GetSubMesh( e.Current() );
1710 if ( checkedSM.insert( sm->GetId() ).second && theHelper.IsDegenShape(sm->GetId() )) {
1711 if ( sm->GetSubMeshDS() )
1712 nbv -= sm->GetSubMeshDS()->NbNodes();
1717 const bool isQuadMesh =
1718 theHelper.GetMesh()->NbEdges( ORDER_QUADRATIC ) ||
1719 theHelper.GetMesh()->NbFaces( ORDER_QUADRATIC ) ||
1720 theHelper.GetMesh()->NbVolumes( ORDER_QUADRATIC );
1723 // descrease nbNodes by nb of medium nodes
1724 while ( nodeIt->more() )
1726 node = nodeIt->next();
1727 if ( !theHelper.IsDegenShape( node->getshapeId() ))
1728 nbv -= int( theHelper.IsMedium( node ));
1730 nodeIt = theMeshDS->nodesIterator();
1733 std::vector<std::vector<double> > VerTab;
1735 std::vector<double> aVerTab;
1736 // Loop from 1 to NB_NODES
1738 while ( nodeIt->more() )
1740 node = nodeIt->next();
1741 if (( isQuadMesh && theHelper.IsMedium( node )) || // Issue 0021238
1742 theHelper.IsDegenShape( node->getshapeId() )) // Issue 0020674
1746 aVerTab.push_back(node->X());
1747 aVerTab.push_back(node->Y());
1748 aVerTab.push_back(node->Z());
1749 VerTab.push_back(aVerTab);
1751 theSmdsToGhs3dIdMap.insert( make_pair( node->GetID(), aGhs3dID ));
1752 theGhs3dIdToNodeMap.insert( make_pair( aGhs3dID, node ));
1755 /* ENFORCED NODES ========================== */
1757 for(enfNodeIt = theEnforcedNodes.begin() ; enfNodeIt != theEnforcedNodes.end() ; ++enfNodeIt) {
1758 double x = (*enfNodeIt)->X();
1759 double y = (*enfNodeIt)->Y();
1760 double z = (*enfNodeIt)->Z();
1761 // Test if point is inside shape to mesh
1762 gp_Pnt myPoint(x,y,z);
1763 BRepClass3d_SolidClassifier scl(theMeshDS->ShapeToMesh());
1764 scl.Perform(myPoint, 1e-7);
1765 TopAbs_State result = scl.State();
1766 if ( result != TopAbs_IN )
1768 std::vector<double> coords;
1769 coords.push_back(x);
1770 coords.push_back(y);
1771 coords.push_back(z);
1772 if (theEnforcedVertices.find(coords) != theEnforcedVertices.end())
1775 aVerTab.push_back(x);
1776 aVerTab.push_back(y);
1777 aVerTab.push_back(z);
1778 VerTab.push_back(aVerTab);
1780 theNodeId2NodeIndexMap.insert( make_pair( (*enfNodeIt)->GetID(), aGhs3dID ));
1784 /* Write vertices number */
1785 MESSAGE("Number of vertices: "<<aGhs3dID);
1786 MESSAGE("Size of vector: "<<VerTab.size());
1787 GmfSetKwd(idx, GmfVertices, aGhs3dID);
1788 for (int i=0;i<aGhs3dID;i++)
1789 GmfSetLin(idx, GmfVertices, VerTab[i][0], VerTab[i][1], VerTab[i][2], dummyint);
1792 /* ENFORCED VERTICES ========================== */
1794 std::vector<std::vector<double> > ReqVerTab;
1796 std::vector<double> aReqVerTab;
1798 for(vertexIt = theEnforcedVertices.begin() ; vertexIt != theEnforcedVertices.end() ; ++vertexIt) {
1799 double x = vertexIt->first[0];
1800 double y = vertexIt->first[1];
1801 double z = vertexIt->first[2];
1802 // Test if point is inside shape to mesh
1803 gp_Pnt myPoint(x,y,z);
1804 BRepClass3d_SolidClassifier scl(theMeshDS->ShapeToMesh());
1805 scl.Perform(myPoint, 1e-7);
1806 TopAbs_State result = scl.State();
1807 if ( result != TopAbs_IN )
1809 enfVertexSizes.push_back(vertexIt->second);
1811 aReqVerTab.push_back(x);
1812 aReqVerTab.push_back(y);
1813 aReqVerTab.push_back(z);
1814 ReqVerTab.push_back(aReqVerTab);
1819 int idxRequired = GmfOpenMesh(theRequiredFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1822 int idxSol = GmfOpenMesh(theSolFileName, GmfWrite, GMFVERSION, GMFDIMENSION);
1826 int TypTab[] = {GmfSca};
1827 GmfSetKwd(idxRequired, GmfVertices, solSize);
1828 GmfSetKwd(idxSol, GmfSolAtVertices, solSize, 1, TypTab);
1830 for (int i=0;i<solSize;i++) {
1831 double solTab[] = {enfVertexSizes.at(i)};
1832 GmfSetLin(idxRequired, GmfVertices, ReqVerTab[i][0], ReqVerTab[i][1], ReqVerTab[i][2], dummyint);
1833 GmfSetLin(idxSol, GmfSolAtVertices, solTab);
1835 GmfCloseMesh(idxRequired);
1836 GmfCloseMesh(idxSol);
1841 /* ========================== FACES ========================== */
1843 int nbTriangles = 0, nbQuadrangles = 0, aSmdsID;
1844 TopTools_IndexedMapOfShape facesMap, trianglesMap, quadranglesMap;
1845 TIDSortedElemSet::const_iterator elemIt;
1846 const SMESHDS_SubMesh* theSubMesh;
1847 TopoDS_Shape aShape;
1848 SMDS_ElemIteratorPtr itOnSubMesh, itOnSubFace;
1849 const SMDS_MeshElement* aFace;
1850 map<int,int>::const_iterator itOnMap;
1851 std::vector<std::vector<int> > tt, qt,et;
1855 std::vector<int> att, aqt, aet;
1857 TopExp::MapShapes( theMeshDS->ShapeToMesh(), TopAbs_FACE, facesMap );
1859 for ( int i = 1; i <= facesMap.Extent(); ++i )
1860 if (( theSubMesh = theProxyMesh.GetSubMesh( facesMap(i))))
1862 SMDS_ElemIteratorPtr it = theSubMesh->GetElements();
1865 const SMDS_MeshElement *elem = it->next();
1866 if (elem->NbCornerNodes() == 3)
1868 trianglesMap.Add(facesMap(i));
1871 else if (elem->NbCornerNodes() == 4)
1873 quadranglesMap.Add(facesMap(i));
1879 /* TRIANGLES ========================== */
1881 for ( int i = 1; i <= trianglesMap.Extent(); i++ )
1883 aShape = trianglesMap(i);
1884 theSubMesh = theProxyMesh.GetSubMesh(aShape);
1885 if ( !theSubMesh ) continue;
1886 itOnSubMesh = theSubMesh->GetElements();
1887 while ( itOnSubMesh->more() )
1889 aFace = itOnSubMesh->next();
1890 itOnSubFace = aFace->nodesIterator();
1892 for ( int j = 0; j < 3; ++j ) {
1894 aSmdsID = itOnSubFace->next()->GetID();
1895 itOnMap = theSmdsToGhs3dIdMap.find( aSmdsID );
1896 ASSERT( itOnMap != theSmdsToGhs3dIdMap.end() );
1897 att.push_back((*itOnMap).second);
1904 if (theEnforcedTriangles.size()) {
1905 // Iterate over the enforced triangles
1906 for(elemIt = theEnforcedTriangles.begin() ; elemIt != theEnforcedTriangles.end() ; ++elemIt) {
1909 itOnSubFace = aFace->nodesIterator();
1911 for ( int j = 0; j < 3; ++j ) {
1912 int aNodeID = itOnSubFace->next()->GetID();
1913 itOnMap = theNodeId2NodeIndexMap.find(aNodeID);
1914 if (itOnMap != theNodeId2NodeIndexMap.end())
1915 att.push_back((*itOnMap).second);
1918 theEnforcedTriangles.erase(elemIt);
1928 GmfSetKwd(idx, GmfTriangles, tt.size());
1929 for (int i=0;i<tt.size();i++)
1930 GmfSetLin(idx, GmfTriangles, tt[i][0], tt[i][1], tt[i][2], dummyint);
1933 /* QUADRANGLES ========================== */
1934 if (nbQuadrangles) {
1935 for ( int i = 1; i <= quadranglesMap.Extent(); i++ )
1937 aShape = quadranglesMap(i);
1938 theSubMesh = theProxyMesh.GetSubMesh(aShape);
1939 if ( !theSubMesh ) continue;
1940 itOnSubMesh = theSubMesh->GetElements();
1941 for ( int j = 0; j < 4; ++j )
1943 aFace = itOnSubMesh->next();
1944 itOnSubFace = aFace->nodesIterator();
1946 while ( itOnSubFace->more() ) {
1948 aSmdsID = itOnSubFace->next()->GetID();
1949 itOnMap = theSmdsToGhs3dIdMap.find( aSmdsID );
1950 ASSERT( itOnMap != theSmdsToGhs3dIdMap.end() );
1951 aqt.push_back((*itOnMap).second);
1958 if (theEnforcedQuadrangles.size()) {
1959 // Iterate over the enforced triangles
1960 for(elemIt = theEnforcedQuadrangles.begin() ; elemIt != theEnforcedQuadrangles.end() ; ++elemIt) {
1963 itOnSubFace = aFace->nodesIterator();
1965 for ( int j = 0; j < 4; ++j ) {
1966 int aNodeID = itOnSubFace->next()->GetID();
1967 itOnMap = theNodeId2NodeIndexMap.find(aNodeID);
1968 if (itOnMap != theNodeId2NodeIndexMap.end())
1969 aqt.push_back((*itOnMap).second);
1972 theEnforcedQuadrangles.erase(elemIt);
1982 GmfSetKwd(idx, GmfQuadrilaterals, qt.size());
1983 for (int i=0;i<qt.size();i++)
1984 GmfSetLin(idx, GmfQuadrilaterals, qt[i][0], qt[i][1], qt[i][2], qt[i][3], dummyint);
1988 /* ========================== EDGES ========================== */
1990 if (theEnforcedEdges.size()) {
1991 // Iterate over the enforced edges
1992 for(elemIt = theEnforcedEdges.begin() ; elemIt != theEnforcedEdges.end() ; ++elemIt) {
1995 itOnSubFace = aFace->nodesIterator();
1997 for ( int j = 0; j < 2; ++j ) {
1998 int aNodeID = itOnSubFace->next()->GetID();
1999 itOnMap = theNodeId2NodeIndexMap.find(aNodeID);
2000 if (itOnMap != theNodeId2NodeIndexMap.end())
2001 aet.push_back((*itOnMap).second);
2004 theEnforcedEdges.erase(elemIt);
2014 GmfSetKwd(idx, GmfEdges, et.size());
2015 for (int i=0;i<et.size();i++)
2016 GmfSetLin(idx, GmfEdges, et[i][0], et[i][1], dummyint);
2023 //=======================================================================
2024 //function : writeFaces
2025 //purpose : Write Faces in case if generate 3D mesh with geometry
2026 //=======================================================================
2028 // static bool writeFaces (ofstream & theFile,
2029 // const SMESH_ProxyMesh& theMesh,
2030 // const TopoDS_Shape& theShape,
2031 // const map <int,int> & theSmdsToGhs3dIdMap,
2032 // const map <int,int> & theEnforcedNodeIdToGhs3dIdMap,
2033 // TIDSortedElemSet & theEnforcedEdges,
2034 // TIDSortedElemSet & theEnforcedTriangles,
2035 // TIDSortedElemSet & theEnforcedQuadrangles)
2037 // // record structure:
2039 // // NB_ELEMS DUMMY_INT
2040 // // Loop from 1 to NB_ELEMS
2041 // // NB_NODES NODE_NB_1 NODE_NB_2 ... (NB_NODES + 1) times: DUMMY_INT
2043 // TopoDS_Shape aShape;
2044 // const SMESHDS_SubMesh* theSubMesh;
2045 // const SMDS_MeshElement* aFace;
2046 // const char* space = " ";
2047 // const int dummyint = 0;
2048 // map<int,int>::const_iterator itOnMap;
2049 // SMDS_ElemIteratorPtr itOnSubMesh, itOnSubFace;
2050 // int nbNodes, aSmdsID;
2052 // TIDSortedElemSet::const_iterator elemIt;
2053 // int nbEnforcedEdges = theEnforcedEdges.size();
2054 // int nbEnforcedTriangles = theEnforcedTriangles.size();
2055 // int nbEnforcedQuadrangles = theEnforcedQuadrangles.size();
2056 // // count triangles bound to geometry
2057 // int nbTriangles = 0;
2059 // TopTools_IndexedMapOfShape facesMap, trianglesMap, quadranglesMap;
2060 // TopExp::MapShapes( theShape, TopAbs_FACE, facesMap );
2062 // for ( int i = 1; i <= facesMap.Extent(); ++i )
2063 // if (( theSubMesh = theMesh.GetSubMesh( facesMap(i))))
2064 // nbTriangles += theSubMesh->NbElements();
2066 // std::cout << " " << facesMap.Extent() << " shapes of 2D dimension and" << std::endl;
2067 // if (nbEnforcedEdges+nbEnforcedTriangles+nbEnforcedQuadrangles)
2068 // std::cout << " " << nbEnforcedEdges+nbEnforcedTriangles+nbEnforcedQuadrangles
2069 // << " enforced shapes:" << std::endl;
2070 // if (nbEnforcedEdges)
2071 // std::cout << " " << nbEnforcedEdges << " enforced edges" << std::endl;
2072 // if (nbEnforcedTriangles)
2073 // std::cout << " " << nbEnforcedTriangles << " enforced triangles" << std::endl;
2074 // if (nbEnforcedQuadrangles)
2075 // std::cout << " " << nbEnforcedQuadrangles << " enforced quadrangles" << std::endl;
2076 // std::cout << std::endl;
2078 // // theFile << space << nbTriangles << space << dummyint << std::endl;
2079 // std::ostringstream globalStream, localStream, aStream;
2085 // for ( int i = 1; i <= facesMap.Extent(); i++ )
2087 // aShape = facesMap(i);
2088 // theSubMesh = theMesh.GetSubMesh(aShape);
2089 // if ( !theSubMesh ) continue;
2090 // itOnSubMesh = theSubMesh->GetElements();
2091 // while ( itOnSubMesh->more() )
2093 // aFace = itOnSubMesh->next();
2094 // nbNodes = aFace->NbNodes();
2096 // localStream << nbNodes << space;
2098 // itOnSubFace = aFace->nodesIterator();
2099 // while ( itOnSubFace->more() ) {
2101 // aSmdsID = itOnSubFace->next()->GetID();
2102 // itOnMap = theSmdsToGhs3dIdMap.find( aSmdsID );
2103 // // if ( itOnMap == theSmdsToGhs3dIdMap.end() ) {
2104 // // cout << "not found node: " << aSmdsID << endl;
2107 // ASSERT( itOnMap != theSmdsToGhs3dIdMap.end() );
2109 // localStream << (*itOnMap).second << space ;
2112 // // (NB_NODES + 1) times: DUMMY_INT
2113 // for ( int j=0; j<=nbNodes; j++)
2114 // localStream << dummyint << space ;
2116 // localStream << std::endl;
2120 // globalStream << localStream.str();
2121 // localStream.str("");
2128 // // ENFORCED EDGES : BEGIN
2131 // // Iterate over the enforced edges
2132 // int usedEnforcedEdges = 0;
2134 // for(elemIt = theEnforcedEdges.begin() ; elemIt != theEnforcedEdges.end() ; ++elemIt) {
2135 // aFace = (*elemIt);
2137 // itOnSubFace = aFace->nodesIterator();
2139 // aStream << "2" << space ;
2140 // while ( itOnSubFace->more() ) {
2141 // aSmdsID = itOnSubFace->next()->GetID();
2142 // itOnMap = theEnforcedNodeIdToGhs3dIdMap.find(aSmdsID);
2143 // if (itOnMap != theEnforcedNodeIdToGhs3dIdMap.end())
2144 // aStream << (*itOnMap).second << space;
2151 // for ( int j=0; j<=2; j++)
2152 // aStream << dummyint << space ;
2153 // // aStream << dummyint << space << dummyint;
2154 // localStream << aStream.str() << std::endl;
2155 // usedEnforcedEdges++;
2159 // if (usedEnforcedEdges) {
2160 // globalStream << localStream.str();
2161 // localStream.str("");
2165 // // ENFORCED EDGES : END
2170 // // ENFORCED TRIANGLES : BEGIN
2172 // // Iterate over the enforced triangles
2173 // int usedEnforcedTriangles = 0;
2174 // for(elemIt = theEnforcedTriangles.begin() ; elemIt != theEnforcedTriangles.end() ; ++elemIt) {
2175 // aFace = (*elemIt);
2177 // itOnSubFace = aFace->nodesIterator();
2179 // aStream << "3" << space ;
2180 // while ( itOnSubFace->more() ) {
2181 // aSmdsID = itOnSubFace->next()->GetID();
2182 // itOnMap = theEnforcedNodeIdToGhs3dIdMap.find(aSmdsID);
2183 // if (itOnMap != theEnforcedNodeIdToGhs3dIdMap.end())
2184 // aStream << (*itOnMap).second << space;
2191 // for ( int j=0; j<=3; j++)
2192 // aStream << dummyint << space ;
2193 // localStream << aStream.str() << std::endl;
2194 // usedEnforcedTriangles++;
2198 // if (usedEnforcedTriangles) {
2199 // globalStream << localStream.str();
2200 // localStream.str("");
2204 // // ENFORCED TRIANGLES : END
2208 // // ENFORCED QUADRANGLES : BEGIN
2210 // // Iterate over the enforced quadrangles
2211 // int usedEnforcedQuadrangles = 0;
2212 // for(elemIt = theEnforcedQuadrangles.begin() ; elemIt != theEnforcedQuadrangles.end() ; ++elemIt) {
2213 // aFace = (*elemIt);
2215 // itOnSubFace = aFace->nodesIterator();
2217 // aStream << "4" << space ;
2218 // while ( itOnSubFace->more() ) {
2219 // aSmdsID = itOnSubFace->next()->GetID();
2220 // itOnMap = theEnforcedNodeIdToGhs3dIdMap.find(aSmdsID);
2221 // if (itOnMap != theEnforcedNodeIdToGhs3dIdMap.end())
2222 // aStream << (*itOnMap).second << space;
2229 // for ( int j=0; j<=4; j++)
2230 // aStream << dummyint << space ;
2231 // localStream << aStream.str() << std::endl;
2232 // usedEnforcedQuadrangles++;
2236 // if (usedEnforcedQuadrangles) {
2237 // globalStream << localStream.str();
2238 // localStream.str("");
2241 // // ENFORCED QUADRANGLES : END
2245 // << nbTriangles+usedEnforcedQuadrangles+usedEnforcedTriangles+usedEnforcedEdges
2246 // << " 0" << std::endl
2247 // << globalStream.str();
2252 //=======================================================================
2253 //function : writePoints
2255 //=======================================================================
2257 // static bool writePoints (ofstream & theFile,
2258 // SMESH_MesherHelper& theHelper,
2259 // map <int,int> & theSmdsToGhs3dIdMap,
2260 // map <int,int> & theEnforcedNodeIdToGhs3dIdMap,
2261 // map <int,const SMDS_MeshNode*> & theGhs3dIdToNodeMap,
2262 // GHS3DPlugin_Hypothesis::TID2SizeMap & theNodeIDToSizeMap,
2263 // GHS3DPlugin_Hypothesis::TEnforcedVertexValues & theEnforcedVertices,
2264 // TIDSortedNodeSet & theEnforcedNodes)
2266 // // record structure:
2269 // // Loop from 1 to NB_NODES
2270 // // X Y Z DUMMY_INT
2272 // SMESHDS_Mesh * theMesh = theHelper.GetMeshDS();
2273 // int nbNodes = theMesh->NbNodes();
2274 // if ( nbNodes == 0 )
2276 // int nbEnforcedVertices = theEnforcedVertices.size();
2277 // int nbEnforcedNodes = theEnforcedNodes.size();
2279 // int aGhs3dID = 1;
2280 // SMDS_NodeIteratorPtr it = theMesh->nodesIterator();
2281 // const SMDS_MeshNode* node;
2283 // // Issue 020674: EDF 870 SMESH: Mesh generated by Netgen not usable by GHS3D
2284 // // The problem is in nodes on degenerated edges, we need to skip them
2285 // if ( theHelper.HasDegeneratedEdges() )
2287 // // here we decrease total nb of nodes by nb of nodes on degenerated edges
2288 // set<int> checkedSM;
2289 // for (TopExp_Explorer e(theMesh->ShapeToMesh(), TopAbs_EDGE ); e.More(); e.Next())
2291 // SMESH_subMesh* sm = theHelper.GetMesh()->GetSubMesh( e.Current() );
2292 // if ( checkedSM.insert( sm->GetId() ).second && theHelper.IsDegenShape(sm->GetId() )) {
2293 // if ( sm->GetSubMeshDS() )
2294 // nbNodes -= sm->GetSubMeshDS()->NbNodes();
2299 // const bool isQuadMesh =
2300 // theHelper.GetMesh()->NbEdges( ORDER_QUADRATIC ) ||
2301 // theHelper.GetMesh()->NbFaces( ORDER_QUADRATIC ) ||
2302 // theHelper.GetMesh()->NbVolumes( ORDER_QUADRATIC );
2303 // if ( isQuadMesh )
2305 // // descrease nbNodes by nb of medium nodes
2306 // while ( it->more() )
2308 // node = it->next();
2309 // if ( !theHelper.IsDegenShape( node->getshapeId() ))
2310 // nbNodes -= int( theHelper.IsMedium( node ));
2312 // it = theMesh->nodesIterator();
2315 // const char* space = " ";
2316 // const int dummyint = 0;
2319 // std::cout << std::endl;
2320 // std::cout << "The initial 2D mesh contains :" << std::endl;
2321 // std::cout << " " << nbNodes << " nodes" << std::endl;
2322 // if (nbEnforcedVertices > 0)
2323 // std::cout << " " << nbEnforcedVertices << " enforced vertices" << std::endl;
2324 // if (nbEnforcedNodes > 0)
2325 // std::cout << " " << nbEnforcedNodes << " enforced nodes" << std::endl;
2327 // // std::cout << std::endl;
2328 // // std::cout << "Start writing in 'points' file ..." << std::endl;
2329 // theFile << nbNodes << space << std::endl;
2331 // // Loop from 1 to NB_NODES
2333 // while ( it->more() )
2335 // node = it->next();
2336 // if (( isQuadMesh && theHelper.IsMedium( node )) || // Issue 0021238
2337 // theHelper.IsDegenShape( node->getshapeId() )) // Issue 0020674
2340 // theSmdsToGhs3dIdMap.insert( make_pair( node->GetID(), aGhs3dID ));
2341 // theGhs3dIdToNodeMap.insert( make_pair( aGhs3dID, node ));
2344 // // X Y Z DUMMY_INT
2346 // << node->X() << space
2347 // << node->Y() << space
2348 // << node->Z() << space
2349 // << dummyint << space ;
2350 // theFile << std::endl;
2354 // // Iterate over the enforced nodes
2355 // TIDSortedNodeSet::const_iterator nodeIt;
2356 // std::map<int,double> enfVertexIndexSizeMap;
2357 // if (nbEnforcedNodes) {
2358 // for(nodeIt = theEnforcedNodes.begin() ; nodeIt != theEnforcedNodes.end() ; ++nodeIt) {
2359 // double x = (*nodeIt)->X();
2360 // double y = (*nodeIt)->Y();
2361 // double z = (*nodeIt)->Z();
2362 // // Test if point is inside shape to mesh
2363 // gp_Pnt myPoint(x,y,z);
2364 // BRepClass3d_SolidClassifier scl(theMesh->ShapeToMesh());
2365 // scl.Perform(myPoint, 1e-7);
2366 // TopAbs_State result = scl.State();
2367 // if ( result != TopAbs_IN )
2369 // std::vector<double> coords;
2370 // coords.push_back(x);
2371 // coords.push_back(y);
2372 // coords.push_back(z);
2373 // if (theEnforcedVertices.find(coords) != theEnforcedVertices.end())
2376 // double size = theNodeIDToSizeMap.find((*nodeIt)->GetID())->second;
2377 // // theGhs3dIdToNodeMap.insert( make_pair( nbNodes + i, (*nodeIt) ));
2378 // // MESSAGE("Adding enforced node (" << x << "," << y <<"," << z << ")");
2379 // // X Y Z PHY_SIZE DUMMY_INT
2385 // << dummyint << space;
2386 // theFile << std::endl;
2387 // theEnforcedNodeIdToGhs3dIdMap.insert( make_pair( (*nodeIt)->GetID(), aGhs3dID ));
2388 // enfVertexIndexSizeMap[aGhs3dID] = -1;
2391 // // MESSAGE("Enforced vertex (" << x << "," << y <<"," << z << ") is not inside the geometry: it was not added ");
2395 // if (nbEnforcedVertices) {
2396 // // Iterate over the enforced vertices
2397 // GHS3DPlugin_Hypothesis::TEnforcedVertexValues::const_iterator vertexIt;
2399 // for(vertexIt = theEnforcedVertices.begin() ; vertexIt != theEnforcedVertices.end() ; ++vertexIt) {
2400 // double x = vertexIt->first[0];
2401 // double y = vertexIt->first[1];
2402 // double z = vertexIt->first[2];
2403 // // Test if point is inside shape to mesh
2404 // gp_Pnt myPoint(x,y,z);
2405 // BRepClass3d_SolidClassifier scl(theMesh->ShapeToMesh());
2406 // scl.Perform(myPoint, 1e-7);
2407 // TopAbs_State result = scl.State();
2408 // if ( result != TopAbs_IN )
2410 // // MESSAGE("Adding enforced vertex (" << x << "," << y <<"," << z << ") = " << vertexIt->second);
2411 // // X Y Z PHY_SIZE DUMMY_INT
2416 // << vertexIt->second << space
2417 // << dummyint << space;
2418 // theFile << std::endl;
2419 // enfVertexIndexSizeMap[aGhs3dID] = vertexIt->second;
2423 // // MESSAGE("Enforced vertex (" << x << "," << y <<"," << z << ") is not inside the geometry: it was not added ");
2426 // theFile << std::endl;
2429 // // std::cout << std::endl;
2430 // // std::cout << "End writing in 'points' file." << std::endl;
2436 //=======================================================================
2437 //function : readResultFile
2439 //=======================================================================
2441 static bool readResultFile(const int fileOpen,
2443 const char* fileName,
2445 #ifdef WITH_SMESH_CANCEL_COMPUTE
2446 GHS3DPlugin_GHS3D* theAlgo,
2448 SMESH_MesherHelper& theHelper,
2449 // SMESH_Mesh& theMesh,
2450 TopoDS_Shape tabShape[],
2453 map <int,const SMDS_MeshNode*>& theGhs3dIdToNodeMap,
2455 int nbEnforcedVertices,
2456 int nbEnforcedNodes,
2457 TIDSortedElemSet & theEnforcedEdges,
2458 TIDSortedElemSet & theEnforcedTriangles,
2459 TIDSortedElemSet & theEnforcedQuadrangles)
2461 MESSAGE("GHS3DPlugin_GHS3D::readResultFile()");
2462 Kernel_Utils::Localizer loc;
2470 SMESHDS_Mesh* theMeshDS = theHelper.GetMeshDS();
2473 int nbElems, nbNodes, nbInputNodes;
2476 int ID, shapeID, ghs3dShapeID;
2479 nbShape ? theMeshDS->ShapeToIndex( tabShape[0] ) : theMeshDS->ShapeToIndex( theMeshDS->ShapeToMesh() );
2481 int *tab, *tabID, *nodeID, *nodeAssigne;
2483 const SMDS_MeshNode **node;
2486 nodeID = new int[4];
2487 coord = new double[3];
2488 node = new const SMDS_MeshNode*[4];
2490 TopoDS_Shape aSolid;
2491 SMDS_MeshNode * aNewNode;
2492 map <int,const SMDS_MeshNode*>::iterator itOnNode;
2493 SMDS_MeshElement* aTet;
2498 // Read the file state
2499 fileStat = fstat(fileOpen, &status);
2500 length = status.st_size;
2502 // Mapping the result file into memory
2504 HANDLE fd = CreateFile(fileName, GENERIC_READ, FILE_SHARE_READ,
2505 NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
2506 HANDLE hMapObject = CreateFileMapping(fd, NULL, PAGE_READONLY,
2507 0, (DWORD)length, NULL);
2508 ptr = ( char* ) MapViewOfFile(hMapObject, FILE_MAP_READ, 0, 0, 0 );
2510 ptr = (char *) mmap(0,length,PROT_READ,MAP_PRIVATE,fileOpen,0);
2514 ptr = readMapIntLine(ptr, tab);
2519 nbInputNodes = tab[2];
2521 nodeAssigne = new int[ nbNodes+1 ];
2524 aSolid = tabShape[0];
2526 // Reading the nodeId
2527 for (int i=0; i < 4*nbElems; i++)
2528 nodeId = strtol(ptr, &ptr, 10);
2530 MESSAGE("nbInputNodes: "<<nbInputNodes);
2531 MESSAGE("nbEnforcedVertices: "<<nbEnforcedVertices);
2532 // Reading the nodeCoor and update the nodeMap
2533 for (int iNode=1; iNode <= nbNodes; iNode++) {
2534 #ifdef WITH_SMESH_CANCEL_COMPUTE
2535 if(theAlgo->computeCanceled())
2538 for (int iCoor=0; iCoor < 3; iCoor++)
2539 coord[ iCoor ] = strtod(ptr, &ptr);
2540 nodeAssigne[ iNode ] = 1;
2541 if ( iNode > (nbInputNodes-(nbEnforcedVertices+nbEnforcedNodes)) ) {
2542 // Creating SMESH nodes
2543 // - for enforced vertices
2544 // - for vertices of forced edges
2545 // - for ghs3d nodes
2546 nodeAssigne[ iNode ] = 0;
2547 aNewNode = theMeshDS->AddNode( coord[0],coord[1],coord[2] );
2548 theGhs3dIdToNodeMap.insert(theGhs3dIdToNodeMap.end(), make_pair( iNode, aNewNode ));
2552 // Reading the number of triangles which corresponds to the number of sub-domains
2553 nbTriangle = strtol(ptr, &ptr, 10);
2555 tabID = new int[nbTriangle];
2556 for (int i=0; i < nbTriangle; i++) {
2557 #ifdef WITH_SMESH_CANCEL_COMPUTE
2558 if(theAlgo->computeCanceled())
2562 // find the solid corresponding to GHS3D sub-domain following
2563 // the technique proposed in GHS3D manual in chapter
2564 // "B.4 Subdomain (sub-region) assignment"
2565 int nodeId1 = strtol(ptr, &ptr, 10);
2566 int nodeId2 = strtol(ptr, &ptr, 10);
2567 int nodeId3 = strtol(ptr, &ptr, 10);
2568 if ( nbTriangle > 1 ) {
2569 const SMDS_MeshNode* n1 = theGhs3dIdToNodeMap[ nodeId1 ];
2570 const SMDS_MeshNode* n2 = theGhs3dIdToNodeMap[ nodeId2 ];
2571 const SMDS_MeshNode* n3 = theGhs3dIdToNodeMap[ nodeId3 ];
2574 // tabID[i] = findShapeID( theHelper, n1, n2, n3, toMeshHoles );
2575 tabID[i] = findShapeID( *theHelper.GetMesh(), n1, n2, n3, toMeshHoles );
2576 // -- 0020330: Pb with ghs3d as a submesh
2577 // check that found shape is to be meshed
2578 if ( tabID[i] > 0 ) {
2579 const TopoDS_Shape& foundShape = theMeshDS->IndexToShape( tabID[i] );
2580 bool isToBeMeshed = false;
2581 for ( int iS = 0; !isToBeMeshed && iS < nbShape; ++iS )
2582 isToBeMeshed = foundShape.IsSame( tabShape[ iS ]);
2583 if ( !isToBeMeshed )
2586 // END -- 0020330: Pb with ghs3d as a submesh
2588 std::cout << i+1 << " subdomain: findShapeID() returns " << tabID[i] << std::endl;
2591 catch ( Standard_Failure & ex)
2594 std::cout << i+1 << " subdomain: Exception caugt: " << ex.GetMessageString() << std::endl;
2599 std::cout << i+1 << " subdomain: unknown exception caught " << std::endl;
2607 if ( nbTriangle <= nbShape ) // no holes
2608 toMeshHoles = true; // not avoid creating tetras in holes
2610 // Associating the tetrahedrons to the shapes
2611 shapeID = compoundID;
2612 for (int iElem = 0; iElem < nbElems; iElem++) {
2613 #ifdef WITH_SMESH_CANCEL_COMPUTE
2614 if(theAlgo->computeCanceled())
2617 for (int iNode = 0; iNode < 4; iNode++) {
2618 ID = strtol(tetraPtr, &tetraPtr, 10);
2619 itOnNode = theGhs3dIdToNodeMap.find(ID);
2620 node[ iNode ] = itOnNode->second;
2621 nodeID[ iNode ] = ID;
2623 // We always run GHS3D with "to mesh holes"==TRUE but we must not create
2624 // tetras within holes depending on hypo option,
2625 // so we first check if aTet is inside a hole and then create it
2626 //aTet = theMeshDS->AddVolume( node[1], node[0], node[2], node[3] );
2627 if ( nbTriangle > 1 ) {
2628 shapeID = HOLE_ID; // negative shapeID means not to create tetras if !toMeshHoles
2629 ghs3dShapeID = strtol(shapePtr, &shapePtr, 10) - IdShapeRef;
2630 if ( tabID[ ghs3dShapeID ] == 0 ) {
2632 aSolid = findShape(node, aSolid, tabShape, tabBox, nbShape, &state);
2633 if ( toMeshHoles || state == TopAbs_IN )
2634 shapeID = theMeshDS->ShapeToIndex( aSolid );
2635 tabID[ ghs3dShapeID ] = shapeID;
2638 shapeID = tabID[ ghs3dShapeID ];
2640 else if ( nbShape > 1 ) {
2641 // Case where nbTriangle == 1 while nbShape == 2 encountered
2642 // with compound of 2 boxes and "To mesh holes"==False,
2643 // so there are no subdomains specified for each tetrahedron.
2644 // Try to guess a solid by a node already bound to shape
2646 for ( int i=0; i<4 && shapeID==0; i++ ) {
2647 if ( nodeAssigne[ nodeID[i] ] == 1 &&
2648 node[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE &&
2649 node[i]->getshapeId() > 1 )
2651 shapeID = node[i]->getshapeId();
2655 aSolid = findShape(node, aSolid, tabShape, tabBox, nbShape);
2656 shapeID = theMeshDS->ShapeToIndex( aSolid );
2659 // set new nodes and tetrahedron onto the shape
2660 for ( int i=0; i<4; i++ ) {
2661 if ( nodeAssigne[ nodeID[i] ] == 0 ) {
2662 if ( shapeID != HOLE_ID )
2663 theMeshDS->SetNodeInVolume( node[i], shapeID );
2664 nodeAssigne[ nodeID[i] ] = shapeID;
2667 if ( toMeshHoles || shapeID != HOLE_ID ) {
2668 aTet = theHelper.AddVolume( node[1], node[0], node[2], node[3],
2669 /*id=*/0, /*force3d=*/false);
2670 theMeshDS->SetMeshElementOnShape( aTet, shapeID );
2673 shapeIDs.insert( shapeID );
2676 // Remove nodes of tetras inside holes if !toMeshHoles
2677 if ( !toMeshHoles ) {
2678 itOnNode = theGhs3dIdToNodeMap.find( nbInputNodes );
2679 for ( ; itOnNode != theGhs3dIdToNodeMap.end(); ++itOnNode) {
2680 ID = itOnNode->first;
2681 if ( nodeAssigne[ ID ] == HOLE_ID )
2682 theMeshDS->RemoveFreeNode( itOnNode->second, 0 );
2687 cout << nbElems << " tetrahedrons have been associated to " << nbShape << " shapes" << endl;
2689 UnmapViewOfFile(mapPtr);
2690 CloseHandle(hMapObject);
2693 munmap(mapPtr, length);
2702 delete [] nodeAssigne;
2706 if ( shapeIDs.size() != nbShape ) {
2707 std::cout << "Only " << shapeIDs.size() << " solids of " << nbShape << " found" << std::endl;
2708 for (int i=0; i<nbShape; i++) {
2709 shapeID = theMeshDS->ShapeToIndex( tabShape[i] );
2710 if ( shapeIDs.find( shapeID ) == shapeIDs.end() )
2711 std::cout << " Solid #" << shapeID << " not found" << std::endl;
2720 //=============================================================================
2722 *Here we are going to use the GHS3D mesher with geometry
2724 //=============================================================================
2726 bool GHS3DPlugin_GHS3D::Compute(SMESH_Mesh& theMesh,
2727 const TopoDS_Shape& theShape)
2730 //SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
2732 // we count the number of shapes
2733 // _nbShape = countShape( meshDS, TopAbs_SOLID ); -- 0020330: Pb with ghs3d as a submesh
2735 TopExp_Explorer expBox ( theShape, TopAbs_SOLID );
2736 for ( ; expBox.More(); expBox.Next() )
2739 // create bounding box for every shape inside the compound
2742 TopoDS_Shape* tabShape;
2744 tabShape = new TopoDS_Shape[_nbShape];
2745 tabBox = new double*[_nbShape];
2746 for (int i=0; i<_nbShape; i++)
2747 tabBox[i] = new double[6];
2748 Standard_Real Xmin, Ymin, Zmin, Xmax, Ymax, Zmax;
2750 for (expBox.ReInit(); expBox.More(); expBox.Next()) {
2751 tabShape[iShape] = expBox.Current();
2752 Bnd_Box BoundingBox;
2753 BRepBndLib::Add(expBox.Current(), BoundingBox);
2754 BoundingBox.Get(Xmin, Ymin, Zmin, Xmax, Ymax, Zmax);
2755 tabBox[iShape][0] = Xmin; tabBox[iShape][1] = Xmax;
2756 tabBox[iShape][2] = Ymin; tabBox[iShape][3] = Ymax;
2757 tabBox[iShape][4] = Zmin; tabBox[iShape][5] = Zmax;
2761 // a unique working file name
2762 // to avoid access to the same files by eg different users
2763 TCollection_AsciiString aGenericName
2764 = (char*) GHS3DPlugin_Hypothesis::GetFileName(_hyp).c_str();
2766 TCollection_AsciiString aResultFileName;
2767 TCollection_AsciiString aLogFileName = aGenericName + ".log"; // log
2768 // #if GHS3D_VERSION < 42
2769 // TCollection_AsciiString aFacesFileName, aPointsFileName;
2770 // TCollection_AsciiString aBadResFileName, aBbResFileName;
2771 // aFacesFileName = aGenericName + ".faces"; // in faces
2772 // aPointsFileName = aGenericName + ".points"; // in points
2773 // aResultFileName = aGenericName + ".noboite";// out points and volumes
2774 // aBadResFileName = aGenericName + ".boite"; // out bad result
2775 // aBbResFileName = aGenericName + ".bb"; // out vertex stepsize
2777 // // -----------------
2778 // // make input files
2779 // // -----------------
2781 // ofstream aFacesFile ( aFacesFileName.ToCString() , ios::out);
2782 // ofstream aPointsFile ( aPointsFileName.ToCString() , ios::out);
2785 // aFacesFile.rdbuf()->is_open() && aPointsFile.rdbuf()->is_open();
2787 // INFOS( "Can't write into " << aFacesFileName);
2788 // return error(SMESH_Comment("Can't write into ") << aFacesFileName);
2791 TCollection_AsciiString aGMFFileName, aRequiredVerticesFileName, aSolFileName;
2792 TCollection_AsciiString aResultGMFFileName;
2795 aGMFFileName = aGenericName + ".mesh"; // GMF mesh file
2796 // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
2797 aResultGMFFileName = aGenericName + "Vol.mesh"; // GMF mesh file
2798 aResultFileName = aGenericName + ".noboite";// out points and volumes
2799 // aResultFileName = aGenericName + "Vol.mesh"; // GMF mesh file
2800 aRequiredVerticesFileName = aGenericName + "_required.mesh"; // GMF required vertices mesh file
2801 aSolFileName = aGenericName + "_required.sol"; // GMF solution file
2803 aGMFFileName = aGenericName + ".mesh"; // GMF mesh file
2804 // aGMFFileName = aGenericName + ".meshb"; // GMF mesh file
2805 // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
2806 aResultGMFFileName = aGenericName + "Vol.meshb"; // GMF mesh file
2807 aResultFileName = aGenericName + ".noboite";// out points and volumes
2808 // aResultFileName = aGenericName + "Vol.meshb"; // GMF mesh file
2809 aRequiredVerticesFileName = aGenericName + "_required.meshb"; // GMF required vertices mesh file
2810 aSolFileName = aGenericName + "_required.solb"; // GMF solution file
2812 map <int,int> aSmdsToGhs3dIdMap, anEnforcedNodeIdToGhs3dIdMap;
2813 map <int,const SMDS_MeshNode*> aGhs3dIdToNodeMap;
2814 std::map <int, int> nodeID2nodeIndexMap;
2815 GHS3DPlugin_Hypothesis::TEnforcedVertexValues enforcedVertices = GHS3DPlugin_Hypothesis::GetEnforcedVertices(_hyp);
2816 TIDSortedNodeSet enforcedNodes = GHS3DPlugin_Hypothesis::GetEnforcedNodes(_hyp);
2817 TIDSortedElemSet enforcedEdges = GHS3DPlugin_Hypothesis::GetEnforcedEdges(_hyp);
2818 TIDSortedElemSet enforcedTriangles = GHS3DPlugin_Hypothesis::GetEnforcedTriangles(_hyp);
2819 TIDSortedElemSet enforcedQuadrangles = GHS3DPlugin_Hypothesis::GetEnforcedQuadrangles(_hyp);
2820 GHS3DPlugin_Hypothesis::TID2SizeMap nodeIDToSizeMap = GHS3DPlugin_Hypothesis::GetNodeIDToSizeMap(_hyp);
2821 // GHS3DPlugin_Hypothesis::TID2SizeMap elemIDToSizeMap = GHS3DPlugin_Hypothesis::GetElementIDToSizeMap(_hyp);
2823 int nbEnforcedVertices = enforcedVertices.size();
2824 int nbEnforcedNodes = enforcedNodes.size();
2826 SMESH_MesherHelper helper( theMesh );
2827 helper.SetSubShape( theShape );
2830 SMESH_ProxyMesh::Ptr proxyMesh( new SMESH_ProxyMesh( theMesh ));
2832 // make prisms on quadrangles
2833 if ( theMesh.NbQuadrangles() > 0 )
2835 vector<SMESH_ProxyMesh::Ptr> components;
2836 for (expBox.ReInit(); expBox.More(); expBox.Next())
2838 if ( _viscousLayersHyp )
2840 proxyMesh = _viscousLayersHyp->Compute( theMesh, expBox.Current() );
2844 StdMeshers_QuadToTriaAdaptor* q2t = new StdMeshers_QuadToTriaAdaptor;
2845 q2t->Compute( theMesh, expBox.Current(), proxyMesh.get() );
2846 components.push_back( SMESH_ProxyMesh::Ptr( q2t ));
2848 proxyMesh.reset( new SMESH_ProxyMesh( components ));
2850 // build viscous layers
2851 else if ( _viscousLayersHyp )
2853 proxyMesh = _viscousLayersHyp->Compute( theMesh, theShape );
2857 // #if GHS3D_VERSION < 42
2858 // Ok = (writePoints( aPointsFile, helper,
2859 // aSmdsToGhs3dIdMap, anEnforcedNodeIdToGhs3dIdMap, aGhs3dIdToNodeMap,
2861 // enforcedVertices, enforcedNodes)
2863 // writeFaces ( aFacesFile, *proxyMesh, theShape,
2864 // aSmdsToGhs3dIdMap, anEnforcedNodeIdToGhs3dIdMap,
2865 // enforcedEdges, enforcedTriangles, enforcedQuadrangles));
2867 Ok = writeGMFFile(aGMFFileName.ToCString(), aRequiredVerticesFileName.ToCString(), aSolFileName.ToCString(),
2869 aSmdsToGhs3dIdMap, aGhs3dIdToNodeMap,
2870 enforcedNodes, enforcedEdges, enforcedTriangles, enforcedQuadrangles,
2875 // Write aSmdsToGhs3dIdMap to temp file
2876 TCollection_AsciiString aSmdsToGhs3dIdMapFileName;
2877 aSmdsToGhs3dIdMapFileName = aGenericName + ".ids"; // ids relation
2878 ofstream aIdsFile ( aSmdsToGhs3dIdMapFileName.ToCString() , ios::out);
2879 Ok = aIdsFile.rdbuf()->is_open();
2881 INFOS( "Can't write into " << aSmdsToGhs3dIdMapFileName);
2882 return error(SMESH_Comment("Can't write into ") << aSmdsToGhs3dIdMapFileName);
2884 aIdsFile << "Smds Ghs3d" << std::endl;
2885 map <int,int>::const_iterator myit;
2886 for (myit=aSmdsToGhs3dIdMap.begin() ; myit != aSmdsToGhs3dIdMap.end() ; ++myit) {
2887 aIdsFile << myit->first << " " << myit->second << std::endl;
2891 // #if GHS3D_VERSION < 42
2892 // aFacesFile.close();
2893 // aPointsFile.close();
2897 if ( !_keepFiles ) {
2898 // #if GHS3D_VERSION < 42
2899 // removeFile( aFacesFileName );
2900 // removeFile( aPointsFileName );
2902 removeFile( aGMFFileName );
2903 removeFile( aRequiredVerticesFileName );
2904 removeFile( aSolFileName );
2906 removeFile( aSmdsToGhs3dIdMapFileName );
2908 return error(COMPERR_BAD_INPUT_MESH);
2910 removeFile( aResultFileName ); // needed for boundary recovery module usage
2912 // -----------------
2914 // -----------------
2916 TCollection_AsciiString cmd = TCollection_AsciiString((char*)GHS3DPlugin_Hypothesis::CommandToRun( _hyp ).c_str() );
2917 // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
2918 cmd += TCollection_AsciiString(" -f ") + aGenericName; // file to read
2919 cmd += TCollection_AsciiString(" -IM ");
2920 // cmd += TCollection_AsciiString(" --in ") + aGenericName;
2921 // cmd += TCollection_AsciiString(" --required_vertices ") + aRequiredVerticesFileName;
2922 // cmd += TCollection_AsciiString(" --out ") + aGenericName;
2923 cmd += TCollection_AsciiString(" -Om 1>" ) + aLogFileName; // dump into file
2925 std::cout << std::endl;
2926 std::cout << "Ghs3d execution..." << std::endl;
2927 std::cout << cmd << std::endl;
2929 #ifdef WITH_SMESH_CANCEL_COMPUTE
2930 _compute_canceled = false;
2933 system( cmd.ToCString() ); // run
2935 std::cout << std::endl;
2936 std::cout << "End of Ghs3d execution !" << std::endl;
2942 // #if GHS3D_VERSION < 42
2943 // Mapping the result file
2946 fileOpen = open( aResultFileName.ToCString(), O_RDONLY);
2947 if ( fileOpen < 0 ) {
2948 std::cout << std::endl;
2949 std::cout << "Can't open the " << aResultFileName.ToCString() << " GHS3D output file" << std::endl;
2950 std::cout << "Log: " << aLogFileName << std::endl;
2955 _hyp ? _hyp->GetToMeshHoles(true) : GHS3DPlugin_Hypothesis::DefaultMeshHoles();
2957 helper.IsQuadraticSubMesh( theShape );
2958 helper.SetElementsOnShape( false );
2960 Ok = readResultFile( fileOpen,
2962 aResultFileName.ToCString(),
2964 #ifdef WITH_SMESH_CANCEL_COMPUTE
2967 /*theMesh, */helper, tabShape, tabBox, _nbShape, aGhs3dIdToNodeMap,
2969 nbEnforcedVertices, nbEnforcedNodes,
2970 enforcedEdges, enforcedTriangles, enforcedQuadrangles );
2973 // #ifndef GMF_HAS_SUBDOMAIN_INFO
2974 // // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
2976 // int fileOpen = open( aResultFileName.ToCString(), O_RDONLY);
2977 // if ( fileOpen < 0 ) {
2978 // std::cout << std::endl;
2979 // std::cout << "Can't open the " << aResultFileName.ToCString() << " GHS3D output file" << std::endl;
2980 // std::cout << "Log: " << aLogFileName << std::endl;
2985 // Ok = readGMFFile(
2986 // #ifndef GMF_HAS_SUBDOMAIN_INFO
2989 // aGenericName.ToCString(), theMesh,
2990 // _nbShape, tabShape, tabBox,
2991 // aGhs3dIdToNodeMap, toMeshHoles,
2992 // nbEnforcedVertices, nbEnforcedNodes,
2993 // enforcedNodes, enforcedTriangles, enforcedQuadrangles);
2994 // #ifndef GMF_HAS_SUBDOMAIN_INFO
2999 // ---------------------
3000 // remove working files
3001 // ---------------------
3006 removeFile( aLogFileName );
3008 else if ( OSD_File( aLogFileName ).Size() > 0 )
3010 // get problem description from the log file
3011 _Ghs2smdsConvertor conv( aGhs3dIdToNodeMap );
3012 storeErrorDescription( aLogFileName, conv );
3016 // the log file is empty
3017 removeFile( aLogFileName );
3018 INFOS( "GHS3D Error, command '" << cmd.ToCString() << "' failed" );
3019 error(COMPERR_ALGO_FAILED, "ghs3d: command not found" );
3022 if ( !_keepFiles ) {
3023 // #if GHS3D_VERSION < 42
3024 // removeFile( aFacesFileName );
3025 // removeFile( aPointsFileName );
3026 // removeFile( aResultFileName );
3027 // removeFile( aBadResFileName );
3028 // removeFile( aBbResFileName );
3030 removeFile( aSmdsToGhs3dIdMapFileName );
3031 // The output .mesh file does not contain yet the subdomain-info (Ghs3D 4.2)
3033 #ifdef WITH_SMESH_CANCEL_COMPUTE
3035 if(_compute_canceled)
3036 removeFile( aLogFileName );
3039 std::cout << "<" << aResultFileName.ToCString() << "> GHS3D output file ";
3041 std::cout << "not ";
3042 std::cout << "treated !" << std::endl;
3043 std::cout << std::endl;
3045 _nbShape = 0; // re-initializing _nbShape for the next Compute() method call
3052 //=============================================================================
3054 *Here we are going to use the GHS3D mesher w/o geometry
3056 //=============================================================================
3057 bool GHS3DPlugin_GHS3D::Compute(SMESH_Mesh& theMesh,
3058 SMESH_MesherHelper* theHelper)
3060 MESSAGE("GHS3DPlugin_GHS3D::Compute()");
3062 //SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
3063 TopoDS_Shape theShape = theHelper->GetSubShape();
3065 // a unique working file name
3066 // to avoid access to the same files by eg different users
3067 TCollection_AsciiString aGenericName
3068 = (char*) GHS3DPlugin_Hypothesis::GetFileName(_hyp).c_str();
3070 TCollection_AsciiString aLogFileName = aGenericName + ".log"; // log
3071 TCollection_AsciiString aResultFileName;
3073 // #if GHS3D_VERSION < 42
3074 // TCollection_AsciiString aFacesFileName, aPointsFileName;
3075 // TCollection_AsciiString aBadResFileName, aBbResFileName;
3076 // aFacesFileName = aGenericName + ".faces"; // in faces
3077 // aPointsFileName = aGenericName + ".points"; // in points
3078 // aResultFileName = aGenericName + ".noboite";// out points and volumes
3079 // aBadResFileName = aGenericName + ".boite"; // out bad result
3080 // aBbResFileName = aGenericName + ".bb"; // out vertex stepsize
3082 // // -----------------
3083 // // make input files
3084 // // -----------------
3086 // ofstream aFacesFile ( aFacesFileName.ToCString() , ios::out);
3087 // ofstream aPointsFile ( aPointsFileName.ToCString() , ios::out);
3088 // Ok = aFacesFile.rdbuf()->is_open() && aPointsFile.rdbuf()->is_open();
3090 // INFOS( "Can't write into " << aFacesFileName);
3091 // return error( SMESH_Comment("Can't write into ") << aFacesFileName);
3094 TCollection_AsciiString aGMFFileName, aRequiredVerticesFileName, aSolFileName;
3096 aGMFFileName = aGenericName + ".mesh"; // GMF mesh file
3097 aResultFileName = aGenericName + "Vol.mesh"; // GMF mesh file
3098 aRequiredVerticesFileName = aGenericName + "_required.mesh"; // GMF required vertices mesh file
3099 aSolFileName = aGenericName + "_required.sol"; // GMF solution file
3101 aGMFFileName = aGenericName + ".meshb"; // GMF mesh file
3102 aResultFileName = aGenericName + "Vol.meshb"; // GMF mesh file
3103 aRequiredVerticesFileName = aGenericName + "_required.meshb"; // GMF required vertices mesh file
3104 aSolFileName = aGenericName + ".solb"; // GMF solution file
3108 std::map <int, int> nodeID2nodeIndexMap;
3109 GHS3DPlugin_Hypothesis::TEnforcedVertexValues enforcedVertices = GHS3DPlugin_Hypothesis::GetEnforcedVertices(_hyp);
3110 TIDSortedNodeSet enforcedNodes = GHS3DPlugin_Hypothesis::GetEnforcedNodes(_hyp);
3111 TIDSortedElemSet enforcedEdges = GHS3DPlugin_Hypothesis::GetEnforcedEdges(_hyp);
3112 TIDSortedElemSet enforcedTriangles = GHS3DPlugin_Hypothesis::GetEnforcedTriangles(_hyp);
3113 TIDSortedElemSet enforcedQuadrangles = GHS3DPlugin_Hypothesis::GetEnforcedQuadrangles(_hyp);
3114 GHS3DPlugin_Hypothesis::TID2SizeMap nodeIDToSizeMap = GHS3DPlugin_Hypothesis::GetNodeIDToSizeMap(_hyp);
3116 vector <const SMDS_MeshNode*> aNodeByGhs3dId, anEnforcedNodeByGhs3dId;
3118 SMESH_ProxyMesh::Ptr proxyMesh( new SMESH_ProxyMesh( theMesh ));
3119 if ( theMesh.NbQuadrangles() > 0 )
3121 StdMeshers_QuadToTriaAdaptor* aQuad2Trias = new StdMeshers_QuadToTriaAdaptor;
3122 aQuad2Trias->Compute( theMesh );
3123 proxyMesh.reset( aQuad2Trias );
3125 // #if GHS3D_VERSION < 42
3126 // Ok = (writeFaces ( aFacesFile, *proxyMesh, &theMesh, aNodeByGhs3dId, anEnforcedNodeByGhs3dId,
3127 // enforcedEdges, enforcedTriangles, enforcedQuadrangles ) &&
3128 // writePoints( aPointsFile, &theMesh, aNodeByGhs3dId, anEnforcedNodeByGhs3dId,
3129 // nodeIDToSizeMap, enforcedVertices, enforcedNodes));
3130 // int nbEnforcedVertices = enforcedVertices.size();
3131 // int nbEnforcedNodes = enforcedNodes.size();
3133 Ok = writeGMFFile(aGMFFileName.ToCString(), aRequiredVerticesFileName.ToCString(), aSolFileName.ToCString(),
3134 *proxyMesh, &theMesh,
3135 aNodeByGhs3dId, anEnforcedNodeByGhs3dId,
3136 enforcedNodes, enforcedEdges, enforcedTriangles, enforcedQuadrangles,
3141 TIDSortedNodeSet enforcedNodesFromEnforcedElem;
3142 for (int i=0;i<anEnforcedNodeByGhs3dId.size();i++)
3143 enforcedNodesFromEnforcedElem.insert(anEnforcedNodeByGhs3dId[i]);
3145 // #if GHS3D_VERSION < 42
3146 // aFacesFile.close();
3147 // aPointsFile.close();
3150 // if ( !_keepFiles ) {
3151 // removeFile( aFacesFileName );
3152 // removeFile( aPointsFileName );
3154 // return error(COMPERR_BAD_INPUT_MESH);
3156 // removeFile( aResultFileName ); // needed for boundary recovery module usage
3159 // -----------------
3161 // -----------------
3163 TCollection_AsciiString cmd = TCollection_AsciiString((char*)GHS3DPlugin_Hypothesis::CommandToRun( _hyp, false ).c_str());
3164 // #if GHS3D_VERSION < 42
3165 // cmd += TCollection_AsciiString(" -f ") + aGenericName; // file to read
3167 cmd += TCollection_AsciiString(" --in ") + aGenericName;
3168 // cmd += TCollection_AsciiString(" --required_vertices ") + aRequiredVerticesFileName;
3169 cmd += TCollection_AsciiString(" --out ") + aResultFileName;
3171 cmd += TCollection_AsciiString(" 1>" ) + aLogFileName; // dump into file
3173 std::cout << std::endl;
3174 std::cout << "Ghs3d execution..." << std::endl;
3175 std::cout << cmd << std::endl;
3177 #ifdef WITH_SMESH_CANCEL_COMPUTE
3178 _compute_canceled = false;
3181 system( cmd.ToCString() ); // run
3183 std::cout << std::endl;
3184 std::cout << "End of Ghs3d execution !" << std::endl;
3189 // #if GHS3D_VERSION < 42
3190 // int fileOpen = open( aResultFileName.ToCString(), O_RDONLY);
3191 // if ( fileOpen < 0 ) {
3192 // std::cout << std::endl;
3193 // std::cout << "Error when opening the " << aResultFileName.ToCString() << " file" << std::endl;
3194 // std::cout << "Log: " << aLogFileName << std::endl;
3195 // std::cout << std::endl;
3199 // Ok = readResultFile( fileOpen,
3201 // aResultFileName.ToCString(),
3203 // #ifdef WITH_SMESH_CANCEL_COMPUTE
3206 // theMesh, theShape ,aNodeByGhs3dId, anEnforcedNodeByGhs3dId,
3207 // nbEnforcedVertices, nbEnforcedNodes,
3208 // enforcedEdges, enforcedTriangles, enforcedQuadrangles );
3211 Ok = readGMFFile(aResultFileName.ToCString(),
3212 #ifdef WITH_SMESH_CANCEL_COMPUTE
3216 enforcedNodesFromEnforcedElem, enforcedTriangles, enforcedQuadrangles);
3219 // ---------------------
3220 // remove working files
3221 // ---------------------
3226 removeFile( aLogFileName );
3228 else if ( OSD_File( aLogFileName ).Size() > 0 )
3230 // get problem description from the log file
3231 _Ghs2smdsConvertor conv( aNodeByGhs3dId );
3232 storeErrorDescription( aLogFileName, conv );
3235 // the log file is empty
3236 removeFile( aLogFileName );
3237 INFOS( "GHS3D Error, command '" << cmd.ToCString() << "' failed" );
3238 error(COMPERR_ALGO_FAILED, "ghs3d: command not found" );
3240 // #if GHS3D_VERSION < 42
3243 #ifdef WITH_SMESH_CANCEL_COMPUTE
3245 if(_compute_canceled)
3246 removeFile( aLogFileName );
3248 // removeFile( aFacesFileName );
3249 // removeFile( aPointsFileName );
3250 // removeFile( aResultFileName );
3251 // removeFile( aBadResFileName );
3252 // removeFile( aBbResFileName );
3258 #ifdef WITH_SMESH_CANCEL_COMPUTE
3259 void GHS3DPlugin_GHS3D::CancelCompute()
3261 _compute_canceled = true;
3264 TCollection_AsciiString aGenericName
3265 = (char*) GHS3DPlugin_Hypothesis::GetFileName(_hyp).c_str();
3266 TCollection_AsciiString cmd =
3267 TCollection_AsciiString("ps ux | grep ") + aGenericName;
3268 cmd += TCollection_AsciiString(" | grep -v grep | awk '{print $2}' | xargs kill -9 > /dev/null 2>&1");
3269 system( cmd.ToCString() );
3274 //================================================================================
3276 * \brief Provide human readable text by error code reported by ghs3d
3278 //================================================================================
3280 static string translateError(const int errNum)
3284 return "The surface mesh includes a face of type other than edge, "
3285 "triangle or quadrilateral. This face type is not supported.";
3287 return "Not enough memory for the face table.";
3289 return "Not enough memory.";
3291 return "Not enough memory.";
3293 return "Face is ignored.";
3295 return "End of file. Some data are missing in the file.";
3297 return "Read error on the file. There are wrong data in the file.";
3299 return "the metric file is inadequate (dimension other than 3).";
3301 return "the metric file is inadequate (values not per vertices).";
3303 return "the metric file contains more than one field.";
3305 return "the number of values in the \".bb\" (metric file) is incompatible with the expected"
3306 "value of number of mesh vertices in the \".noboite\" file.";
3308 return "Too many sub-domains.";
3310 return "the number of vertices is negative or null.";
3312 return "the number of faces is negative or null.";
3314 return "A face has a null vertex.";
3316 return "incompatible data.";
3318 return "the number of vertices is negative or null.";
3320 return "the number of vertices is negative or null (in the \".mesh\" file).";
3322 return "the number of faces is negative or null.";
3324 return "A face appears more than once in the input surface mesh.";
3326 return "An edge appears more than once in the input surface mesh.";
3328 return "A face has a vertex negative or null.";
3330 return "NOT ENOUGH MEMORY.";
3332 return "Not enough available memory.";
3334 return "Some initial points cannot be inserted. The surface mesh is probably very bad "
3335 "in terms of quality or the input list of points is wrong.";
3337 return "Some vertices are too close to one another or coincident.";
3339 return "Some vertices are too close to one another or coincident.";
3341 return "A vertex cannot be inserted.";
3343 return "There are at least two points considered as coincident.";
3345 return "Some vertices are too close to one another or coincident.";
3347 return "The surface mesh regeneration step has failed.";
3349 return "Constrained edge cannot be enforced.";
3351 return "Constrained face cannot be enforced.";
3353 return "Missing faces.";
3355 return "No guess to start the definition of the connected component(s).";
3357 return "The surface mesh includes at least one hole. The domain is not well defined.";
3359 return "Impossible to define a component.";
3361 return "The surface edge intersects another surface edge.";
3363 return "The surface edge intersects the surface face.";
3365 return "One boundary point lies within a surface face.";
3367 return "One surface edge intersects a surface face.";
3369 return "One boundary point lies within a surface edge.";
3371 return "Insufficient memory ressources detected due to a bad quality surface mesh leading "
3372 "to too many swaps.";
3374 return "Edge is unique (i.e., bounds a hole in the surface).";
3376 return "Presumably, the surface mesh is not compatible with the domain being processed.";
3378 return "Too many components, too many sub-domain.";
3380 return "The surface mesh includes at least one hole. "
3381 "Therefore there is no domain properly defined.";
3383 return "Statistics.";
3385 return "Statistics.";
3387 return "Warning, it is dramatically tedious to enforce the boundary items.";
3389 return "Not enough memory at this time, nevertheless, the program continues. "
3390 "The expected mesh will be correct but not really as large as required.";
3392 return "see above error code, resulting quality may be poor.";
3394 return "Not enough memory at this time, nevertheless, the program continues (warning).";
3396 return "Unknown face type.";
3399 return "End of file. Some data are missing in the file.";
3401 return "A too small volume element is detected.";
3403 return "There exists at least a null or negative volume element.";
3405 return "There exist null or negative volume elements.";
3407 return "A too small volume element is detected. A face is considered being degenerated.";
3409 return "Some element is suspected to be very bad shaped or wrong.";
3411 return "A too bad quality face is detected. This face is considered degenerated.";
3413 return "A too bad quality face is detected. This face is degenerated.";
3415 return "Presumably, the surface mesh is not compatible with the domain being processed.";
3417 return "Abnormal error occured, contact hotline.";
3419 return "Not enough memory for the face table.";
3421 return "The algorithm cannot run further. "
3422 "The surface mesh is probably very bad in terms of quality.";
3424 return "Bad vertex number.";
3429 //================================================================================
3431 * \brief Retrieve from a string given number of integers
3433 //================================================================================
3435 static char* getIds( char* ptr, int nbIds, vector<int>& ids )
3438 ids.reserve( nbIds );
3441 while ( !isdigit( *ptr )) ++ptr;
3442 if ( ptr[-1] == '-' ) --ptr;
3443 ids.push_back( strtol( ptr, &ptr, 10 ));
3449 //================================================================================
3451 * \brief Retrieve problem description form a log file
3452 * \retval bool - always false
3454 //================================================================================
3456 bool GHS3DPlugin_GHS3D::storeErrorDescription(const TCollection_AsciiString& logFile,
3457 const _Ghs2smdsConvertor & toSmdsConvertor )
3459 #ifdef WITH_SMESH_CANCEL_COMPUTE
3460 if(_compute_canceled)
3461 return error(SMESH_Comment("interruption initiated by user"));
3465 int file = ::_open (logFile.ToCString(), _O_RDONLY|_O_BINARY);
3467 int file = ::open (logFile.ToCString(), O_RDONLY);
3470 return error( SMESH_Comment("See ") << logFile << " for problem description");
3473 // struct stat status;
3474 // fstat(file, &status);
3475 // size_t length = status.st_size;
3476 off_t length = lseek( file, 0, SEEK_END);
3477 lseek( file, 0, SEEK_SET);
3480 vector< char > buf( length );
3481 int nBytesRead = ::read (file, & buf[0], length);
3483 char* ptr = & buf[0];
3484 char* bufEnd = ptr + nBytesRead;
3486 SMESH_Comment errDescription;
3488 enum { NODE = 1, EDGE, TRIA, VOL, ID = 1 };
3490 // look for errors "ERR #"
3492 set<string> foundErrorStr; // to avoid reporting same error several times
3493 set<int> elemErrorNums; // not to report different types of errors with bad elements
3494 while ( ++ptr < bufEnd )
3496 if ( strncmp( ptr, "ERR ", 4 ) != 0 )
3499 list<const SMDS_MeshElement*> badElems;
3500 vector<int> nodeIds;
3504 int errNum = strtol(ptr, &ptr, 10);
3505 switch ( errNum ) { // we treat errors enumerated in [SALOME platform 0019316] issue
3507 // The face number (numfac) with vertices (f 1, f 2, f 3) has a null vertex.
3508 ptr = getIds(ptr, NODE, nodeIds);
3509 ptr = getIds(ptr, TRIA, nodeIds);
3510 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3512 case 1000: // ERR 1000 : 1 3 2
3513 // Face (f 1, f 2, f 3) appears more than once in the input surface mesh.
3514 ptr = getIds(ptr, TRIA, nodeIds);
3515 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3518 // Edge (e1, e2) appears more than once in the input surface mesh
3519 ptr = getIds(ptr, EDGE, nodeIds);
3520 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3523 // Face (f 1, f 2, f 3) has a vertex negative or null
3524 ptr = getIds(ptr, TRIA, nodeIds);
3525 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3528 // Vertex v1 and vertex v2 are too close to one another or coincident (warning).
3529 ptr = getIds(ptr, NODE, nodeIds);
3530 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3531 ptr = getIds(ptr, NODE, nodeIds);
3532 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3535 // Vertex v1 cannot be inserted (warning).
3536 ptr = getIds(ptr, NODE, nodeIds);
3537 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3540 // There are at least two points whose distance is dist, i.e., considered as coincident
3541 case 2103: // ERR 2103 : 16 WITH 3
3542 // Vertex v1 and vertex v2 are too close to one another or coincident (warning).
3543 ptr = getIds(ptr, NODE, nodeIds);
3544 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3545 ptr = getIds(ptr, NODE, nodeIds);
3546 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3549 // Constrained edge (e1, e2) cannot be enforced (warning).
3550 ptr = getIds(ptr, EDGE, nodeIds);
3551 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3554 // Constrained face (f 1, f 2, f 3) cannot be enforced
3555 ptr = getIds(ptr, TRIA, nodeIds);
3556 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3558 case 3103: // ERR 3103 : 1 2 WITH 7 3
3559 // The surface edge (e1, e2) intersects another surface edge (e3, e4)
3560 ptr = getIds(ptr, EDGE, nodeIds);
3561 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3562 ptr = getIds(ptr, EDGE, nodeIds);
3563 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3565 case 3104: // ERR 3104 : 9 10 WITH 1 2 3
3566 // The surface edge (e1, e2) intersects the surface face (f 1, f 2, f 3)
3567 ptr = getIds(ptr, EDGE, nodeIds);
3568 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3569 ptr = getIds(ptr, TRIA, nodeIds);
3570 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3572 case 3105: // ERR 3105 : 8 IN 2 3 5
3573 // One boundary point (say p1) lies within a surface face (f 1, f 2, f 3)
3574 ptr = getIds(ptr, NODE, nodeIds);
3575 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3576 ptr = getIds(ptr, TRIA, nodeIds);
3577 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3580 // One surface edge (say e1, e2) intersects a surface face (f 1, f 2, f 3)
3581 ptr = getIds(ptr, EDGE, nodeIds);
3582 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3583 ptr = getIds(ptr, TRIA, nodeIds);
3584 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3586 case 3107: // ERR 3107 : 2 IN 4 1
3587 // One boundary point (say p1) lies within a surface edge (e1, e2) (stop).
3588 ptr = getIds(ptr, NODE, nodeIds);
3589 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3590 ptr = getIds(ptr, EDGE, nodeIds);
3591 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3593 case 3109: // ERR 3109 : EDGE 5 6 UNIQUE
3594 // Edge (e1, e2) is unique (i.e., bounds a hole in the surface)
3595 ptr = getIds(ptr, EDGE, nodeIds);
3596 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3598 case 9000: // ERR 9000
3599 // ELEMENT 261 WITH VERTICES : 7 396 -8 242
3600 // VOLUME : -1.11325045E+11 W.R.T. EPSILON 0.
3601 // A too small volume element is detected. Are reported the index of the element,
3602 // its four vertex indices, its volume and the tolerance threshold value
3603 ptr = getIds(ptr, ID, nodeIds);
3604 ptr = getIds(ptr, VOL, nodeIds);
3605 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3606 // even if all nodes found, volume it most probably invisible,
3607 // add its faces to demenstrate it anyhow
3609 vector<int> faceNodes( nodeIds.begin(), --nodeIds.end() ); // 012
3610 badElems.push_back( toSmdsConvertor.getElement(faceNodes));
3611 faceNodes[2] = nodeIds[3]; // 013
3612 badElems.push_back( toSmdsConvertor.getElement(faceNodes));
3613 faceNodes[1] = nodeIds[2]; // 023
3614 badElems.push_back( toSmdsConvertor.getElement(faceNodes));
3615 faceNodes[0] = nodeIds[1]; // 123
3616 badElems.push_back( toSmdsConvertor.getElement(faceNodes));
3619 case 9001: // ERR 9001
3620 // %% NUMBER OF NEGATIVE VOLUME TETS : 1
3621 // %% THE LARGEST NEGATIVE TET : 1.75376581E+11
3622 // %% NUMBER OF NULL VOLUME TETS : 0
3623 // There exists at least a null or negative volume element
3626 // There exist n null or negative volume elements
3629 // A too small volume element is detected
3632 // A too bad quality face is detected. This face is considered degenerated,
3633 // its index, its three vertex indices together with its quality value are reported
3634 break; // same as next
3635 case 9112: // ERR 9112
3636 // FACE 2 WITH VERTICES : 4 2 5
3637 // SMALL INRADIUS : 0.
3638 // A too bad quality face is detected. This face is degenerated,
3639 // its index, its three vertex indices together with its inradius are reported
3640 ptr = getIds(ptr, ID, nodeIds);
3641 ptr = getIds(ptr, TRIA, nodeIds);
3642 badElems.push_back( toSmdsConvertor.getElement(nodeIds));
3643 // add triangle edges as it most probably has zero area and hence invisible
3645 vector<int> edgeNodes(2);
3646 edgeNodes[0] = nodeIds[0]; edgeNodes[1] = nodeIds[1]; // 0-1
3647 badElems.push_back( toSmdsConvertor.getElement(edgeNodes));
3648 edgeNodes[1] = nodeIds[2]; // 0-2
3649 badElems.push_back( toSmdsConvertor.getElement(edgeNodes));
3650 edgeNodes[0] = nodeIds[1]; // 1-2
3651 badElems.push_back( toSmdsConvertor.getElement(edgeNodes));
3656 bool isNewError = foundErrorStr.insert( string( errBeg, ptr )).second;
3658 continue; // not to report same error several times
3660 // const SMDS_MeshElement* nullElem = 0;
3661 // bool allElemsOk = ( find( badElems.begin(), badElems.end(), nullElem) == badElems.end());
3663 // if ( allElemsOk && !badElems.empty() && !elemErrorNums.empty() ) {
3664 // bool oneMoreErrorType = elemErrorNums.insert( errNum ).second;
3665 // if ( oneMoreErrorType )
3666 // continue; // not to report different types of errors with bad elements
3669 // store bad elements
3670 //if ( allElemsOk ) {
3671 list<const SMDS_MeshElement*>::iterator elem = badElems.begin();
3672 for ( ; elem != badElems.end(); ++elem )
3673 addBadInputElement( *elem );
3677 string text = translateError( errNum );
3678 if ( errDescription.find( text ) == text.npos ) {
3679 if ( !errDescription.empty() )
3680 errDescription << "\n";
3681 errDescription << text;
3686 if ( errDescription.empty() ) { // no errors found
3687 char msg[] = "connection to server failed";
3688 if ( search( &buf[0], bufEnd, msg, msg + strlen(msg)) != bufEnd )
3689 errDescription << "Licence problems.";
3692 char msg2[] = "SEGMENTATION FAULT";
3693 if ( search( &buf[0], bufEnd, msg2, msg2 + strlen(msg2)) != bufEnd )
3694 errDescription << "ghs3d: SEGMENTATION FAULT. ";
3698 if ( errDescription.empty() )
3699 errDescription << "See " << logFile << " for problem description";
3701 errDescription << "\nSee " << logFile << " for more information";
3703 return error( errDescription );
3706 //================================================================================
3708 * \brief Creates _Ghs2smdsConvertor
3710 //================================================================================
3712 _Ghs2smdsConvertor::_Ghs2smdsConvertor( const map <int,const SMDS_MeshNode*> & ghs2NodeMap)
3713 :_ghs2NodeMap( & ghs2NodeMap ), _nodeByGhsId( 0 )
3717 //================================================================================
3719 * \brief Creates _Ghs2smdsConvertor
3721 //================================================================================
3723 _Ghs2smdsConvertor::_Ghs2smdsConvertor( const vector <const SMDS_MeshNode*> & nodeByGhsId)
3724 : _ghs2NodeMap( 0 ), _nodeByGhsId( &nodeByGhsId )
3728 //================================================================================
3730 * \brief Return SMDS element by ids of GHS3D nodes
3732 //================================================================================
3734 const SMDS_MeshElement* _Ghs2smdsConvertor::getElement(const vector<int>& ghsNodes) const
3736 size_t nbNodes = ghsNodes.size();
3737 vector<const SMDS_MeshNode*> nodes( nbNodes, 0 );
3738 for ( size_t i = 0; i < nbNodes; ++i ) {
3739 int ghsNode = ghsNodes[ i ];
3740 if ( _ghs2NodeMap ) {
3741 map <int,const SMDS_MeshNode*>::const_iterator in = _ghs2NodeMap->find( ghsNode);
3742 if ( in == _ghs2NodeMap->end() )
3744 nodes[ i ] = in->second;
3747 if ( ghsNode < 1 || ghsNode > _nodeByGhsId->size() )
3749 nodes[ i ] = (*_nodeByGhsId)[ ghsNode-1 ];
3755 if ( nbNodes == 2 ) {
3756 const SMDS_MeshElement* edge= SMDS_Mesh::FindEdge( nodes[0], nodes[1] );
3758 edge = new SMDS_LinearEdge( nodes[0], nodes[1] );
3761 if ( nbNodes == 3 ) {
3762 const SMDS_MeshElement* face = SMDS_Mesh::FindFace( nodes );
3764 face = new SMDS_FaceOfNodes( nodes[0], nodes[1], nodes[2] );
3768 return new SMDS_VolumeOfNodes( nodes[0], nodes[1], nodes[2], nodes[3] );
3774 //=============================================================================
3778 //=============================================================================
3779 bool GHS3DPlugin_GHS3D::Evaluate(SMESH_Mesh& aMesh,
3780 const TopoDS_Shape& aShape,
3781 MapShapeNbElems& aResMap)
3783 int nbtri = 0, nbqua = 0;
3784 double fullArea = 0.0;
3785 for (TopExp_Explorer exp(aShape, TopAbs_FACE); exp.More(); exp.Next()) {
3786 TopoDS_Face F = TopoDS::Face( exp.Current() );
3787 SMESH_subMesh *sm = aMesh.GetSubMesh(F);
3788 MapShapeNbElemsItr anIt = aResMap.find(sm);
3789 if( anIt==aResMap.end() ) {
3790 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
3791 smError.reset( new SMESH_ComputeError(COMPERR_ALGO_FAILED,
3792 "Submesh can not be evaluated",this));
3795 std::vector<int> aVec = (*anIt).second;
3796 nbtri += Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
3797 nbqua += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
3799 BRepGProp::SurfaceProperties(F,G);
3800 double anArea = G.Mass();
3804 // collect info from edges
3805 int nb0d_e = 0, nb1d_e = 0;
3806 bool IsQuadratic = false;
3807 bool IsFirst = true;
3808 TopTools_MapOfShape tmpMap;
3809 for (TopExp_Explorer exp(aShape, TopAbs_EDGE); exp.More(); exp.Next()) {
3810 TopoDS_Edge E = TopoDS::Edge(exp.Current());
3811 if( tmpMap.Contains(E) )
3814 SMESH_subMesh *aSubMesh = aMesh.GetSubMesh(exp.Current());
3815 MapShapeNbElemsItr anIt = aResMap.find(aSubMesh);
3816 std::vector<int> aVec = (*anIt).second;
3817 nb0d_e += aVec[SMDSEntity_Node];
3818 nb1d_e += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
3820 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
3826 double ELen = sqrt(2.* ( fullArea/(nbtri+nbqua*2) ) / sqrt(3.0) );
3829 BRepGProp::VolumeProperties(aShape,G);
3830 double aVolume = G.Mass();
3831 double tetrVol = 0.1179*ELen*ELen*ELen;
3832 double CoeffQuality = 0.9;
3833 int nbVols = int(aVolume/tetrVol/CoeffQuality);
3834 int nb1d_f = (nbtri*3 + nbqua*4 - nb1d_e) / 2;
3835 int nb1d_in = (int) ( nbVols*6 - nb1d_e - nb1d_f ) / 5;
3836 std::vector<int> aVec(SMDSEntity_Last);
3837 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i]=0;
3839 aVec[SMDSEntity_Node] = nb1d_in/6 + 1 + nb1d_in;
3840 aVec[SMDSEntity_Quad_Tetra] = nbVols - nbqua*2;
3841 aVec[SMDSEntity_Quad_Pyramid] = nbqua;
3844 aVec[SMDSEntity_Node] = nb1d_in/6 + 1;
3845 aVec[SMDSEntity_Tetra] = nbVols - nbqua*2;
3846 aVec[SMDSEntity_Pyramid] = nbqua;
3848 SMESH_subMesh *sm = aMesh.GetSubMesh(aShape);
3849 aResMap.insert(std::make_pair(sm,aVec));
3854 bool GHS3DPlugin_GHS3D::importGMFMesh(const char* theGMFFileName, SMESH_Mesh& theMesh)
3856 SMESH_MesherHelper* helper = new SMESH_MesherHelper(theMesh );
3857 TIDSortedElemSet dummyElemSet;
3858 TIDSortedNodeSet dummyNodeSet;
3859 return readGMFFile(theGMFFileName,
3860 #ifdef WITH_SMESH_CANCEL_COMPUTE
3863 helper, dummyNodeSet , dummyElemSet, dummyElemSet);