1 // Copyright (C) 2007-2011 CEA/DEN, EDF R&D, OPEN CASCADE
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 // File : StdMeshers_HexaFromSkin_3D.cxx
21 // Created : Wed Jan 27 12:28:07 2010
22 // Author : Edward AGAPOV (eap)
24 #include "StdMeshers_HexaFromSkin_3D.hxx"
26 #include "SMDS_VolumeOfNodes.hxx"
27 #include "SMDS_VolumeTool.hxx"
28 #include "SMESH_Block.hxx"
29 #include "SMESH_MesherHelper.hxx"
33 //#include "utilities.h"
36 // Define error message and _MYDEBUG_ if needed
38 #define BAD_MESH_ERR \
39 error(SMESH_Comment("Can't detect block-wise structure of the input 2D mesh.\n" \
40 __FILE__ ":" )<<__LINE__)
43 #define BAD_MESH_ERR \
44 error(SMESH_Comment("Can't detect block-wise structure of the input 2D mesh"))
50 #define _DUMP_(msg) cout << msg << endl
58 enum EBoxSides //!< sides of the block
60 B_BOTTOM=0, B_RIGHT, B_TOP, B_LEFT, B_FRONT, B_BACK, NB_BLOCK_SIDES
63 const char* SBoxSides[] = //!< names of block sides -- needed for DEBUG only
65 "BOTTOM", "RIGHT", "TOP", "LEFT", "FRONT", "BACK", "UNDEFINED"
68 enum EQuadEdge //!< edges of quadrangle side
70 Q_BOTTOM = 0, Q_RIGHT, Q_TOP, Q_LEFT, NB_QUAD_SIDES
74 //================================================================================
76 * \brief return logical coordinates (i.e. min or max) of ends of edge
78 //================================================================================
80 bool getEdgeEnds(EQuadEdge edge, bool& xMax1, bool& yMax1, bool& xMax2, bool& yMax2 )
82 xMax1=0, yMax1=0, xMax2=1, yMax2=1;
85 case Q_BOTTOM: yMax2 = 0; break;
86 case Q_RIGHT: xMax1 = 1; break;
87 case Q_TOP: yMax1 = 1; break;
88 case Q_LEFT: xMax2 = 0; break;
95 //================================================================================
97 * \brief return true if a node is at block corner
99 * This check is valid for simple cases only
101 //================================================================================
103 bool isCornerNode( const SMDS_MeshNode* n )
105 int nbF = n ? n->NbInverseElements( SMDSAbs_Face ) : 1;
109 set<const SMDS_MeshNode*> nodesInInverseFaces;
110 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator(SMDSAbs_Face );
111 while ( fIt->more() )
113 const SMDS_MeshElement* face = fIt->next();
114 nodesInInverseFaces.insert( face->begin_nodes(), face->end_nodes() );
117 return nodesInInverseFaces.size() != ( 6 + (nbF/2-1)*3 );
120 //================================================================================
122 * \brief check element type
124 //================================================================================
126 bool isQuadrangle(const SMDS_MeshElement* e)
128 return ( e && e->NbCornerNodes() == 4 );
131 //================================================================================
133 * \brief return opposite node of a quadrangle face
135 //================================================================================
137 const SMDS_MeshNode* oppositeNode(const SMDS_MeshElement* quad, int iNode)
139 return quad->GetNode( (iNode+2) % 4 );
142 //================================================================================
144 * \brief Convertor of a pair of integers to a sole index
149 _Indexer( int xSize=0, int ySize=0 ): _xSize(xSize), _ySize(ySize) {}
150 int size() const { return _xSize * _ySize; }
151 int operator()(int x, int y) const { return y * _xSize + x; }
153 //================================================================================
155 * \brief Oriented convertor of a pair of integers to a sole index
157 class _OrientedIndexer : public _Indexer
160 enum OriFlags //!< types of block side orientation
162 REV_X = 1, REV_Y = 2, SWAP_XY = 4, MAX_ORI = REV_X|REV_Y|SWAP_XY
164 _OrientedIndexer( const _Indexer& indexer, const int oriFlags ):
165 _Indexer( indexer._xSize, indexer._ySize ),
166 _xSize (indexer._xSize), _ySize(indexer._ySize),
167 _xRevFun((oriFlags & REV_X) ? & reverse : & lazy),
168 _yRevFun((oriFlags & REV_Y) ? & reverse : & lazy),
169 _swapFun((oriFlags & SWAP_XY ) ? & swap : & lazy)
171 (*_swapFun)( _xSize, _ySize );
173 //!< Return index by XY
174 int operator()(int x, int y) const
176 (*_xRevFun)( x, const_cast<int&>( _xSize ));
177 (*_yRevFun)( y, const_cast<int&>( _ySize ));
179 return _Indexer::operator()(x,y);
181 //!< Return index for a corner
182 int corner(bool xMax, bool yMax) const
184 int x = xMax, y = yMax, size = 2;
185 (*_xRevFun)( x, size );
186 (*_yRevFun)( y, size );
188 return _Indexer::operator()(x ? _Indexer::_xSize-1 : 0 , y ? _Indexer::_ySize-1 : 0);
190 int xSize() const { return _xSize; }
191 int ySize() const { return _ySize; }
196 typedef void (*TFun)(int& x, int& y);
197 TFun _xRevFun, _yRevFun, _swapFun;
199 static void lazy(int&, int&) {}
200 static void reverse(int& x, int& size) { x = size - x - 1; }
201 static void swap(int& x, int& y) { std::swap(x,y); }
203 //================================================================================
205 * \brief Structure corresponding to the meshed side of block
209 vector<const SMDS_MeshNode*> _grid;
211 int _nbBlocksExpected;
214 #ifdef _DEBUG_ // want to get SIGSEGV in case of invalid index
215 #define _grid_access_(pobj, i) pobj->_grid[ ((i) < pobj->_grid.size()) ? i : int(1e100)]
217 #define _grid_access_(pobj, i) pobj->_grid[ i ]
219 //!< Return node at XY
220 const SMDS_MeshNode* getNode(int x, int y) const { return _grid_access_(this, _index( x,y ));}
222 void setNode(int x, int y, const SMDS_MeshNode* n) { _grid_access_(this, _index( x,y )) = n; }
224 SMESH_OrientedLink getEdge(EQuadEdge edge) const
226 bool x1, y1, x2, y2; getEdgeEnds( edge, x1, y1, x2, y2 );
227 return SMESH_OrientedLink( getCornerNode ( x1, y1 ), getCornerNode( x2, y2 ));
229 //!< Return a corner node
230 const SMDS_MeshNode* getCornerNode(bool isXMax, bool isYMax) const
232 return getNode( isXMax ? _index._xSize-1 : 0 , isYMax ? _index._ySize-1 : 0 );
234 const SMDS_MeshElement* getCornerFace(const SMDS_MeshNode* cornerNode) const;
235 //!< True if all blocks this side belongs to have beem found
236 bool isBound() const { return _nbBlocksExpected <= _nbBlocksFound; }
237 //!< Return coordinates of node at XY
238 gp_XYZ getXYZ(int x, int y) const { return SMESH_TNodeXYZ( getNode( x, y )); }
239 //!< Return gravity center of the four corners and the middle node
244 getXYZ( _index._xSize-1, 0 ) +
245 getXYZ( 0, _index._ySize-1 ) +
246 getXYZ( _index._xSize-1, _index._ySize-1 ) +
247 getXYZ( _index._xSize/2, _index._ySize/2 );
250 //!< Return number of mesh faces
251 int getNbFaces() const { return (_index._xSize-1) * (_index._ySize-1); }
253 //================================================================================
255 * \brief _BlockSide with changed orientation
257 struct _OrientedBlockSide
260 _OrientedIndexer _index;
262 _OrientedBlockSide( _BlockSide* side=0, const int oriFlags=0 ):
263 _side(side), _index(side ? side->_index : _Indexer(), oriFlags ) {}
264 //!< return coordinates by XY
265 gp_XYZ xyz(int x, int y) const
267 return SMESH_TNodeXYZ( _grid_access_(_side, _index( x, y )) );
269 //!< safely return a node by XY
270 const SMDS_MeshNode* node(int x, int y) const
272 int i = _index( x, y );
273 return ( i < 0 || i >= _side->_grid.size()) ? 0 : _side->_grid[i];
276 SMESH_OrientedLink edge(EQuadEdge edge) const
278 bool x1, y1, x2, y2; getEdgeEnds( edge, x1, y1, x2, y2 );
279 return SMESH_OrientedLink( cornerNode ( x1, y1 ), cornerNode( x2, y2 ));
281 //!< Return a corner node
282 const SMDS_MeshNode* cornerNode(bool isXMax, bool isYMax) const
284 return _grid_access_(_side, _index.corner( isXMax, isYMax ));
286 //!< return its size in nodes
287 int getHoriSize() const { return _index.xSize(); }
288 int getVertSize() const { return _index.ySize(); }
289 //!< True if _side has been initialized
290 operator bool() const { return _side; }
291 //! Direct access to _side
292 const _BlockSide* operator->() const { return _side; }
293 _BlockSide* operator->() { return _side; }
295 //================================================================================
297 * \brief Meshed skin of block
301 _OrientedBlockSide _side[6]; // 6 sides of a sub-block
302 set<const SMDS_MeshNode*> _corners;
304 const _OrientedBlockSide& getSide(int i) const { return _side[i]; }
305 bool setSide( int i, const _OrientedBlockSide& s)
307 if (( _side[i] = s ))
309 _corners.insert( s.cornerNode(0,0));
310 _corners.insert( s.cornerNode(1,0));
311 _corners.insert( s.cornerNode(0,1));
312 _corners.insert( s.cornerNode(1,1));
316 void clear() { for (int i=0;i<6;++i) _side[i]=0; _corners.clear(); }
317 bool hasSide( const _OrientedBlockSide& s) const
319 if ( s ) for (int i=0;i<6;++i) if ( _side[i] && _side[i]._side == s._side ) return true;
322 int nbSides() const { int n=0; for (int i=0;i<6;++i) if ( _side[i] ) ++n; return n; }
323 bool isValid() const;
325 //================================================================================
327 * \brief Skin mesh possibly containing several meshed blocks
333 int findBlocks(SMESH_Mesh& mesh);
334 //!< return i-th block
335 const _Block& getBlock(int i) const { return _blocks[i]; }
336 //!< return error description
337 const SMESH_Comment& error() const { return _error; }
340 bool fillSide( _BlockSide& side,
341 const SMDS_MeshElement* cornerQuad,
342 const SMDS_MeshNode* cornerNode);
343 bool fillRowsUntilCorner(const SMDS_MeshElement* quad,
344 const SMDS_MeshNode* n1,
345 const SMDS_MeshNode* n2,
346 vector<const SMDS_MeshNode*>& verRow1,
347 vector<const SMDS_MeshNode*>& verRow2,
349 _OrientedBlockSide findBlockSide( EBoxSides startBlockSide,
350 EQuadEdge sharedSideEdge1,
351 EQuadEdge sharedSideEdge2,
352 bool withGeometricAnalysis);
353 //!< update own data and data of the side bound to block
354 void setSideBoundToBlock( _BlockSide& side )
356 if ( side._nbBlocksFound++, side.isBound() )
357 for ( int e = 0; e < int(NB_QUAD_SIDES); ++e )
358 _edge2sides[ side.getEdge( (EQuadEdge) e ) ].erase( &side );
360 //!< store reason of error
361 int error(const SMESH_Comment& reason) { _error = reason; return 0; }
363 SMESH_Comment _error;
365 list< _BlockSide > _allSides;
366 vector< _Block > _blocks;
368 //map< const SMDS_MeshNode*, set< _BlockSide* > > _corner2sides;
369 map< SMESH_OrientedLink, set< _BlockSide* > > _edge2sides;
372 //================================================================================
374 * \brief Find and return number of submeshes corresponding to blocks
376 //================================================================================
378 int _Skin::findBlocks(SMESH_Mesh& mesh)
380 SMESHDS_Mesh* meshDS = mesh.GetMeshDS();
382 // Find a node at any block corner
384 SMDS_NodeIteratorPtr nIt = meshDS->nodesIterator(/*idInceasingOrder=*/true);
385 if ( !nIt->more() ) return error("Empty mesh");
387 const SMDS_MeshNode* nCorner = 0;
388 while ( nIt->more() )
390 nCorner = nIt->next();
391 if ( isCornerNode( nCorner ))
399 // --------------------------------------------------------------------
400 // Find all block sides starting from mesh faces sharing the corner node
401 // --------------------------------------------------------------------
403 int nbFacesOnSides = 0;
404 TIDSortedElemSet cornerFaces; // corner faces of found _BlockSide's
405 list< const SMDS_MeshNode* > corners( 1, nCorner );
406 list< const SMDS_MeshNode* >::iterator corner = corners.begin();
407 while ( corner != corners.end() )
409 SMDS_ElemIteratorPtr faceIt = (*corner)->GetInverseElementIterator( SMDSAbs_Face );
410 while ( faceIt->more() )
412 const SMDS_MeshElement* face = faceIt->next();
413 if ( !cornerFaces.insert( face ).second )
414 continue; // already loaded block side
416 if ( !isQuadrangle( face ))
417 return error("Non-quadrangle elements in the input mesh");
419 if ( _allSides.empty() || !_allSides.back()._grid.empty() )
420 _allSides.push_back( _BlockSide() );
422 _BlockSide& side = _allSides.back();
423 if ( !fillSide( side, face, *corner ) )
425 if ( !_error.empty() )
430 for ( int isXMax = 0; isXMax < 2; ++isXMax )
431 for ( int isYMax = 0; isYMax < 2; ++isYMax )
433 const SMDS_MeshNode* nCorner = side.getCornerNode(isXMax,isYMax );
434 corners.push_back( nCorner );
435 cornerFaces.insert( side.getCornerFace( nCorner ));
437 for ( int e = 0; e < int(NB_QUAD_SIDES); ++e )
438 _edge2sides[ side.getEdge( (EQuadEdge) e ) ].insert( &side );
440 nbFacesOnSides += side.getNbFaces();
445 // find block sides of other domains if any
446 if ( corner == corners.end() && nbFacesOnSides < mesh.NbQuadrangles() )
448 while ( nIt->more() )
450 nCorner = nIt->next();
451 if ( isCornerNode( nCorner ))
452 corner = corners.insert( corner, nCorner );
454 nbFacesOnSides = mesh.NbQuadrangles();
458 if ( _allSides.empty() )
460 if ( _allSides.back()._grid.empty() )
461 _allSides.pop_back();
462 _DUMP_("Nb detected sides "<< _allSides.size());
464 // ---------------------------
465 // Organize sides into blocks
466 // ---------------------------
468 // analyse sharing of sides by blocks and sort sides by nb of adjacent sides
469 int nbBlockSides = 0; // total nb of block sides taking into account their sharing
470 multimap<int, _BlockSide* > sortedSides;
472 list < _BlockSide >::iterator sideIt = _allSides.begin();
473 for ( ; sideIt != _allSides.end(); ++sideIt )
475 _BlockSide& side = *sideIt;
476 bool isSharedSide = true;
478 for ( int e = 0; e < int(NB_QUAD_SIDES) && isSharedSide; ++e )
480 int nbAdj = _edge2sides[ side.getEdge( (EQuadEdge) e ) ].size();
482 isSharedSide = ( nbAdj > 2 );
484 side._nbBlocksFound = 0;
485 side._nbBlocksExpected = isSharedSide ? 2 : 1;
486 nbBlockSides += side._nbBlocksExpected;
487 sortedSides.insert( make_pair( nbAdjacent, & side ));
491 // find sides of each block
493 while ( nbBlockSides >= 6 )
495 // get any side not bound to all blocks it belongs to
496 multimap<int, _BlockSide*>::iterator i_side = sortedSides.begin();
497 while ( i_side != sortedSides.end() && i_side->second->isBound())
500 // start searching for block sides from the got side
502 if ( _blocks.empty() || _blocks.back()._side[B_FRONT] )
503 _blocks.resize( _blocks.size() + 1 );
505 _Block& block = _blocks.back();
506 block.setSide( B_FRONT, i_side->second );
507 setSideBoundToBlock( *i_side->second );
510 // edges of adjacent sides of B_FRONT corresponding to front's edges
511 EQuadEdge edgeOfFront[4] = { Q_BOTTOM, Q_RIGHT, Q_TOP, Q_LEFT };
512 EQuadEdge edgeOfAdj [4] = { Q_BOTTOM, Q_LEFT, Q_BOTTOM, Q_LEFT };
513 // first find all sides detectable w/o advanced analysis,
514 // then repeat the search, which then may pass without advanced analysis
515 for ( int advAnalys = 0; advAnalys < 2; ++advAnalys )
517 for ( int i = 0; (ok || !advAnalys) && i < NB_QUAD_SIDES; ++i )
518 if ( !block._side[i] ) // try to find 4 sides adjacent to front side
519 ok = block.setSide( i, findBlockSide( B_FRONT, edgeOfFront[i],edgeOfAdj[i],advAnalys));
520 if ( ok || !advAnalys)
521 if ( !block._side[B_BACK] && block._side[B_TOP] ) // try to find back side by top one
522 ok = block.setSide( B_BACK, findBlockSide( B_TOP, Q_TOP, Q_TOP, advAnalys ));
523 if ( !advAnalys ) ok = true;
525 ok = block.isValid();
528 // check if just found block is same as one of previously found
530 for ( int i = 1; i < _blocks.size() && !isSame; ++i )
531 isSame = ( block._corners == _blocks[i-1]._corners );
535 // count the found sides
536 _DUMP_(endl << "** Block " << _blocks.size() << " valid: " << block.isValid());
537 for (int i = 0; i < NB_BLOCK_SIDES; ++i )
539 _DUMP_("\tSide "<< SBoxSides[i] <<" "<< block._side[ i ]._side);
540 if ( block._side[ i ] )
542 if ( ok && i != B_FRONT)
544 setSideBoundToBlock( *block._side[ i ]._side );
547 _DUMP_("\t corners "<<
548 block._side[ i ].cornerNode(0,0)->GetID() << ", " <<
549 block._side[ i ].cornerNode(1,0)->GetID() << ", " <<
550 block._side[ i ].cornerNode(1,1)->GetID() << ", " <<
551 block._side[ i ].cornerNode(0,1)->GetID() << ", "<<endl);
555 _DUMP_("\t not found"<<endl);
563 _DUMP_("Nb found blocks "<< nbBlocks <<endl);
565 if ( nbBlocks == 0 && _error.empty() )
571 //================================================================================
573 * \brief Fill block side data starting from its corner quadrangle
575 //================================================================================
577 bool _Skin::fillSide( _BlockSide& side,
578 const SMDS_MeshElement* cornerQuad,
579 const SMDS_MeshNode* nCorner)
581 // Find out size of block side mesured in nodes and by the way find two rows
582 // of nodes in two directions.
585 const SMDS_MeshElement* firstQuad = cornerQuad;
587 // get a node on block edge
588 int iCorner = firstQuad->GetNodeIndex( nCorner );
589 const SMDS_MeshNode* nOnEdge = firstQuad->GetNode( (iCorner+1) % 4);
591 // find out size of block side
592 vector<const SMDS_MeshNode*> horRow1, horRow2, verRow1, verRow2;
593 if ( !fillRowsUntilCorner( firstQuad, nCorner, nOnEdge, horRow1, horRow2, true ) ||
594 !fillRowsUntilCorner( firstQuad, nCorner, nOnEdge, verRow1, verRow2, false ))
596 nbX = horRow1.size(), nbY = verRow1.size();
599 side._index._xSize = horRow1.size();
600 side._index._ySize = verRow1.size();
601 side._grid.resize( side._index.size(), NULL );
603 for ( x = 0; x < horRow1.size(); ++x )
605 side.setNode( x, 0, horRow1[x] );
606 side.setNode( x, 1, horRow2[x] );
608 for ( y = 0; y < verRow1.size(); ++y )
610 side.setNode( 0, y, verRow1[y] );
611 side.setNode( 1, y, verRow2[y] );
614 // Find the rest nodes
616 y = 1; // y of the row to fill
617 TIDSortedElemSet emptySet, avoidSet;
620 // get next firstQuad in the next row of quadrangles
625 // o---o o o o o <- found nodes
628 int i1down, i2down, i2up;
629 const SMDS_MeshNode* n1down = side.getNode( 0, y-1 );
630 const SMDS_MeshNode* n2down = side.getNode( 1, y-1 );
631 avoidSet.clear(); avoidSet.insert( firstQuad );
632 firstQuad = SMESH_MeshEditor::FindFaceInSet( n1down, n2down, emptySet, avoidSet,
634 if ( !isQuadrangle( firstQuad ))
637 const SMDS_MeshNode* n2up = oppositeNode( firstQuad, i1down );
638 avoidSet.clear(); avoidSet.insert( firstQuad );
640 // find the rest nodes in the y-th row by faces in the row
645 const SMDS_MeshElement* quad = SMESH_MeshEditor::FindFaceInSet( n2up, n2down, emptySet,
646 avoidSet, &i2up, &i2down);
647 if ( !isQuadrangle( quad ))
650 n2up = oppositeNode( quad, i2down );
651 n2down = oppositeNode( quad, i2up );
652 avoidSet.clear(); avoidSet.insert( quad );
654 side.setNode( x, y, n2up );
658 // check side validity
660 side.getCornerFace( side.getCornerNode( 0, 0 )) &&
661 side.getCornerFace( side.getCornerNode( 1, 0 )) &&
662 side.getCornerFace( side.getCornerNode( 0, 1 )) &&
663 side.getCornerFace( side.getCornerNode( 1, 1 ));
668 //================================================================================
670 * \brief Try to find a block side adjacent to the given side by given edge
672 //================================================================================
674 _OrientedBlockSide _Skin::findBlockSide( EBoxSides startBlockSide,
675 EQuadEdge sharedSideEdge1,
676 EQuadEdge sharedSideEdge2,
677 bool withGeometricAnalysis)
679 _Block& block = _blocks.back();
680 _OrientedBlockSide& side1 = block._side[ startBlockSide ];
682 // get corner nodes of the given block edge
683 SMESH_OrientedLink edge = side1.edge( sharedSideEdge1 );
684 const SMDS_MeshNode* n1 = edge.node1();
685 const SMDS_MeshNode* n2 = edge.node2();
686 if ( edge._reversed ) swap( n1, n2 );
688 // find all sides sharing both nodes n1 and n2
689 set< _BlockSide* > sidesOnEdge = _edge2sides[ edge ]; // copy a set
691 // exclude loaded sides of block from sidesOnEdge
692 for (int i = 0; i < NB_BLOCK_SIDES; ++i )
693 if ( block._side[ i ] )
694 sidesOnEdge.erase( block._side[ i ]._side );
696 int nbSidesOnEdge = sidesOnEdge.size();
697 _DUMP_("nbSidesOnEdge "<< nbSidesOnEdge << " " << n1->GetID() << "-" << n2->GetID() );
698 if ( nbSidesOnEdge == 0 )
701 _BlockSide* foundSide = 0;
702 if ( nbSidesOnEdge == 1 )
704 foundSide = *sidesOnEdge.begin();
708 set< _BlockSide* >::iterator sideIt = sidesOnEdge.begin();
709 int nbLoadedSides = block.nbSides();
710 if ( nbLoadedSides > 1 )
712 // Find the side having more than 2 corners common with already loaded sides
713 for (; !foundSide && sideIt != sidesOnEdge.end(); ++sideIt )
715 _BlockSide* sideI = *sideIt;
716 int nbCommonCorners =
717 block._corners.count( sideI->getCornerNode(0,0)) +
718 block._corners.count( sideI->getCornerNode(1,0)) +
719 block._corners.count( sideI->getCornerNode(0,1)) +
720 block._corners.count( sideI->getCornerNode(1,1));
721 if ( nbCommonCorners > 2 )
728 if ( !withGeometricAnalysis ) return 0;
730 // Select one of found sides most close to startBlockSide
732 gp_XYZ p1 ( n1->X(),n1->Y(),n1->Z()), p2 (n2->X(),n2->Y(),n2->Z());
733 gp_Vec p1p2( p1, p2 );
735 const SMDS_MeshElement* face1 = side1->getCornerFace( n1 );
736 gp_XYZ p1Op = SMESH_TNodeXYZ( oppositeNode( face1, face1->GetNodeIndex(n1)));
737 gp_Vec side1Dir( p1, p1Op );
738 gp_Ax2 pln( p1, p1p2, side1Dir ); // plane with normal p1p2 and X dir side1Dir
739 _DUMP_(" Select adjacent for "<< side1._side << " - side dir ("
740 << side1Dir.X() << ", " << side1Dir.Y() << ", " << side1Dir.Z() << ")" );
742 map < double , _BlockSide* > angleOfSide;
743 for (sideIt = sidesOnEdge.begin(); sideIt != sidesOnEdge.end(); ++sideIt )
745 _BlockSide* sideI = *sideIt;
746 const SMDS_MeshElement* faceI = sideI->getCornerFace( n1 );
747 gp_XYZ p1Op = SMESH_TNodeXYZ( oppositeNode( faceI, faceI->GetNodeIndex(n1)));
748 gp_Vec sideIDir( p1, p1Op );
749 // compute angle of (sideIDir projection to pln) and (X dir of pln)
750 gp_Vec2d sideIDirProj( sideIDir * pln.XDirection(), sideIDir * pln.YDirection());
751 double angle = sideIDirProj.Angle( gp::DX2d() );
752 if ( angle < 0 ) angle += 2 * PI; // angle [0-2*PI]
753 angleOfSide.insert( make_pair( angle, sideI ));
754 _DUMP_(" "<< sideI << " - side dir ("
755 << sideIDir.X() << ", " << sideIDir.Y() << ", " << sideIDir.Z() << ")"
756 << " angle " << angle);
758 if ( nbLoadedSides == 1 )
760 double angF = angleOfSide.begin()->first, angL = angleOfSide.rbegin()->first;
761 if ( angF > PI ) angF = 2*PI - angF;
762 if ( angL > PI ) angL = 2*PI - angL;
763 foundSide = angF < angL ? angleOfSide.begin()->second : angleOfSide.rbegin()->second;
767 gp_XYZ gc(0,0,0); // gravity center of already loaded block sides
768 for (int i = 0; i < NB_BLOCK_SIDES; ++i )
769 if ( block._side[ i ] )
770 gc += block._side[ i ]._side->getGC();
773 gp_Vec gcDir( p1, gc );
774 gp_Vec2d gcDirProj( gcDir * pln.XDirection(), gcDir * pln.YDirection());
775 double gcAngle = gcDirProj.Angle( gp::DX2d() );
776 foundSide = gcAngle < 0 ? angleOfSide.rbegin()->second : angleOfSide.begin()->second;
779 _DUMP_(" selected "<< foundSide );
782 // Orient the found side correctly
784 // corners of found side corresponding to nodes n1 and n2
785 bool xMax1, yMax1, xMax2, yMax2;
786 if ( !getEdgeEnds( sharedSideEdge2, xMax1, yMax1, xMax2, yMax2 ))
787 return error(SMESH_Comment("Internal error at ")<<__FILE__<<":"<<__LINE__),
788 _OrientedBlockSide(0);
790 for ( int ori = 0; ori < _OrientedIndexer::MAX_ORI+1; ++ori )
792 _OrientedBlockSide orientedSide( foundSide, ori );
793 const SMDS_MeshNode* n12 = orientedSide.cornerNode( xMax1, yMax1);
794 const SMDS_MeshNode* n22 = orientedSide.cornerNode( xMax2, yMax2);
795 if ( n1 == n12 && n2 == n22 )
798 error(SMESH_Comment("Failed to orient a block side found by edge ")<<sharedSideEdge1
799 << " of side " << startBlockSide
800 << " of block " << _blocks.size());
804 //================================================================================
806 * \brief: Fill rows (which are actually columns,if !alongN1N2) of nodes starting
807 * from the given quadrangle until another block corner encounters.
808 * n1 and n2 are at bottom of quad, n1 is at block corner.
810 //================================================================================
812 bool _Skin::fillRowsUntilCorner(const SMDS_MeshElement* quad,
813 const SMDS_MeshNode* n1,
814 const SMDS_MeshNode* n2,
815 vector<const SMDS_MeshNode*>& row1,
816 vector<const SMDS_MeshNode*>& row2,
817 const bool alongN1N2 )
819 const SMDS_MeshNode* corner1 = n1;
821 // Store nodes of quad in the rows and find new n1 and n2 to get
822 // the next face so that new n2 is on block edge
823 int i1 = quad->GetNodeIndex( n1 );
824 int i2 = quad->GetNodeIndex( n2 );
825 row1.clear(); row2.clear();
826 row1.push_back( n1 );
829 row1.push_back( n2 );
830 row2.push_back( oppositeNode( quad, i2 ));
831 row2.push_back( n1 = oppositeNode( quad, i1 ));
835 row2.push_back( n2 );
836 row1.push_back( n2 = oppositeNode( quad, i2 ));
837 row2.push_back( n1 = oppositeNode( quad, i1 ));
840 if ( isCornerNode( row1[1] ))
843 // Find the rest nodes
844 TIDSortedElemSet emptySet, avoidSet;
845 while ( !isCornerNode( n2 ) )
847 avoidSet.clear(); avoidSet.insert( quad );
848 quad = SMESH_MeshEditor::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2 );
849 if ( !isQuadrangle( quad ))
852 row1.push_back( n2 = oppositeNode( quad, i1 ));
853 row2.push_back( n1 = oppositeNode( quad, i2 ));
855 return n1 != corner1;
858 //================================================================================
860 * \brief Return a corner face by a corner node
862 //================================================================================
864 const SMDS_MeshElement* _BlockSide::getCornerFace(const SMDS_MeshNode* cornerNode) const
866 int x, y, isXMax, isYMax, found = 0;
867 for ( isXMax = 0; isXMax < 2; ++isXMax )
869 for ( isYMax = 0; isYMax < 2; ++isYMax )
871 x = isXMax ? _index._xSize-1 : 0;
872 y = isYMax ? _index._ySize-1 : 0;
873 found = ( getNode(x,y) == cornerNode );
878 if ( !found ) return 0;
879 int dx = isXMax ? -1 : +1;
880 int dy = isYMax ? -1 : +1;
881 const SMDS_MeshNode* n1 = getNode(x,y);
882 const SMDS_MeshNode* n2 = getNode(x+dx,y);
883 const SMDS_MeshNode* n3 = getNode(x,y+dy);
884 const SMDS_MeshNode* n4 = getNode(x+dx,y+dy);
885 return SMDS_Mesh::FindFace(n1, n2, n3, n4 );
888 //================================================================================
890 * \brief Checks own validity
892 //================================================================================
894 bool _Block::isValid() const
896 bool ok = ( nbSides() == 6 );
898 // check only corners depending on side selection
899 EBoxSides adjacent[4] = { B_BOTTOM, B_RIGHT, B_TOP, B_LEFT };
900 EQuadEdge edgeAdj [4] = { Q_TOP, Q_RIGHT, Q_TOP, Q_RIGHT };
901 EQuadEdge edgeBack[4] = { Q_BOTTOM, Q_RIGHT, Q_TOP, Q_LEFT };
903 for ( int i=0; ok && i < NB_QUAD_SIDES; ++i )
905 SMESH_OrientedLink eBack = _side[ B_BACK ].edge( edgeBack[i] );
906 SMESH_OrientedLink eAdja = _side[ adjacent[i] ].edge( edgeAdj[i] );
907 ok = ( eBack == eAdja );
914 //=======================================================================
915 //function : StdMeshers_HexaFromSkin_3D
917 //=======================================================================
919 StdMeshers_HexaFromSkin_3D::StdMeshers_HexaFromSkin_3D(int hypId, int studyId, SMESH_Gen* gen)
920 :SMESH_3D_Algo(hypId, studyId, gen)
922 MESSAGE("StdMeshers_HexaFromSkin_3D::StdMeshers_HexaFromSkin_3D");
923 _name = "HexaFromSkin_3D";
926 StdMeshers_HexaFromSkin_3D::~StdMeshers_HexaFromSkin_3D()
928 MESSAGE("StdMeshers_HexaFromSkin_3D::~StdMeshers_HexaFromSkin_3D");
931 //================================================================================
933 * \brief Main method, which generates hexaheda
935 //================================================================================
937 bool StdMeshers_HexaFromSkin_3D::Compute(SMESH_Mesh & aMesh, SMESH_MesherHelper* aHelper)
940 int nbBlocks = skin.findBlocks(aMesh);
942 return error( skin.error());
944 vector< vector< const SMDS_MeshNode* > > columns;
945 int x, xSize, y, ySize, z, zSize;
948 for ( int i = 0; i < nbBlocks; ++i )
950 const _Block& block = skin.getBlock( i );
952 // ------------------------------------------
953 // Fill columns of nodes with existing nodes
954 // ------------------------------------------
956 xSize = block.getSide(B_BOTTOM).getHoriSize();
957 ySize = block.getSide(B_BOTTOM).getVertSize();
958 zSize = block.getSide(B_FRONT ).getVertSize();
959 int X = xSize - 1, Y = ySize - 1, Z = zSize - 1;
960 colIndex = _Indexer( xSize, ySize );
961 columns.resize( colIndex.size() );
963 // fill node columns by front and back box sides
964 for ( x = 0; x < xSize; ++x ) {
965 vector< const SMDS_MeshNode* >& column0 = columns[ colIndex( x, 0 )];
966 vector< const SMDS_MeshNode* >& column1 = columns[ colIndex( x, Y )];
967 column0.resize( zSize );
968 column1.resize( zSize );
969 for ( z = 0; z < zSize; ++z ) {
970 column0[ z ] = block.getSide(B_FRONT).node( x, z );
971 column1[ z ] = block.getSide(B_BACK) .node( x, z );
974 // fill node columns by left and right box sides
975 for ( y = 1; y < ySize-1; ++y ) {
976 vector< const SMDS_MeshNode* >& column0 = columns[ colIndex( 0, y )];
977 vector< const SMDS_MeshNode* >& column1 = columns[ colIndex( X, y )];
978 column0.resize( zSize );
979 column1.resize( zSize );
980 for ( z = 0; z < zSize; ++z ) {
981 column0[ z ] = block.getSide(B_LEFT) .node( y, z );
982 column1[ z ] = block.getSide(B_RIGHT).node( y, z );
985 // get nodes from top and bottom box sides
986 for ( x = 1; x < xSize-1; ++x ) {
987 for ( y = 1; y < ySize-1; ++y ) {
988 vector< const SMDS_MeshNode* >& column = columns[ colIndex( x, y )];
989 column.resize( zSize );
990 column.front() = block.getSide(B_BOTTOM).node( x, y );
991 column.back() = block.getSide(B_TOP) .node( x, y );
995 // ----------------------------
996 // Add internal nodes of a box
997 // ----------------------------
998 // projection points of internal nodes on box subshapes by which
999 // coordinates of internal nodes are computed
1000 vector<gp_XYZ> pointOnShape( SMESH_Block::ID_Shell );
1002 // projections on vertices are constant
1003 pointOnShape[ SMESH_Block::ID_V000 ] = block.getSide(B_BOTTOM).xyz( 0, 0 );
1004 pointOnShape[ SMESH_Block::ID_V100 ] = block.getSide(B_BOTTOM).xyz( X, 0 );
1005 pointOnShape[ SMESH_Block::ID_V010 ] = block.getSide(B_BOTTOM).xyz( 0, Y );
1006 pointOnShape[ SMESH_Block::ID_V110 ] = block.getSide(B_BOTTOM).xyz( X, Y );
1007 pointOnShape[ SMESH_Block::ID_V001 ] = block.getSide(B_TOP).xyz( 0, 0 );
1008 pointOnShape[ SMESH_Block::ID_V101 ] = block.getSide(B_TOP).xyz( X, 0 );
1009 pointOnShape[ SMESH_Block::ID_V011 ] = block.getSide(B_TOP).xyz( 0, Y );
1010 pointOnShape[ SMESH_Block::ID_V111 ] = block.getSide(B_TOP).xyz( X, Y );
1012 for ( x = 1; x < xSize-1; ++x )
1014 gp_XYZ params; // normalized parameters of internal node within a unit box
1015 params.SetCoord( 1, x / double(X) );
1016 for ( y = 1; y < ySize-1; ++y )
1018 params.SetCoord( 2, y / double(Y) );
1019 // column to fill during z loop
1020 vector< const SMDS_MeshNode* >& column = columns[ colIndex( x, y )];
1021 // projections on horizontal edges
1022 pointOnShape[ SMESH_Block::ID_Ex00 ] = block.getSide(B_BOTTOM).xyz( x, 0 );
1023 pointOnShape[ SMESH_Block::ID_Ex10 ] = block.getSide(B_BOTTOM).xyz( x, Y );
1024 pointOnShape[ SMESH_Block::ID_E0y0 ] = block.getSide(B_BOTTOM).xyz( 0, y );
1025 pointOnShape[ SMESH_Block::ID_E1y0 ] = block.getSide(B_BOTTOM).xyz( X, y );
1026 pointOnShape[ SMESH_Block::ID_Ex01 ] = block.getSide(B_TOP).xyz( x, 0 );
1027 pointOnShape[ SMESH_Block::ID_Ex11 ] = block.getSide(B_TOP).xyz( x, Y );
1028 pointOnShape[ SMESH_Block::ID_E0y1 ] = block.getSide(B_TOP).xyz( 0, y );
1029 pointOnShape[ SMESH_Block::ID_E1y1 ] = block.getSide(B_TOP).xyz( X, y );
1030 // projections on horizontal sides
1031 pointOnShape[ SMESH_Block::ID_Fxy0 ] = block.getSide(B_BOTTOM).xyz( x, y );
1032 pointOnShape[ SMESH_Block::ID_Fxy1 ] = block.getSide(B_TOP) .xyz( x, y );
1033 for ( z = 1; z < zSize-1; ++z ) // z loop
1035 params.SetCoord( 3, z / double(Z) );
1036 // projections on vertical edges
1037 pointOnShape[ SMESH_Block::ID_E00z ] = block.getSide(B_FRONT).xyz( 0, z );
1038 pointOnShape[ SMESH_Block::ID_E10z ] = block.getSide(B_FRONT).xyz( X, z );
1039 pointOnShape[ SMESH_Block::ID_E01z ] = block.getSide(B_BACK).xyz( 0, z );
1040 pointOnShape[ SMESH_Block::ID_E11z ] = block.getSide(B_BACK).xyz( X, z );
1041 // projections on vertical sides
1042 pointOnShape[ SMESH_Block::ID_Fx0z ] = block.getSide(B_FRONT).xyz( x, z );
1043 pointOnShape[ SMESH_Block::ID_Fx1z ] = block.getSide(B_BACK) .xyz( x, z );
1044 pointOnShape[ SMESH_Block::ID_F0yz ] = block.getSide(B_LEFT) .xyz( y, z );
1045 pointOnShape[ SMESH_Block::ID_F1yz ] = block.getSide(B_RIGHT).xyz( y, z );
1047 // compute internal node coordinates
1049 SMESH_Block::ShellPoint( params, pointOnShape, coords );
1050 column[ z ] = aHelper->AddNode( coords.X(), coords.Y(), coords.Z() );
1054 //cout << "----------------------------------------------------------------------"<<endl;
1055 //for ( int id = SMESH_Block::ID_V000; id < SMESH_Block::ID_Shell; ++id)
1057 // gp_XYZ p = pointOnShape[ id ];
1058 // SMESH_Block::DumpShapeID( id,cout)<<" ( "<<p.X()<<", "<<p.Y()<<", "<<p.Z()<<" )"<<endl;
1060 //cout << "Params: ( "<< params.X()<<", "<<params.Y()<<", "<<params.Z()<<" )"<<endl;
1061 //cout << "coords: ( "<< coords.X()<<", "<<coords.Y()<<", "<<coords.Z()<<" )"<<endl;
1070 // find out orientation by a least distorted hexahedron (issue 0020855);
1071 // the last is defined by evaluating sum of face normals of 8 corner hexahedrons
1072 double badness = numeric_limits<double>::max();
1074 for ( int xMax = 0; xMax < 2; ++xMax )
1075 for ( int yMax = 0; yMax < 2; ++yMax )
1076 for ( int zMax = 0; zMax < 2; ++zMax )
1078 x = xMax ? xSize-1 : 1;
1079 y = yMax ? ySize-1 : 1;
1080 z = zMax ? zSize-1 : 1;
1081 vector< const SMDS_MeshNode* >& col00 = columns[ colIndex( x-1, y-1 )];
1082 vector< const SMDS_MeshNode* >& col10 = columns[ colIndex( x , y-1 )];
1083 vector< const SMDS_MeshNode* >& col01 = columns[ colIndex( x-1, y )];
1084 vector< const SMDS_MeshNode* >& col11 = columns[ colIndex( x , y )];
1086 const SMDS_MeshNode* n000 = col00[z-1];
1087 const SMDS_MeshNode* n100 = col10[z-1];
1088 const SMDS_MeshNode* n010 = col01[z-1];
1089 const SMDS_MeshNode* n110 = col11[z-1];
1090 const SMDS_MeshNode* n001 = col00[z];
1091 const SMDS_MeshNode* n101 = col10[z];
1092 const SMDS_MeshNode* n011 = col01[z];
1093 const SMDS_MeshNode* n111 = col11[z];
1094 SMDS_VolumeOfNodes probeVolume (n000,n010,n110,n100,
1095 n001,n011,n111,n101);
1096 SMDS_VolumeTool volTool( &probeVolume );
1097 double Nx=0.,Ny=0.,Nz=0.;
1098 for ( int iFace = 0; iFace < volTool.NbFaces(); ++iFace )
1101 volTool.GetFaceNormal( iFace, nx,ny,nz );
1106 double quality = Nx*Nx + Ny*Ny + Nz*Nz;
1107 if ( quality < badness )
1110 isForw = volTool.IsForward();
1115 for ( x = 0; x < xSize-1; ++x ) {
1116 for ( y = 0; y < ySize-1; ++y ) {
1117 vector< const SMDS_MeshNode* >& col00 = columns[ colIndex( x, y )];
1118 vector< const SMDS_MeshNode* >& col10 = columns[ colIndex( x+1, y )];
1119 vector< const SMDS_MeshNode* >& col01 = columns[ colIndex( x, y+1 )];
1120 vector< const SMDS_MeshNode* >& col11 = columns[ colIndex( x+1, y+1 )];
1121 // bottom face normal of a hexa mush point outside the volume
1123 for ( z = 0; z < zSize-1; ++z )
1124 aHelper->AddVolume(col00[z], col01[z], col11[z], col10[z],
1125 col00[z+1], col01[z+1], col11[z+1], col10[z+1]);
1127 for ( z = 0; z < zSize-1; ++z )
1128 aHelper->AddVolume(col00[z], col10[z], col11[z], col01[z],
1129 col00[z+1], col10[z+1], col11[z+1], col01[z+1]);
1137 //================================================================================
1139 * \brief Evaluate nb of hexa
1141 //================================================================================
1143 bool StdMeshers_HexaFromSkin_3D::Evaluate(SMESH_Mesh & aMesh,
1144 const TopoDS_Shape & aShape,
1145 MapShapeNbElems& aResMap)
1148 int nbBlocks = skin.findBlocks(aMesh);
1149 if ( nbBlocks == 0 )
1150 return error( skin.error());
1152 bool secondOrder = aMesh.NbFaces( ORDER_QUADRATIC );
1154 int entity = secondOrder ? SMDSEntity_Quad_Hexa : SMDSEntity_Hexa;
1155 vector<int>& nbByType = aResMap[ aMesh.GetSubMesh( aShape )];
1156 if ( entity >= nbByType.size() )
1157 nbByType.resize( SMDSEntity_Last, 0 );
1159 for ( int i = 0; i < nbBlocks; ++i )
1161 const _Block& block = skin.getBlock( i );
1163 int nbX = block.getSide(B_BOTTOM).getHoriSize();
1164 int nbY = block.getSide(B_BOTTOM).getVertSize();
1165 int nbZ = block.getSide(B_FRONT ).getVertSize();
1167 int nbHexa = (nbX-1) * (nbY-1) * (nbZ-1);
1168 int nbNodes = (nbX-2) * (nbY-2) * (nbZ-2);
1171 (nbX-2) * (nbY-2) * (nbZ-1) +
1172 (nbX-2) * (nbY-1) * (nbZ-2) +
1173 (nbX-1) * (nbY-2) * (nbZ-2);
1176 nbByType[ entity ] += nbHexa;
1177 nbByType[ SMDSEntity_Node ] += nbNodes;
1183 //================================================================================
1185 * \brief Abstract method must be defined but does nothing
1187 //================================================================================
1189 bool StdMeshers_HexaFromSkin_3D::CheckHypothesis(SMESH_Mesh&, const TopoDS_Shape&,
1190 Hypothesis_Status& aStatus)
1192 aStatus = SMESH_Hypothesis::HYP_OK;
1196 //================================================================================
1198 * \brief Abstract method must be defined but just reports an error as this
1199 * algo is not intended to work with shapes
1201 //================================================================================
1203 bool StdMeshers_HexaFromSkin_3D::Compute(SMESH_Mesh&, const TopoDS_Shape&)
1205 return error("Algorithm can't work with geometrical shapes");