1 // Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
2 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
4 // This library is free software; you can redistribute it and/or
5 // modify it under the terms of the GNU Lesser General Public
6 // License as published by the Free Software Foundation; either
7 // version 2.1 of the License.
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // Lesser General Public License for more details.
14 // You should have received a copy of the GNU Lesser General Public
15 // License along with this library; if not, write to the Free Software
16 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
20 // File : SMESH_Pattern.hxx
21 // Created : Mon Aug 2 10:30:00 2004
22 // Author : Edward AGAPOV (eap)
24 #include "SMESH_Pattern.hxx"
26 #include <BRepAdaptor_Curve.hxx>
27 #include <BRepTools.hxx>
28 #include <BRepTools_WireExplorer.hxx>
29 #include <BRep_Tool.hxx>
30 #include <Bnd_Box.hxx>
31 #include <Bnd_Box2d.hxx>
33 #include <Extrema_ExtPC.hxx>
34 #include <Extrema_GenExtPS.hxx>
35 #include <Extrema_POnSurf.hxx>
36 #include <Geom2d_Curve.hxx>
37 #include <GeomAdaptor_Surface.hxx>
38 #include <Geom_Curve.hxx>
39 #include <Geom_Surface.hxx>
40 #include <TopAbs_ShapeEnum.hxx>
42 #include <TopExp_Explorer.hxx>
43 #include <TopLoc_Location.hxx>
44 #include <TopTools_ListIteratorOfListOfShape.hxx>
46 #include <TopoDS_Edge.hxx>
47 #include <TopoDS_Face.hxx>
48 #include <TopoDS_Iterator.hxx>
49 #include <TopoDS_Shell.hxx>
50 #include <TopoDS_Vertex.hxx>
51 #include <TopoDS_Wire.hxx>
53 #include <gp_Lin2d.hxx>
54 #include <gp_Pnt2d.hxx>
55 #include <gp_Trsf.hxx>
59 #include "SMDS_EdgePosition.hxx"
60 #include "SMDS_FacePosition.hxx"
61 #include "SMDS_MeshElement.hxx"
62 #include "SMDS_MeshFace.hxx"
63 #include "SMDS_MeshNode.hxx"
64 #include "SMDS_VolumeTool.hxx"
65 #include "SMESHDS_Group.hxx"
66 #include "SMESHDS_Mesh.hxx"
67 #include "SMESHDS_SubMesh.hxx"
68 #include "SMESH_Block.hxx"
69 #include "SMESH_Mesh.hxx"
70 #include "SMESH_MeshEditor.hxx"
71 #include "SMESH_subMesh.hxx"
73 #include "utilities.h"
77 typedef map< const SMDS_MeshElement*, int > TNodePointIDMap;
79 #define smdsNode( elem ) static_cast<const SMDS_MeshNode*>( elem )
81 //=======================================================================
82 //function : SMESH_Pattern
84 //=======================================================================
86 SMESH_Pattern::SMESH_Pattern ()
89 //=======================================================================
92 //=======================================================================
94 static inline int getInt( const char * theSring )
96 if ( *theSring < '0' || *theSring > '9' )
100 int val = strtol( theSring, &ptr, 10 );
101 if ( ptr == theSring ||
102 // there must not be neither '.' nor ',' nor 'E' ...
103 (*ptr != ' ' && *ptr != '\n' && *ptr != '\0'))
109 //=======================================================================
110 //function : getDouble
112 //=======================================================================
114 static inline double getDouble( const char * theSring )
117 return strtod( theSring, &ptr );
120 //=======================================================================
121 //function : readLine
122 //purpose : Put token starting positions in theFields until '\n' or '\0'
123 // Return the number of the found tokens
124 //=======================================================================
126 static int readLine (list <const char*> & theFields,
127 const char* & theLineBeg,
128 const bool theClearFields )
130 if ( theClearFields )
135 /* switch ( symbol ) { */
136 /* case white-space: */
137 /* look for a non-space symbol; */
138 /* case string-end: */
141 /* case comment beginning: */
142 /* skip all till a line-end; */
144 /* put its position in theFields, skip till a white-space;*/
150 bool stopReading = false;
153 bool isNumber = false;
154 switch ( *theLineBeg )
156 case ' ': // white space
161 case '\n': // a line ends
162 stopReading = ( nbRead > 0 );
167 while ( *theLineBeg != '\n' && *theLineBeg != '\0' );
171 case '\0': // file ends
174 case '-': // real number
179 isNumber = isNumber || ( *theLineBeg >= '0' && *theLineBeg <= '9' );
181 theFields.push_back( theLineBeg );
184 while (*theLineBeg != ' ' &&
185 *theLineBeg != '\n' &&
186 *theLineBeg != '\0');
190 return 0; // incorrect file format
196 } while ( !stopReading );
201 //=======================================================================
203 //purpose : Load a pattern from <theFile>
204 //=======================================================================
206 bool SMESH_Pattern::Load (const char* theFileContents)
208 MESSAGE("Load( file ) ");
212 // ! This is a comment
213 // NB_POINTS ! 1 integer - the number of points in the pattern.
214 // X1 Y1 [Z1] ! 2 or 3 reals - nodes coordinates within 2D or 3D domain:
215 // X2 Y2 [Z2] ! the pattern dimention is defined by the number of coordinates
217 // [ ID1 ID2 ... IDn ] ! Indices of key-points for a 2D pattern (only).
218 // ! elements description goes after all
219 // ID1 ID2 ... IDn ! 2-4 or 4-8 integers - nodal connectivity of a 2D or 3D element.
224 const char* lineBeg = theFileContents;
225 list <const char*> fields;
226 const bool clearFields = true;
228 // NB_POINTS ! 1 integer - the number of points in the pattern.
230 if ( readLine( fields, lineBeg, clearFields ) != 1 ) {
231 MESSAGE("Error reading NB_POINTS");
232 return setErrorCode( ERR_READ_NB_POINTS );
234 int nbPoints = getInt( fields.front() );
236 // X1 Y1 [Z1] ! 2 or 3 reals - nodes coordinates within 2D or 3D domain:
238 // read the first point coordinates to define pattern dimention
239 int dim = readLine( fields, lineBeg, clearFields );
245 MESSAGE("Error reading points: wrong nb of coordinates");
246 return setErrorCode( ERR_READ_POINT_COORDS );
248 if ( nbPoints <= dim ) {
249 MESSAGE(" Too few points ");
250 return setErrorCode( ERR_READ_TOO_FEW_POINTS );
253 // read the rest points
255 for ( iPoint = 1; iPoint < nbPoints; iPoint++ )
256 if ( readLine( fields, lineBeg, !clearFields ) != dim ) {
257 MESSAGE("Error reading points : wrong nb of coordinates ");
258 return setErrorCode( ERR_READ_POINT_COORDS );
260 // store point coordinates
261 myPoints.resize( nbPoints );
262 list <const char*>::iterator fIt = fields.begin();
263 for ( iPoint = 0; iPoint < nbPoints; iPoint++ )
265 TPoint & p = myPoints[ iPoint ];
266 for ( int iCoord = 1; iCoord <= dim; iCoord++, fIt++ )
268 double coord = getDouble( *fIt );
269 if ( !myIs2D && ( coord < 0.0 || coord > 1.0 )) {
270 MESSAGE("Error reading 3D points, value should be in [0,1]: " << coord);
272 return setErrorCode( ERR_READ_3D_COORD );
274 p.myInitXYZ.SetCoord( iCoord, coord );
276 p.myInitUV.SetCoord( iCoord, coord );
280 // [ ID1 ID2 ... IDn ] ! Indices of key-points for a 2D pattern (only).
283 if ( readLine( fields, lineBeg, clearFields ) == 0 ) {
284 MESSAGE("Error: missing key-points");
286 return setErrorCode( ERR_READ_NO_KEYPOINT );
289 for ( fIt = fields.begin(); fIt != fields.end(); fIt++ )
291 int pointIndex = getInt( *fIt );
292 if ( pointIndex >= nbPoints || pointIndex < 0 ) {
293 MESSAGE("Error: invalid point index " << pointIndex );
295 return setErrorCode( ERR_READ_BAD_INDEX );
297 if ( idSet.insert( pointIndex ).second ) // unique?
298 myKeyPointIDs.push_back( pointIndex );
302 // ID1 ID2 ... IDn ! 2-4 or 4-8 integers - nodal connectivity of a 2D or 3D element.
304 while ( readLine( fields, lineBeg, clearFields ))
306 myElemPointIDs.push_back( TElemDef() );
307 TElemDef& elemPoints = myElemPointIDs.back();
308 for ( fIt = fields.begin(); fIt != fields.end(); fIt++ )
310 int pointIndex = getInt( *fIt );
311 if ( pointIndex >= nbPoints || pointIndex < 0 ) {
312 MESSAGE("Error: invalid point index " << pointIndex );
314 return setErrorCode( ERR_READ_BAD_INDEX );
316 elemPoints.push_back( pointIndex );
318 // check the nb of nodes in element
320 switch ( elemPoints.size() ) {
321 case 3: if ( !myIs2D ) Ok = false; break;
325 case 8: if ( myIs2D ) Ok = false; break;
329 MESSAGE("Error: wrong nb of nodes in element " << elemPoints.size() );
331 return setErrorCode( ERR_READ_ELEM_POINTS );
334 if ( myElemPointIDs.empty() ) {
335 MESSAGE("Error: no elements");
337 return setErrorCode( ERR_READ_NO_ELEMS );
340 findBoundaryPoints(); // sort key-points
342 return setErrorCode( ERR_OK );
345 //=======================================================================
347 //purpose : Save the loaded pattern into the file <theFileName>
348 //=======================================================================
350 bool SMESH_Pattern::Save (ostream& theFile)
352 MESSAGE(" ::Save(file) " );
354 MESSAGE(" Pattern not loaded ");
355 return setErrorCode( ERR_SAVE_NOT_LOADED );
358 theFile << "!!! SALOME Mesh Pattern file" << endl;
359 theFile << "!!!" << endl;
360 theFile << "!!! Nb of points:" << endl;
361 theFile << myPoints.size() << endl;
365 // theFile.width( 8 );
366 // theFile.setf(ios::fixed);// use 123.45 floating notation
367 // theFile.setf(ios::right);
368 // theFile.flags( theFile.flags() & ~ios::showpoint); // do not show trailing zeros
369 // theFile.setf(ios::showpoint); // do not show trailing zeros
370 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
371 for ( int i = 0; pVecIt != myPoints.end(); pVecIt++, i++ ) {
372 const gp_XYZ & xyz = (*pVecIt).myInitXYZ;
373 theFile << " " << setw( width ) << xyz.X() << " " << setw( width ) << xyz.Y();
374 if ( !myIs2D ) theFile << " " << setw( width ) << xyz.Z();
375 theFile << " !- " << i << endl; // point id to ease reading by a human being
379 theFile << "!!! Indices of " << myKeyPointIDs.size() << " key-points:" << endl;
380 list< int >::const_iterator kpIt = myKeyPointIDs.begin();
381 for ( ; kpIt != myKeyPointIDs.end(); kpIt++ )
382 theFile << " " << *kpIt;
383 if ( !myKeyPointIDs.empty() )
387 theFile << "!!! Indices of points of " << myElemPointIDs.size() << " elements:" << endl;
388 list<TElemDef >::const_iterator epIt = myElemPointIDs.begin();
389 for ( ; epIt != myElemPointIDs.end(); epIt++ )
391 const TElemDef & elemPoints = *epIt;
392 TElemDef::const_iterator iIt = elemPoints.begin();
393 for ( ; iIt != elemPoints.end(); iIt++ )
394 theFile << " " << *iIt;
400 return setErrorCode( ERR_OK );
403 //=======================================================================
404 //function : sortBySize
405 //purpose : sort theListOfList by size
406 //=======================================================================
408 template<typename T> struct TSizeCmp {
409 bool operator ()( const list < T > & l1, const list < T > & l2 )
410 const { return l1.size() < l2.size(); }
413 template<typename T> void sortBySize( list< list < T > > & theListOfList )
415 if ( theListOfList.size() > 2 ) {
416 TSizeCmp< T > SizeCmp;
417 theListOfList.sort( SizeCmp );
421 //=======================================================================
424 //=======================================================================
426 static gp_XY project (const SMDS_MeshNode* theNode,
427 Extrema_GenExtPS & theProjectorPS)
429 gp_Pnt P( theNode->X(), theNode->Y(), theNode->Z() );
430 theProjectorPS.Perform( P );
431 if ( !theProjectorPS.IsDone() ) {
432 MESSAGE( "SMESH_Pattern: point projection FAILED");
435 double u, v, minVal = DBL_MAX;
436 for ( int i = theProjectorPS.NbExt(); i > 0; i-- )
437 if ( theProjectorPS.Value( i ) < minVal ) {
438 minVal = theProjectorPS.Value( i );
439 theProjectorPS.Point( i ).Parameter( u, v );
441 return gp_XY( u, v );
444 //=======================================================================
445 //function : areNodesBound
446 //purpose : true if all nodes of faces are bound to shapes
447 //=======================================================================
449 template <class TFaceIterator> bool areNodesBound( TFaceIterator & faceItr )
451 while ( faceItr->more() )
453 SMDS_ElemIteratorPtr nIt = faceItr->next()->nodesIterator();
454 while ( nIt->more() )
456 const SMDS_MeshNode* node = smdsNode( nIt->next() );
457 SMDS_PositionPtr pos = node->GetPosition();
458 if ( !pos || !pos->GetShapeId() ) {
466 //=======================================================================
467 //function : isMeshBoundToShape
468 //purpose : return true if all 2d elements are bound to shape
469 // if aFaceSubmesh != NULL, then check faces bound to it
470 // else check all faces in aMeshDS
471 //=======================================================================
473 static bool isMeshBoundToShape(SMESHDS_Mesh * aMeshDS,
474 SMESHDS_SubMesh * aFaceSubmesh,
475 const bool isMainShape)
478 // check that all faces are bound to aFaceSubmesh
479 if ( aMeshDS->NbFaces() != aFaceSubmesh->NbElements() )
483 // check face nodes binding
484 if ( aFaceSubmesh ) {
485 SMDS_ElemIteratorPtr fIt = aFaceSubmesh->GetElements();
486 return areNodesBound( fIt );
488 SMDS_FaceIteratorPtr fIt = aMeshDS->facesIterator();
489 return areNodesBound( fIt );
492 //=======================================================================
494 //purpose : Create a pattern from the mesh built on <theFace>.
495 // <theProject>==true makes override nodes positions
496 // on <theFace> computed by mesher
497 //=======================================================================
499 bool SMESH_Pattern::Load (SMESH_Mesh* theMesh,
500 const TopoDS_Face& theFace,
503 MESSAGE(" ::Load(face) " );
507 SMESHDS_Mesh * aMeshDS = theMesh->GetMeshDS();
508 SMESHDS_SubMesh * fSubMesh = aMeshDS->MeshElements( theFace );
509 SMESH_MesherHelper helper( *theMesh );
510 helper.SetSubShape( theFace );
512 int nbNodes = ( !fSubMesh ? 0 : fSubMesh->NbNodes() );
513 int nbElems = ( !fSubMesh ? 0 : fSubMesh->NbElements() );
514 if ( nbElems == 0 && aMeshDS->NbFaces() == 0 )
516 MESSAGE( "No elements bound to the face");
517 return setErrorCode( ERR_LOAD_EMPTY_SUBMESH );
520 TopoDS_Face face = TopoDS::Face( theFace.Oriented( TopAbs_FORWARD ));
522 // check if face is closed
523 bool isClosed = helper.HasSeam();
525 list<TopoDS_Edge> eList;
526 list<TopoDS_Edge>::iterator elIt;
527 SMESH_Block::GetOrderedEdges( face, bidon, eList, myNbKeyPntInBoundary );
529 // check that requested or needed projection is possible
530 bool isMainShape = theMesh->IsMainShape( face );
531 bool needProject = !isMeshBoundToShape( aMeshDS, fSubMesh, isMainShape );
532 bool canProject = ( nbElems ? true : isMainShape );
534 canProject = false; // so far
536 if ( ( theProject || needProject ) && !canProject )
537 return setErrorCode( ERR_LOADF_CANT_PROJECT );
539 Extrema_GenExtPS projector;
540 GeomAdaptor_Surface aSurface( BRep_Tool::Surface( face ));
541 if ( theProject || needProject )
542 projector.Initialize( aSurface, 20,20, 1e-5,1e-5 );
545 TNodePointIDMap nodePointIDMap;
546 TNodePointIDMap closeNodePointIDMap; // for nodes on seam edges
550 MESSAGE("Project the submesh");
551 // ---------------------------------------------------------------
552 // The case where the submesh is projected to theFace
553 // ---------------------------------------------------------------
556 list< const SMDS_MeshElement* > faces;
558 SMDS_ElemIteratorPtr fIt = fSubMesh->GetElements();
559 while ( fIt->more() ) {
560 const SMDS_MeshElement* f = fIt->next();
561 if ( f && f->GetType() == SMDSAbs_Face )
562 faces.push_back( f );
566 SMDS_FaceIteratorPtr fIt = aMeshDS->facesIterator();
567 while ( fIt->more() )
568 faces.push_back( fIt->next() );
571 // put nodes of all faces into the nodePointIDMap and fill myElemPointIDs
572 list< const SMDS_MeshElement* >::iterator fIt = faces.begin();
573 for ( ; fIt != faces.end(); ++fIt )
575 myElemPointIDs.push_back( TElemDef() );
576 TElemDef& elemPoints = myElemPointIDs.back();
577 SMDS_ElemIteratorPtr nIt = (*fIt)->nodesIterator();
578 while ( nIt->more() )
580 const SMDS_MeshElement* node = nIt->next();
581 TNodePointIDMap::iterator nIdIt = nodePointIDMap.find( node );
582 if ( nIdIt == nodePointIDMap.end() )
584 elemPoints.push_back( iPoint );
585 nodePointIDMap.insert( make_pair( node, iPoint++ ));
588 elemPoints.push_back( (*nIdIt).second );
591 myPoints.resize( iPoint );
593 // project all nodes of 2d elements to theFace
594 TNodePointIDMap::iterator nIdIt = nodePointIDMap.begin();
595 for ( ; nIdIt != nodePointIDMap.end(); nIdIt++ )
597 const SMDS_MeshNode* node = smdsNode( (*nIdIt).first );
598 TPoint * p = & myPoints[ (*nIdIt).second ];
599 p->myInitUV = project( node, projector );
600 p->myInitXYZ.SetCoord( p->myInitUV.X(), p->myInitUV.Y(), 0 );
602 // find key-points: the points most close to UV of vertices
603 TopExp_Explorer vExp( face, TopAbs_VERTEX );
604 set<int> foundIndices;
605 for ( ; vExp.More(); vExp.Next() ) {
606 const TopoDS_Vertex v = TopoDS::Vertex( vExp.Current() );
607 gp_Pnt2d uv = BRep_Tool::Parameters( v, face );
608 double minDist = DBL_MAX;
610 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
611 for ( iPoint = 0; pVecIt != myPoints.end(); pVecIt++, iPoint++ ) {
612 double dist = uv.SquareDistance( (*pVecIt).myInitUV );
613 if ( dist < minDist ) {
618 if ( foundIndices.insert( index ).second ) // unique?
619 myKeyPointIDs.push_back( index );
621 myIsBoundaryPointsFound = false;
626 // ---------------------------------------------------------------------
627 // The case where a pattern is being made from the mesh built by mesher
628 // ---------------------------------------------------------------------
630 // Load shapes in the consequent order and count nb of points
633 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ ) {
634 int nbV = myShapeIDMap.Extent();
635 myShapeIDMap.Add( TopExp::FirstVertex( *elIt, true ));
636 bool added = ( nbV < myShapeIDMap.Extent() );
637 if ( !added ) { // vertex encountered twice
638 // a seam vertex have two corresponding key points
639 myShapeIDMap.Add( TopExp::FirstVertex( *elIt, true ).Reversed());
642 if ( SMESHDS_SubMesh * eSubMesh = aMeshDS->MeshElements( *elIt ))
643 nbNodes += eSubMesh->NbNodes() + 1;
646 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ )
647 myShapeIDMap.Add( *elIt );
649 myShapeIDMap.Add( face );
651 myPoints.resize( nbNodes );
653 // Load U of points on edges
655 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ )
657 TopoDS_Edge & edge = *elIt;
658 list< TPoint* > & ePoints = getShapePoints( edge );
660 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface( edge, face, f, l );
661 bool isForward = ( edge.Orientation() == TopAbs_FORWARD );
663 TopoDS_Shape v1 = TopExp::FirstVertex( edge, true ); // always FORWARD
664 TopoDS_Shape v2 = TopExp::LastVertex( edge, true ); // always REVERSED
665 // to make adjacent edges share key-point, we make v2 FORWARD too
666 // (as we have different points for same shape with different orienation)
669 // on closed face we must have REVERSED some of seam vertices
671 if ( helper.IsSeamShape( edge ) ) {
672 if ( helper.IsRealSeam( edge ) && !isForward ) {
673 // reverse on reversed SEAM edge
678 else { // on CLOSED edge (i.e. having one vertex with different orienations)
679 for ( int is2 = 0; is2 < 2; ++is2 ) {
680 TopoDS_Shape & v = is2 ? v2 : v1;
681 if ( helper.IsRealSeam( v ) ) {
682 // reverse or not depending on orientation of adjacent seam
684 list<TopoDS_Edge>::iterator eIt2 = elIt;
686 seam = ( ++eIt2 == eList.end() ? eList.front() : *eIt2 );
688 seam = ( eIt2 == eList.begin() ? eList.back() : *(--eIt2) );
689 if ( seam.Orientation() == TopAbs_REVERSED )
696 // the forward key-point
697 list< TPoint* > * vPoint = & getShapePoints( v1 );
698 if ( vPoint->empty() )
700 SMESHDS_SubMesh * vSubMesh = aMeshDS->MeshElements( v1 );
701 if ( vSubMesh && vSubMesh->NbNodes() ) {
702 myKeyPointIDs.push_back( iPoint );
703 SMDS_NodeIteratorPtr nIt = vSubMesh->GetNodes();
704 const SMDS_MeshNode* node = nIt->next();
705 if ( v1.Orientation() == TopAbs_REVERSED )
706 closeNodePointIDMap.insert( make_pair( node, iPoint ));
708 nodePointIDMap.insert( make_pair( node, iPoint ));
710 TPoint* keyPoint = &myPoints[ iPoint++ ];
711 vPoint->push_back( keyPoint );
713 keyPoint->myInitUV = project( node, projector );
715 keyPoint->myInitUV = C2d->Value( isForward ? f : l ).XY();
716 keyPoint->myInitXYZ.SetCoord (keyPoint->myInitUV.X(), keyPoint->myInitUV.Y(), 0);
719 if ( !vPoint->empty() )
720 ePoints.push_back( vPoint->front() );
723 SMESHDS_SubMesh * eSubMesh = aMeshDS->MeshElements( edge );
724 if ( eSubMesh && eSubMesh->NbNodes() )
726 // loop on nodes of an edge: sort them by param on edge
727 typedef map < double, const SMDS_MeshNode* > TParamNodeMap;
728 TParamNodeMap paramNodeMap;
729 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
730 while ( nIt->more() )
732 const SMDS_MeshNode* node = smdsNode( nIt->next() );
733 const SMDS_EdgePosition* epos =
734 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
735 double u = epos->GetUParameter();
736 paramNodeMap.insert( make_pair( u, node ));
738 if ( paramNodeMap.size() != eSubMesh->NbNodes() ) {
739 // wrong U on edge, project
741 BRepAdaptor_Curve aCurve( edge );
742 proj.Initialize( aCurve, f, l );
743 paramNodeMap.clear();
744 nIt = eSubMesh->GetNodes();
745 for ( int iNode = 0; nIt->more(); ++iNode ) {
746 const SMDS_MeshNode* node = smdsNode( nIt->next() );
747 proj.Perform( gp_Pnt( node->X(), node->Y(), node->Z()));
749 if ( proj.IsDone() ) {
750 for ( int i = 1, nb = proj.NbExt(); i <= nb; ++i )
751 if ( proj.IsMin( i )) {
752 u = proj.Point( i ).Parameter();
756 u = isForward ? iNode : eSubMesh->NbNodes() - iNode;
758 paramNodeMap.insert( make_pair( u, node ));
761 // put U in [0,1] so that the first key-point has U==0
762 bool isSeam = helper.IsRealSeam( edge );
764 TParamNodeMap::iterator unIt = paramNodeMap.begin();
765 TParamNodeMap::reverse_iterator unRIt = paramNodeMap.rbegin();
766 while ( unIt != paramNodeMap.end() )
768 TPoint* p = & myPoints[ iPoint ];
769 ePoints.push_back( p );
770 const SMDS_MeshNode* node = isForward ? (*unIt).second : (*unRIt).second;
771 if ( isSeam && !isForward )
772 closeNodePointIDMap.insert( make_pair( node, iPoint ));
774 nodePointIDMap.insert ( make_pair( node, iPoint ));
777 p->myInitUV = project( node, projector );
779 double u = isForward ? (*unIt).first : (*unRIt).first;
780 p->myInitU = isForward ? (( u - f ) / du ) : ( 1.0 - ( u - f ) / du );
781 p->myInitUV = C2d->Value( u ).XY();
783 p->myInitXYZ.SetCoord( p->myInitUV.X(), p->myInitUV.Y(), 0 );
788 // the reverse key-point
789 vPoint = & getShapePoints( v2 );
790 if ( vPoint->empty() )
792 SMESHDS_SubMesh * vSubMesh = aMeshDS->MeshElements( v2 );
793 if ( vSubMesh && vSubMesh->NbNodes() ) {
794 myKeyPointIDs.push_back( iPoint );
795 SMDS_NodeIteratorPtr nIt = vSubMesh->GetNodes();
796 const SMDS_MeshNode* node = nIt->next();
797 if ( v2.Orientation() == TopAbs_REVERSED )
798 closeNodePointIDMap.insert( make_pair( node, iPoint ));
800 nodePointIDMap.insert( make_pair( node, iPoint ));
802 TPoint* keyPoint = &myPoints[ iPoint++ ];
803 vPoint->push_back( keyPoint );
805 keyPoint->myInitUV = project( node, projector );
807 keyPoint->myInitUV = C2d->Value( isForward ? l : f ).XY();
808 keyPoint->myInitXYZ.SetCoord( keyPoint->myInitUV.X(), keyPoint->myInitUV.Y(), 0 );
811 if ( !vPoint->empty() )
812 ePoints.push_back( vPoint->front() );
814 // compute U of edge-points
817 double totalDist = 0;
818 list< TPoint* >::iterator pIt = ePoints.begin();
819 TPoint* prevP = *pIt;
820 prevP->myInitU = totalDist;
821 for ( pIt++; pIt != ePoints.end(); pIt++ ) {
823 totalDist += ( p->myInitUV - prevP->myInitUV ).Modulus();
824 p->myInitU = totalDist;
827 if ( totalDist > DBL_MIN)
828 for ( pIt = ePoints.begin(); pIt != ePoints.end(); pIt++ ) {
830 p->myInitU /= totalDist;
833 } // loop on edges of a wire
835 // Load in-face points and elements
837 if ( fSubMesh && fSubMesh->NbElements() )
839 list< TPoint* > & fPoints = getShapePoints( face );
840 SMDS_NodeIteratorPtr nIt = fSubMesh->GetNodes();
841 while ( nIt->more() )
843 const SMDS_MeshNode* node = smdsNode( nIt->next() );
844 nodePointIDMap.insert( make_pair( node, iPoint ));
845 TPoint* p = &myPoints[ iPoint++ ];
846 fPoints.push_back( p );
848 p->myInitUV = project( node, projector );
850 const SMDS_FacePosition* pos =
851 static_cast<const SMDS_FacePosition*>(node->GetPosition().get());
852 p->myInitUV.SetCoord( pos->GetUParameter(), pos->GetVParameter() );
854 p->myInitXYZ.SetCoord( p->myInitUV.X(), p->myInitUV.Y(), 0 );
857 TNodePointIDMap::iterator n_id, not_found = closeNodePointIDMap.end();
858 SMDS_ElemIteratorPtr elemIt = fSubMesh->GetElements();
859 while ( elemIt->more() )
861 const SMDS_MeshElement* elem = elemIt->next();
862 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
863 myElemPointIDs.push_back( TElemDef() );
864 TElemDef& elemPoints = myElemPointIDs.back();
865 // find point indices corresponding to element nodes
866 while ( nIt->more() )
868 const SMDS_MeshNode* node = smdsNode( nIt->next() );
869 iPoint = nodePointIDMap[ node ]; // point index of interest
870 // for a node on a seam edge there are two points
871 if ( helper.IsRealSeam( node->GetPosition()->GetShapeId() ) &&
872 ( n_id = closeNodePointIDMap.find( node )) != not_found )
874 TPoint & p1 = myPoints[ iPoint ];
875 TPoint & p2 = myPoints[ n_id->second ];
876 // Select point closest to the rest nodes of element in UV space
877 SMDS_ElemIteratorPtr nIt2 = elem->nodesIterator();
878 const SMDS_MeshNode* notSeamNode = 0;
879 // find node not on a seam edge
880 while ( nIt2->more() && !notSeamNode ) {
881 const SMDS_MeshNode* n = smdsNode( nIt2->next() );
882 if ( !helper.IsSeamShape( n->GetPosition()->GetShapeId() ))
885 gp_Pnt2d uv = helper.GetNodeUV( theFace, node, notSeamNode );
886 double dist1 = uv.SquareDistance( p1.myInitUV );
887 double dist2 = uv.SquareDistance( p2.myInitUV );
889 iPoint = n_id->second;
891 elemPoints.push_back( iPoint );
896 myIsBoundaryPointsFound = true;
899 // Assure that U range is proportional to V range
902 vector< TPoint >::iterator pVecIt = myPoints.begin();
903 for ( ; pVecIt != myPoints.end(); pVecIt++ )
904 bndBox.Add( gp_Pnt2d( (*pVecIt).myInitUV ));
905 double minU, minV, maxU, maxV;
906 bndBox.Get( minU, minV, maxU, maxV );
907 double dU = maxU - minU, dV = maxV - minV;
908 if ( dU <= DBL_MIN || dV <= DBL_MIN ) {
911 // define where is the problem, in the face or in the mesh
912 TopExp_Explorer vExp( face, TopAbs_VERTEX );
913 for ( ; vExp.More(); vExp.Next() ) {
914 gp_Pnt2d uv = BRep_Tool::Parameters( TopoDS::Vertex( vExp.Current() ), face );
917 bndBox.Get( minU, minV, maxU, maxV );
918 dU = maxU - minU, dV = maxV - minV;
919 if ( dU <= DBL_MIN || dV <= DBL_MIN )
921 return setErrorCode( ERR_LOADF_NARROW_FACE );
923 // mesh is projected onto a line, e.g.
924 return setErrorCode( ERR_LOADF_CANT_PROJECT );
926 double ratio = dU / dV, maxratio = 3, scale;
928 if ( ratio > maxratio ) {
929 scale = ratio / maxratio;
932 else if ( ratio < 1./maxratio ) {
933 scale = maxratio / ratio;
938 for ( pVecIt = myPoints.begin(); pVecIt != myPoints.end(); pVecIt++ ) {
939 TPoint & p = *pVecIt;
940 p.myInitUV.SetCoord( iCoord, p.myInitUV.Coord( iCoord ) * scale );
941 p.myInitXYZ.SetCoord( p.myInitUV.X(), p.myInitUV.Y(), 0 );
944 if ( myElemPointIDs.empty() ) {
945 MESSAGE( "No elements bound to the face");
946 return setErrorCode( ERR_LOAD_EMPTY_SUBMESH );
949 return setErrorCode( ERR_OK );
952 //=======================================================================
953 //function : computeUVOnEdge
954 //purpose : compute coordinates of points on theEdge
955 //=======================================================================
957 void SMESH_Pattern::computeUVOnEdge (const TopoDS_Edge& theEdge,
958 const list< TPoint* > & ePoints )
960 bool isForward = ( theEdge.Orientation() == TopAbs_FORWARD );
962 Handle(Geom2d_Curve) C2d =
963 BRep_Tool::CurveOnSurface( theEdge, TopoDS::Face( myShape ), f, l );
965 ePoints.back()->myInitU = 1.0;
966 list< TPoint* >::const_iterator pIt = ePoints.begin();
967 for ( pIt++; pIt != ePoints.end(); pIt++ )
969 TPoint* point = *pIt;
971 double du = ( isForward ? point->myInitU : 1 - point->myInitU );
972 point->myU = ( f * ( 1 - du ) + l * du );
974 point->myUV = C2d->Value( point->myU ).XY();
978 //=======================================================================
979 //function : intersectIsolines
981 //=======================================================================
983 static bool intersectIsolines(const gp_XY& uv11, const gp_XY& uv12, const double r1,
984 const gp_XY& uv21, const gp_XY& uv22, const double r2,
988 gp_XY loc1 = uv11 * ( 1 - r1 ) + uv12 * r1;
989 gp_XY loc2 = uv21 * ( 1 - r2 ) + uv22 * r2;
990 resUV = 0.5 * ( loc1 + loc2 );
991 //isDeformed = ( loc1 - loc2 ).SquareModulus() > 1e-8;
992 // SKL 26.07.2007 for NPAL16567
993 double d1 = (uv11-uv12).Modulus();
994 double d2 = (uv21-uv22).Modulus();
995 // double delta = d1*d2*1e-6; PAL17233
996 double delta = min( d1, d2 ) / 10.;
997 isDeformed = ( loc1 - loc2 ).SquareModulus() > delta * delta;
999 // double len1 = ( uv11 - uv12 ).Modulus();
1000 // double len2 = ( uv21 - uv22 ).Modulus();
1001 // resUV = loc1 * len2 / ( len1 + len2 ) + loc2 * len1 / ( len1 + len2 );
1005 // gp_Lin2d line1( uv11, uv12 - uv11 );
1006 // gp_Lin2d line2( uv21, uv22 - uv21 );
1007 // double angle = Abs( line1.Angle( line2 ) );
1009 // IntAna2d_AnaIntersection inter;
1010 // inter.Perform( line1.Normal( loc1 ), line2.Normal( loc2 ) );
1011 // if ( inter.IsDone() && inter.NbPoints() == 1 )
1013 // gp_Pnt2d interUV = inter.Point(1).Value();
1014 // resUV += interUV.XY();
1015 // inter.Perform( line1, line2 );
1016 // interUV = inter.Point(1).Value();
1017 // resUV += interUV.XY();
1022 MESSAGE("intersectIsolines(), d1 = " << d1 << ", d2 = " << d2 << ", delta = " << delta <<
1023 ", " << (loc1 - loc2).SquareModulus() << " > " << delta * delta);
1028 //=======================================================================
1029 //function : compUVByIsoIntersection
1031 //=======================================================================
1033 bool SMESH_Pattern::compUVByIsoIntersection (const list< list< TPoint* > >& theBndPoints,
1034 const gp_XY& theInitUV,
1036 bool & theIsDeformed )
1038 // compute UV by intersection of 2 iso lines
1039 //gp_Lin2d isoLine[2];
1040 gp_XY uv1[2], uv2[2];
1042 const double zero = DBL_MIN;
1043 for ( int iIso = 0; iIso < 2; iIso++ )
1045 // to build an iso line:
1046 // find 2 pairs of consequent edge-points such that the range of their
1047 // initial parameters encloses the in-face point initial parameter
1048 gp_XY UV[2], initUV[2];
1049 int nbUV = 0, iCoord = iIso + 1;
1050 double initParam = theInitUV.Coord( iCoord );
1052 list< list< TPoint* > >::const_iterator bndIt = theBndPoints.begin();
1053 for ( ; bndIt != theBndPoints.end(); bndIt++ )
1055 const list< TPoint* > & bndPoints = * bndIt;
1056 TPoint* prevP = bndPoints.back(); // this is the first point
1057 list< TPoint* >::const_iterator pIt = bndPoints.begin();
1058 bool coincPrev = false;
1059 // loop on the edge-points
1060 for ( ; pIt != bndPoints.end(); pIt++ )
1062 double paramDiff = initParam - (*pIt)->myInitUV.Coord( iCoord );
1063 double prevParamDiff = initParam - prevP->myInitUV.Coord( iCoord );
1064 double sumOfDiff = Abs(prevParamDiff) + Abs(paramDiff);
1065 if (!coincPrev && // ignore if initParam coincides with prev point param
1066 sumOfDiff > zero && // ignore if both points coincide with initParam
1067 prevParamDiff * paramDiff <= zero )
1069 // find UV in parametric space of theFace
1070 double r = Abs(prevParamDiff) / sumOfDiff;
1071 gp_XY uvInit = (*pIt)->myInitUV * r + prevP->myInitUV * ( 1 - r );
1074 // throw away uv most distant from <theInitUV>
1075 gp_XY vec0 = initUV[0] - theInitUV;
1076 gp_XY vec1 = initUV[1] - theInitUV;
1077 gp_XY vec = uvInit - theInitUV;
1078 bool isBetween = ( vec0 * vec1 < 0 ); // is theInitUV between initUV[0] and initUV[1]
1079 double dist0 = vec0.SquareModulus();
1080 double dist1 = vec1.SquareModulus();
1081 double dist = vec .SquareModulus();
1082 if ( !isBetween || dist < dist0 || dist < dist1 ) {
1083 i = ( dist0 < dist1 ? 1 : 0 );
1084 if ( isBetween && vec.Dot( i ? vec1 : vec0 ) < 0 )
1085 i = 3; // theInitUV must remain between
1089 initUV[ i ] = uvInit;
1090 UV[ i ] = (*pIt)->myUV * r + prevP->myUV * ( 1 - r );
1092 coincPrev = ( Abs(paramDiff) <= zero );
1099 if ( nbUV < 2 || (UV[0]-UV[1]).SquareModulus() <= DBL_MIN*DBL_MIN ) {
1100 MESSAGE(" consequent edge-points not found, nb UV found: " << nbUV <<
1101 ", for point: " << theInitUV.X() <<" " << theInitUV.Y() );
1102 return setErrorCode( ERR_APPLF_BAD_TOPOLOGY );
1104 // an iso line should be normal to UV[0] - UV[1] direction
1105 // and be located at the same relative distance as from initial ends
1106 //gp_Lin2d iso( UV[0], UV[0] - UV[1] );
1108 (initUV[0]-theInitUV).Modulus() / (initUV[0]-initUV[1]).Modulus();
1109 //gp_Pnt2d isoLoc = UV[0] * ( 1 - r ) + UV[1] * r;
1110 //isoLine[ iIso ] = iso.Normal( isoLoc );
1111 uv1[ iIso ] = UV[0];
1112 uv2[ iIso ] = UV[1];
1115 if ( !intersectIsolines( uv1[0], uv2[0], ratio[0],
1116 uv1[1], uv2[1], ratio[1], theUV, theIsDeformed )) {
1117 MESSAGE(" Cant intersect isolines for a point "<<theInitUV.X()<<", "<<theInitUV.Y());
1118 return setErrorCode( ERR_APPLF_BAD_TOPOLOGY );
1125 // ==========================================================
1126 // structure representing a node of a grid of iso-poly-lines
1127 // ==========================================================
1134 gp_Dir2d myDir[2]; // boundary tangent dir for boundary nodes, iso dir for internal ones
1135 TIsoNode* myNext[4]; // order: (iDir=0,isForward=0), (1,0), (0,1), (1,1)
1136 TIsoNode* myBndNodes[4]; // order: (iDir=0,i=0), (1,0), (0,1), (1,1)
1137 TIsoNode(double initU, double initV):
1138 myInitUV( initU, initV ), myUV( 1e100, 1e100 ), myIsMovable(true)
1139 { myNext[0] = myNext[1] = myNext[2] = myNext[3] = 0; }
1140 bool IsUVComputed() const
1141 { return myUV.X() != 1e100; }
1142 bool IsMovable() const
1143 { return myIsMovable && myNext[0] && myNext[1] && myNext[2] && myNext[3]; }
1144 void SetNotMovable()
1145 { myIsMovable = false; }
1146 void SetBoundaryNode(TIsoNode* node, int iDir, int i)
1147 { myBndNodes[ iDir + i * 2 ] = node; }
1148 TIsoNode* GetBoundaryNode(int iDir, int i)
1149 { return myBndNodes[ iDir + i * 2 ]; }
1150 void SetNext(TIsoNode* node, int iDir, int isForward)
1151 { myNext[ iDir + isForward * 2 ] = node; }
1152 TIsoNode* GetNext(int iDir, int isForward)
1153 { return myNext[ iDir + isForward * 2 ]; }
1156 //=======================================================================
1157 //function : getNextNode
1159 //=======================================================================
1161 static inline TIsoNode* getNextNode(const TIsoNode* node, int dir )
1163 TIsoNode* n = node->myNext[ dir ];
1164 if ( n && !n->IsUVComputed()/* && node->IsMovable()*/ ) {
1165 n = 0;//node->myBndNodes[ dir ];
1166 // MESSAGE("getNextNode: use bnd for node "<<
1167 // node->myInitUV.X()<<" "<<node->myInitUV.Y());
1171 //=======================================================================
1172 //function : checkQuads
1173 //purpose : check if newUV destortes quadrangles around node,
1174 // and if ( crit == FIX_OLD ) fix newUV in this case
1175 //=======================================================================
1177 enum { CHECK_NEW_IN, CHECK_NEW_OK, FIX_OLD };
1179 static bool checkQuads (const TIsoNode* node,
1181 const bool reversed,
1182 const int crit = FIX_OLD,
1183 double fixSize = 0.)
1185 gp_XY oldUV = node->myUV, oldUVFixed[4], oldUVImpr[4];
1186 int nbOldFix = 0, nbOldImpr = 0;
1187 double newBadRate = 0, oldBadRate = 0;
1188 bool newIsOk = true, newIsIn = true, oldIsIn = true, oldIsOk = true;
1189 int i, dir1 = 0, dir2 = 3;
1190 for ( ; dir1 < 4; dir1++, dir2++ ) // loop on 4 quadrangles around <node>
1192 if ( dir2 > 3 ) dir2 = 0;
1194 // walking counterclockwise around a quad,
1195 // nodes are in the order: node, n[0], n[1], n[2]
1196 n[0] = getNextNode( node, dir1 );
1197 n[2] = getNextNode( node, dir2 );
1198 if ( !n[0] || !n[2] ) continue;
1199 n[1] = getNextNode( n[0], dir2 );
1200 if ( !n[1] ) n[1] = getNextNode( n[2], dir1 );
1201 bool isTriangle = ( !n[1] );
1203 TIsoNode* tmp = n[0]; n[0] = n[2]; n[2] = tmp;
1205 // if ( fixSize != 0 ) {
1206 // cout<<"NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<" UV: "<<node->myUV.X()<<" "<<node->myUV.Y()<<endl;
1207 // cout<<"\t0: "<<n[0]->myInitUV.X()<<" "<<n[0]->myInitUV.Y()<<" UV: "<<n[0]->myUV.X()<<" "<<n[0]->myUV.Y()<<endl;
1208 // cout<<"\t1: "<<n[1]->myInitUV.X()<<" "<<n[1]->myInitUV.Y()<<" UV: "<<n[1]->myUV.X()<<" "<<n[1]->myUV.Y()<<endl;
1209 // cout<<"\t2: "<<n[2]->myInitUV.X()<<" "<<n[2]->myInitUV.Y()<<" UV: "<<n[2]->myUV.X()<<" "<<n[2]->myUV.Y()<<endl;
1211 // check if a quadrangle is degenerated
1213 ((( n[0]->myUV - n[1]->myUV ).SquareModulus() <= DBL_MIN ) ||
1214 (( n[2]->myUV - n[1]->myUV ).SquareModulus() <= DBL_MIN )))
1217 ( n[0]->myUV - n[2]->myUV ).SquareModulus() <= DBL_MIN )
1220 // find min size of the diagonal node-n[1]
1221 double minDiag = fixSize;
1222 if ( minDiag == 0. ) {
1223 double maxLen2 = ( node->myUV - n[0]->myUV ).SquareModulus();
1224 if ( !isTriangle ) {
1225 maxLen2 = Max( maxLen2, ( n[0]->myUV - n[1]->myUV ).SquareModulus() );
1226 maxLen2 = Max( maxLen2, ( n[1]->myUV - n[2]->myUV ).SquareModulus() );
1228 maxLen2 = Max( maxLen2, ( n[2]->myUV - node->myUV ).SquareModulus() );
1229 minDiag = sqrt( maxLen2 ) * PI / 60.; // ~ maxLen * Sin( 3 deg )
1232 // check if newUV is behind 3 dirs: n[0]-n[1], n[1]-n[2] and n[0]-n[2]
1233 // ( behind means "to the right of")
1235 // 1. newUV is not behind 01 and 12 dirs
1236 // 2. or newUV is not behind 02 dir and n[2] is convex
1237 bool newIn[3] = { true, true, true }, newOk[3] = { true, true, true };
1238 bool wasIn[3] = { true, true, true }, wasOk[3] = { true, true, true };
1239 gp_Vec2d moveVec[3], outVec[3];
1240 for ( i = isTriangle ? 2 : 0; i < 3; i++ )
1242 bool isDiag = ( i == 2 );
1243 if ( isDiag && newOk[0] && newOk[1] && !isTriangle )
1247 sideDir = gp_Vec2d( n[0]->myUV, n[2]->myUV );
1249 sideDir = gp_Vec2d( n[i]->myUV, n[i+1]->myUV );
1251 gp_Vec2d outDir( sideDir.Y(), -sideDir.X() ); // to the right
1253 gp_Vec2d newDir( n[i]->myUV, newUV );
1254 gp_Vec2d oldDir( n[i]->myUV, oldUV );
1256 if ( newIsOk ) newOk[i] = ( outDir * newDir < -minDiag );
1257 if ( newIsIn ) newIn[i] = ( outDir * newDir < 0 );
1258 if ( crit == FIX_OLD ) {
1259 wasIn[i] = ( outDir * oldDir < 0 );
1260 wasOk[i] = ( outDir * oldDir < -minDiag );
1262 newBadRate += outDir * newDir;
1264 oldBadRate += outDir * oldDir;
1267 double oldDist = - outDir * oldDir;//, l2 = outDir * newDir;
1268 // double r = ( l1 - minDiag ) / ( l1 + l2 );
1269 // moveVec[i] = r * gp_Vec2d( node->myUV, newUV );
1270 moveVec[i] = ( oldDist - minDiag ) * outDir;
1275 // check if n[2] is convex
1278 convex = ( outVec[0] * gp_Vec2d( n[1]->myUV, n[2]->myUV ) < 0 );
1280 bool isNewOk = ( newOk[0] && newOk[1] ) || ( newOk[2] && convex );
1281 bool isNewIn = ( newIn[0] && newIn[1] ) || ( newIn[2] && convex );
1282 newIsOk = ( newIsOk && isNewOk );
1283 newIsIn = ( newIsIn && isNewIn );
1285 if ( crit != FIX_OLD ) {
1286 if ( crit == CHECK_NEW_OK && !newIsOk ) break;
1287 if ( crit == CHECK_NEW_IN && !newIsIn ) break;
1291 bool isOldIn = ( wasIn[0] && wasIn[1] ) || ( wasIn[2] && convex );
1292 bool isOldOk = ( wasOk[0] && wasOk[1] ) || ( wasOk[2] && convex );
1293 oldIsIn = ( oldIsIn && isOldIn );
1294 oldIsOk = ( oldIsOk && isOldIn );
1297 if ( !isOldIn ) { // node is outside a quadrangle
1298 // move newUV inside a quadrangle
1299 //MESSAGE("Quad "<< dir1 << " WAS IN " << wasIn[0]<<" "<<wasIn[1]<<" "<<wasIn[2]);
1300 // node and newUV are outside: push newUV inside
1302 if ( convex || isTriangle ) {
1303 uv = 0.5 * ( n[0]->myUV + n[2]->myUV ) - minDiag * outVec[2].XY();
1306 gp_Vec2d out = outVec[0].Normalized() + outVec[1].Normalized();
1307 double outSize = out.Magnitude();
1308 if ( outSize > DBL_MIN )
1311 out.SetCoord( -outVec[1].Y(), outVec[1].X() );
1312 uv = n[1]->myUV - minDiag * out.XY();
1314 oldUVFixed[ nbOldFix++ ] = uv;
1315 //node->myUV = newUV;
1317 else if ( !isOldOk ) {
1318 // try to fix old UV: move node inside as less as possible
1319 //MESSAGE("Quad "<< dir1 << " old is BAD, try to fix old, minDiag: "<< minDiag);
1320 gp_XY uv1, uv2 = node->myUV;
1321 for ( i = isTriangle ? 2 : 0; i < 3; i++ ) // mark not computed vectors
1323 moveVec[ i ].SetCoord( 1, 2e100); // not use this vector
1324 while ( !isOldOk ) {
1325 // find the least moveVec
1327 double minMove2 = 1e100;
1328 for ( i = isTriangle ? 2 : 0; i < 3; i++ )
1330 if ( moveVec[i].Coord(1) < 1e100 ) {
1331 double move2 = moveVec[i].SquareMagnitude();
1332 if ( move2 < minMove2 ) {
1341 // move node to newUV
1342 uv1 = node->myUV + moveVec[ iMin ].XY();
1343 uv2 += moveVec[ iMin ].XY();
1344 moveVec[ iMin ].SetCoord( 1, 2e100); // not use this vector more
1345 // check if uv1 is ok
1346 for ( i = isTriangle ? 2 : 0; i < 3; i++ )
1347 wasOk[i] = ( outVec[i] * gp_Vec2d( n[i]->myUV, uv1 ) < -minDiag );
1348 isOldOk = ( wasOk[0] && wasOk[1] ) || ( wasOk[2] && convex );
1350 oldUVImpr[ nbOldImpr++ ] = uv1;
1352 // check if uv2 is ok
1353 for ( i = isTriangle ? 2 : 0; i < 3; i++ )
1354 wasOk[i] = ( outVec[i] * gp_Vec2d( n[i]->myUV, uv2 ) < -minDiag );
1355 isOldOk = ( wasOk[0] && wasOk[1] ) || ( wasOk[2] && convex );
1357 oldUVImpr[ nbOldImpr++ ] = uv2;
1362 } // loop on 4 quadrangles around <node>
1364 if ( crit == CHECK_NEW_OK )
1366 if ( crit == CHECK_NEW_IN )
1375 if ( oldIsIn && nbOldImpr ) {
1376 // MESSAGE(" Try to improve UV, init: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<
1377 // " uv: "<<oldUV.X()<<" "<<oldUV.Y() );
1378 gp_XY uv = oldUVImpr[ 0 ];
1379 for ( int i = 1; i < nbOldImpr; i++ )
1380 uv += oldUVImpr[ i ];
1382 if ( checkQuads( node, uv, reversed, CHECK_NEW_OK )) {
1387 //MESSAGE(" Cant improve UV, uv: "<<uv.X()<<" "<<uv.Y());
1390 if ( !oldIsIn && nbOldFix ) {
1391 // MESSAGE(" Try to fix UV, init: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<
1392 // " uv: "<<oldUV.X()<<" "<<oldUV.Y() );
1393 gp_XY uv = oldUVFixed[ 0 ];
1394 for ( int i = 1; i < nbOldFix; i++ )
1395 uv += oldUVFixed[ i ];
1397 if ( checkQuads( node, uv, reversed, CHECK_NEW_IN )) {
1402 //MESSAGE(" Cant fix UV, uv: "<<uv.X()<<" "<<uv.Y());
1405 if ( newIsIn && oldIsIn )
1406 newUV = ( newBadRate < oldBadRate ) ? newUV : oldUV;
1407 else if ( !newIsIn )
1414 //=======================================================================
1415 //function : compUVByElasticIsolines
1416 //purpose : compute UV as nodes of iso-poly-lines consisting of
1417 // segments keeping relative size as in the pattern
1418 //=======================================================================
1419 //#define DEB_COMPUVBYELASTICISOLINES
1420 bool SMESH_Pattern::
1421 compUVByElasticIsolines(const list< list< TPoint* > >& theBndPoints,
1422 const list< TPoint* >& thePntToCompute)
1424 return false; // PAL17233
1425 //cout << "============================== KEY POINTS =============================="<<endl;
1426 // list< int >::iterator kpIt = myKeyPointIDs.begin();
1427 // for ( ; kpIt != myKeyPointIDs.end(); kpIt++ ) {
1428 // TPoint& p = myPoints[ *kpIt ];
1429 // cout << "INIT: " << p.myInitUV.X() << " " << p.myInitUV.Y() <<
1430 // " UV: " << p.myUV.X() << " " << p.myUV.Y() << endl;
1432 //cout << "=============================="<<endl;
1434 // Define parameters of iso-grid nodes in U and V dir
1436 set< double > paramSet[ 2 ];
1437 list< list< TPoint* > >::const_iterator pListIt;
1438 list< TPoint* >::const_iterator pIt;
1439 for ( pListIt = theBndPoints.begin(); pListIt != theBndPoints.end(); pListIt++ ) {
1440 const list< TPoint* > & pList = * pListIt;
1441 for ( pIt = pList.begin(); pIt != pList.end(); pIt++ ) {
1442 paramSet[0].insert( (*pIt)->myInitUV.X() );
1443 paramSet[1].insert( (*pIt)->myInitUV.Y() );
1446 for ( pIt = thePntToCompute.begin(); pIt != thePntToCompute.end(); pIt++ ) {
1447 paramSet[0].insert( (*pIt)->myInitUV.X() );
1448 paramSet[1].insert( (*pIt)->myInitUV.Y() );
1450 // unite close parameters and split too long segments
1453 for ( iDir = 0; iDir < 2; iDir++ )
1455 set< double > & params = paramSet[ iDir ];
1456 double range = ( *params.rbegin() - *params.begin() );
1457 double toler = range / 1e6;
1458 tol[ iDir ] = toler;
1459 // double maxSegment = range / params.size() / 2.;
1461 // set< double >::iterator parIt = params.begin();
1462 // double prevPar = *parIt;
1463 // for ( parIt++; parIt != params.end(); parIt++ )
1465 // double segLen = (*parIt) - prevPar;
1466 // if ( segLen < toler )
1467 // ;//params.erase( prevPar ); // unite
1468 // else if ( segLen > maxSegment )
1469 // params.insert( prevPar + 0.5 * segLen ); // split
1470 // prevPar = (*parIt);
1474 // Make nodes of a grid of iso-poly-lines
1476 list < TIsoNode > nodes;
1477 typedef list < TIsoNode *> TIsoLine;
1478 map < double, TIsoLine > isoMap[ 2 ];
1480 set< double > & params0 = paramSet[ 0 ];
1481 set< double >::iterator par0It = params0.begin();
1482 for ( ; par0It != params0.end(); par0It++ )
1484 TIsoLine & isoLine0 = isoMap[0][ *par0It ]; // vertical isoline with const U
1485 set< double > & params1 = paramSet[ 1 ];
1486 set< double >::iterator par1It = params1.begin();
1487 for ( ; par1It != params1.end(); par1It++ )
1489 nodes.push_back( TIsoNode( *par0It, *par1It ) );
1490 isoLine0.push_back( & nodes.back() );
1491 isoMap[1][ *par1It ].push_back( & nodes.back() );
1495 // Compute intersections of boundaries with iso-lines:
1496 // only boundary nodes will have computed UV so far
1499 list< list< TPoint* > >::const_iterator bndIt = theBndPoints.begin();
1500 list< TIsoNode* > bndNodes; // nodes corresponding to outer theBndPoints
1501 for ( ; bndIt != theBndPoints.end(); bndIt++ )
1503 const list< TPoint* > & bndPoints = * bndIt;
1504 TPoint* prevP = bndPoints.back(); // this is the first point
1505 list< TPoint* >::const_iterator pIt = bndPoints.begin();
1506 // loop on the edge-points
1507 for ( ; pIt != bndPoints.end(); pIt++ )
1509 TPoint* point = *pIt;
1510 for ( iDir = 0; iDir < 2; iDir++ )
1512 const int iCoord = iDir + 1;
1513 const int iOtherCoord = 2 - iDir;
1514 double par1 = prevP->myInitUV.Coord( iCoord );
1515 double par2 = point->myInitUV.Coord( iCoord );
1516 double parDif = par2 - par1;
1517 if ( Abs( parDif ) <= DBL_MIN )
1519 // find iso-lines intersecting a bounadry
1520 double toler = tol[ 1 - iDir ];
1521 double minPar = Min ( par1, par2 );
1522 double maxPar = Max ( par1, par2 );
1523 map < double, TIsoLine >& isos = isoMap[ iDir ];
1524 map < double, TIsoLine >::iterator isoIt = isos.begin();
1525 for ( ; isoIt != isos.end(); isoIt++ )
1527 double isoParam = (*isoIt).first;
1528 if ( isoParam < minPar || isoParam > maxPar )
1530 double r = ( isoParam - par1 ) / parDif;
1531 gp_XY uv = ( 1 - r ) * prevP->myUV + r * point->myUV;
1532 gp_XY initUV = ( 1 - r ) * prevP->myInitUV + r * point->myInitUV;
1533 double otherPar = initUV.Coord( iOtherCoord ); // along isoline
1534 // find existing node with otherPar or insert a new one
1535 TIsoLine & isoLine = (*isoIt).second;
1537 TIsoLine::iterator nIt = isoLine.begin();
1538 for ( ; nIt != isoLine.end(); nIt++ ) {
1539 nodePar = (*nIt)->myInitUV.Coord( iOtherCoord );
1540 if ( nodePar >= otherPar )
1544 if ( Abs( nodePar - otherPar ) <= toler )
1545 node = ( nIt == isoLine.end() ) ? isoLine.back() : (*nIt);
1547 nodes.push_back( TIsoNode( initUV.X(), initUV.Y() ) );
1548 node = & nodes.back();
1549 isoLine.insert( nIt, node );
1551 node->SetNotMovable();
1553 uvBnd.Add( gp_Pnt2d( uv ));
1554 // cout << "bnd: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<" UV: "<<node->myUV.X()<<" "<<node->myUV.Y()<<endl;
1556 gp_XY tgt( point->myUV - prevP->myUV );
1557 if ( ::IsEqual( r, 1. ))
1558 node->myDir[ 0 ] = tgt;
1559 else if ( ::IsEqual( r, 0. ))
1560 node->myDir[ 1 ] = tgt;
1562 node->myDir[ 1 ] = node->myDir[ 0 ] = tgt;
1563 // keep boundary nodes corresponding to boundary points
1564 if ( bndIt == theBndPoints.begin() && ::IsEqual( r, 1. ))
1565 if ( bndNodes.empty() || bndNodes.back() != node )
1566 bndNodes.push_back( node );
1567 } // loop on isolines
1568 } // loop on 2 directions
1570 } // loop on boundary points
1571 } // loop on boundaries
1573 // Define orientation
1575 // find the point with the least X
1576 double leastX = DBL_MAX;
1577 TIsoNode * leftNode;
1578 list < TIsoNode >::iterator nodeIt = nodes.begin();
1579 for ( ; nodeIt != nodes.end(); nodeIt++ ) {
1580 TIsoNode & node = *nodeIt;
1581 if ( node.IsUVComputed() && node.myUV.X() < leastX ) {
1582 leastX = node.myUV.X();
1585 // if ( node.IsUVComputed() ) {
1586 // cout << "bndNode INIT: " << node.myInitUV.X()<<" "<<node.myInitUV.Y()<<" UV: "<<
1587 // node.myUV.X()<<" "<<node.myUV.Y()<<endl<<
1588 // " dir0: "<<node.myDir[0].X()<<" "<<node.myDir[0].Y() <<
1589 // " dir1: "<<node.myDir[1].X()<<" "<<node.myDir[1].Y() << endl;
1592 bool reversed = ( leftNode->myDir[0].Y() + leftNode->myDir[1].Y() > 0 );
1593 //SCRUTE( reversed );
1595 // Prepare internal nodes:
1597 // 2. compute ratios
1598 // 3. find boundary nodes for each node
1599 // 4. remove nodes out of the boundary
1600 for ( iDir = 0; iDir < 2; iDir++ )
1602 const int iCoord = 2 - iDir; // coord changing along an isoline
1603 map < double, TIsoLine >& isos = isoMap[ iDir ];
1604 map < double, TIsoLine >::iterator isoIt = isos.begin();
1605 for ( ; isoIt != isos.end(); isoIt++ )
1607 TIsoLine & isoLine = (*isoIt).second;
1608 bool firstCompNodeFound = false;
1609 TIsoLine::iterator lastCompNodePos, nPrevIt, nIt, nNextIt, nIt2;
1610 nPrevIt = nIt = nNextIt = isoLine.begin();
1612 nNextIt++; nNextIt++;
1613 while ( nIt != isoLine.end() )
1615 // 1. connect prev - cur
1616 TIsoNode* node = *nIt, * prevNode = *nPrevIt;
1617 if ( !firstCompNodeFound && prevNode->IsUVComputed() ) {
1618 firstCompNodeFound = true;
1619 lastCompNodePos = nPrevIt;
1621 if ( firstCompNodeFound ) {
1622 node->SetNext( prevNode, iDir, 0 );
1623 prevNode->SetNext( node, iDir, 1 );
1626 if ( nNextIt != isoLine.end() ) {
1627 double par1 = prevNode->myInitUV.Coord( iCoord );
1628 double par2 = node->myInitUV.Coord( iCoord );
1629 double par3 = (*nNextIt)->myInitUV.Coord( iCoord );
1630 node->myRatio[ iDir ] = ( par2 - par1 ) / ( par3 - par1 );
1632 // 3. find boundary nodes
1633 if ( node->IsUVComputed() )
1634 lastCompNodePos = nIt;
1635 else if ( firstCompNodeFound && nNextIt != isoLine.end() ) {
1636 TIsoNode* bndNode1 = *lastCompNodePos, *bndNode2 = 0;
1637 for ( nIt2 = nNextIt; nIt2 != isoLine.end(); nIt2++ )
1638 if ( (*nIt2)->IsUVComputed() )
1640 if ( nIt2 != isoLine.end() ) {
1642 node->SetBoundaryNode( bndNode1, iDir, 0 );
1643 node->SetBoundaryNode( bndNode2, iDir, 1 );
1644 // cout << "--------------------------------------------------"<<endl;
1645 // cout << "bndNode1: " << bndNode1->myUV.X()<<" "<<bndNode1->myUV.Y()<<endl<<
1646 // " dir0: "<<bndNode1->myDir[0].X()<<" "<<bndNode1->myDir[0].Y() <<
1647 // " dir1: "<<bndNode1->myDir[1].X()<<" "<<bndNode1->myDir[1].Y() << endl;
1648 // cout << "bndNode2: " << bndNode2->myUV.X()<<" "<<bndNode2->myUV.Y()<<endl<<
1649 // " dir0: "<<bndNode2->myDir[0].X()<<" "<<bndNode2->myDir[0].Y() <<
1650 // " dir1: "<<bndNode2->myDir[1].X()<<" "<<bndNode2->myDir[1].Y() << endl;
1653 /// WHAT IN THIS CASE ????????????? MAY BE THIS, I AM NOT SURE :(
1654 node->SetBoundaryNode( 0, iDir, 0 );
1655 node->SetBoundaryNode( 0, iDir, 1 );
1659 if ( nNextIt != isoLine.end() ) nNextIt++;
1660 // 4. remove nodes out of the boundary
1661 if ( !firstCompNodeFound )
1662 isoLine.pop_front();
1663 } // loop on isoLine nodes
1665 // remove nodes after the boundary
1666 // for ( nIt = ++lastCompNodePos; nIt != isoLine.end(); nIt++ )
1667 // (*nIt)->SetNotMovable();
1668 isoLine.erase( ++lastCompNodePos, isoLine.end() );
1669 } // loop on isolines
1670 } // loop on 2 directions
1672 // Compute local isoline direction for internal nodes
1675 map < double, TIsoLine >& isos = isoMap[ 0 ]; // vertical isolines with const U
1676 map < double, TIsoLine >::iterator isoIt = isos.begin();
1677 for ( ; isoIt != isos.end(); isoIt++ )
1679 TIsoLine & isoLine = (*isoIt).second;
1680 TIsoLine::iterator nIt = isoLine.begin();
1681 for ( ; nIt != isoLine.end(); nIt++ )
1683 TIsoNode* node = *nIt;
1684 if ( node->IsUVComputed() || !node->IsMovable() )
1686 gp_Vec2d aTgt[2], aNorm[2];
1689 for ( iDir = 0; iDir < 2; iDir++ )
1691 TIsoNode* bndNode1 = node->GetBoundaryNode( iDir, 0 );
1692 TIsoNode* bndNode2 = node->GetBoundaryNode( iDir, 1 );
1693 if ( !bndNode1 || !bndNode2 ) {
1697 const int iCoord = 2 - iDir; // coord changing along an isoline
1698 double par1 = bndNode1->myInitUV.Coord( iCoord );
1699 double par2 = node->myInitUV.Coord( iCoord );
1700 double par3 = bndNode2->myInitUV.Coord( iCoord );
1701 ratio[ iDir ] = ( par2 - par1 ) / ( par3 - par1 );
1703 gp_Vec2d tgt1( bndNode1->myDir[0].XY() + bndNode1->myDir[1].XY() );
1704 gp_Vec2d tgt2( bndNode2->myDir[0].XY() + bndNode2->myDir[1].XY() );
1705 if ( bool( iDir ) == reversed ) tgt2.Reverse(); // along perpend. isoline
1706 else tgt1.Reverse();
1707 //cout<<" tgt: " << tgt1.X()<<" "<<tgt1.Y()<<" | "<< tgt2.X()<<" "<<tgt2.Y()<<endl;
1709 if ( ratio[ iDir ] < 0.5 )
1710 aNorm[ iDir ] = gp_Vec2d( -tgt1.Y(), tgt1.X() ); // rotate tgt to the left
1712 aNorm[ iDir ] = gp_Vec2d( -tgt2.Y(), tgt2.X() );
1714 aNorm[ iDir ].Reverse(); // along iDir isoline
1716 double angle = tgt1.Angle( tgt2 ); // [-PI, PI]
1717 // maybe angle is more than |PI|
1718 if ( Abs( angle ) > PI / 2. ) {
1719 // check direction of the last but one perpendicular isoline
1720 TIsoNode* prevNode = bndNode2->GetNext( iDir, 0 );
1721 bndNode1 = prevNode->GetBoundaryNode( 1 - iDir, 0 );
1722 bndNode2 = prevNode->GetBoundaryNode( 1 - iDir, 1 );
1723 gp_Vec2d isoDir( bndNode1->myUV, bndNode2->myUV );
1724 if ( isoDir * tgt2 < 0 )
1726 double angle2 = tgt1.Angle( isoDir );
1727 //cout << " isoDir: "<< isoDir.X() <<" "<<isoDir.Y() << " ANGLE: "<< angle << " "<<angle2<<endl;
1728 if (angle2 * angle < 0 && // check the sign of an angle close to PI
1729 Abs ( Abs ( angle ) - PI ) <= PI / 180. ) {
1730 //MESSAGE("REVERSE ANGLE");
1733 if ( Abs( angle2 ) > Abs( angle ) ||
1734 ( angle2 * angle < 0 && Abs( angle2 ) > Abs( angle - angle2 ))) {
1735 //MESSAGE("Add PI");
1736 // cout << "NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<endl;
1737 // cout <<"ISO: " << isoParam << " " << (*iso2It).first << endl;
1738 // cout << "bndNode1: " << bndNode1->myUV.X()<<" "<<bndNode1->myUV.Y()<< endl;
1739 // cout << "bndNode2: " << bndNode2->myUV.X()<<" "<<bndNode2->myUV.Y()<<endl;
1740 // cout <<" tgt: " << tgt1.X()<<" "<<tgt1.Y()<<" "<< tgt2.X()<<" "<<tgt2.Y()<<endl;
1741 angle += ( angle < 0 ) ? 2. * PI : -2. * PI;
1744 aTgt[ iDir ] = tgt1.Rotated( angle * ratio[ iDir ] ).XY();
1748 for ( iDir = 0; iDir < 2; iDir++ )
1750 aTgt[iDir].Normalize();
1751 aNorm[1-iDir].Normalize();
1752 double r = Abs ( ratio[iDir] - 0.5 ) * 2.0; // [0,1] - distance from the middle
1755 node->myDir[iDir] = //aTgt[iDir];
1756 aNorm[1-iDir] * r + aTgt[iDir] * ( 1. - r );
1758 // cout << "NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<endl;
1759 // cout <<" tgt: " << tgt1.X()<<" "<<tgt1.Y()<<" - "<< tgt2.X()<<" "<<tgt2.Y()<<endl;
1760 // cout << " isoDir: "<< node->myDir[0].X() <<" "<<node->myDir[0].Y()<<" | "
1761 // << node->myDir[1].X() <<" "<<node->myDir[1].Y()<<endl;
1763 } // loop on iso nodes
1764 } // loop on isolines
1766 // Find nodes to start computing UV from
1768 list< TIsoNode* > startNodes;
1769 list< TIsoNode* >::iterator nIt = bndNodes.end();
1770 TIsoNode* node = *(--nIt);
1771 TIsoNode* prevNode = *(--nIt);
1772 for ( nIt = bndNodes.begin(); nIt != bndNodes.end(); nIt++ )
1774 TIsoNode* nextNode = *nIt;
1775 gp_Vec2d initTgt1( prevNode->myInitUV, node->myInitUV );
1776 gp_Vec2d initTgt2( node->myInitUV, nextNode->myInitUV );
1777 double initAngle = initTgt1.Angle( initTgt2 );
1778 double angle = node->myDir[0].Angle( node->myDir[1] );
1779 if ( reversed ) angle = -angle;
1780 if ( initAngle > angle && initAngle - angle > PI / 2.1 ) {
1781 // find a close internal node
1782 TIsoNode* nClose = 0;
1783 list< TIsoNode* > testNodes;
1784 testNodes.push_back( node );
1785 list< TIsoNode* >::iterator it = testNodes.begin();
1786 for ( ; !nClose && it != testNodes.end(); it++ )
1788 for (int i = 0; i < 4; i++ )
1790 nClose = (*it)->myNext[ i ];
1792 if ( !nClose->IsUVComputed() )
1795 testNodes.push_back( nClose );
1801 startNodes.push_back( nClose );
1802 // cout << "START: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<" UV: "<<
1803 // node->myUV.X()<<" "<<node->myUV.Y()<<endl<<
1804 // "initAngle: " << initAngle << " angle: " << angle << endl;
1805 // cout <<" init tgt: " << initTgt1.X()<<" "<<initTgt1.Y()<<" | "<< initTgt2.X()<<" "<<initTgt2.Y()<<endl;
1806 // cout << " tgt: "<< node->myDir[ 0 ].X() <<" "<<node->myDir[ 0 ].Y()<<" | "<<
1807 // node->myDir[ 1 ].X() <<" "<<node->myDir[ 1 ].Y()<<endl;
1808 // cout << "CLOSE: "<<nClose->myInitUV.X()<<" "<<nClose->myInitUV.Y()<<endl;
1814 // Compute starting UV of internal nodes
1816 list < TIsoNode* > internNodes;
1817 bool needIteration = true;
1818 if ( startNodes.empty() ) {
1819 MESSAGE( " Starting UV by compUVByIsoIntersection()");
1820 needIteration = false;
1821 map < double, TIsoLine >& isos = isoMap[ 0 ];
1822 map < double, TIsoLine >::iterator isoIt = isos.begin();
1823 for ( ; isoIt != isos.end(); isoIt++ )
1825 TIsoLine & isoLine = (*isoIt).second;
1826 TIsoLine::iterator nIt = isoLine.begin();
1827 for ( ; !needIteration && nIt != isoLine.end(); nIt++ )
1829 TIsoNode* node = *nIt;
1830 if ( !node->IsUVComputed() && node->IsMovable() ) {
1831 internNodes.push_back( node );
1833 if ( !compUVByIsoIntersection(theBndPoints, node->myInitUV,
1834 node->myUV, needIteration ))
1835 node->myUV = node->myInitUV;
1839 if ( needIteration )
1840 for ( nIt = bndNodes.begin(); nIt != bndNodes.end(); nIt++ )
1842 TIsoNode* node = *nIt, *nClose = 0;
1843 list< TIsoNode* > testNodes;
1844 testNodes.push_back( node );
1845 list< TIsoNode* >::iterator it = testNodes.begin();
1846 for ( ; !nClose && it != testNodes.end(); it++ )
1848 for (int i = 0; i < 4; i++ )
1850 nClose = (*it)->myNext[ i ];
1852 if ( !nClose->IsUVComputed() && nClose->IsMovable() )
1855 testNodes.push_back( nClose );
1861 startNodes.push_back( nClose );
1865 double aMin[2], aMax[2], step[2];
1866 uvBnd.Get( aMin[0], aMin[1], aMax[0], aMax[1] );
1867 double minUvSize = Min ( aMax[0]-aMin[0], aMax[1]-aMin[1] );
1868 step[0] = minUvSize / paramSet[ 0 ].size() / 10;
1869 step[1] = minUvSize / paramSet[ 1 ].size() / 10;
1870 //cout << "STEPS: " << step[0] << " " << step[1]<< endl;
1872 for ( nIt = startNodes.begin(); nIt != startNodes.end(); nIt++ )
1874 TIsoNode* prevN[2], *node = *nIt;
1875 if ( node->IsUVComputed() || !node->IsMovable() )
1877 gp_XY newUV( 0, 0 ), sumDir( 0, 0 );
1878 int nbComp = 0, nbPrev = 0;
1879 for ( iDir = 0; iDir < 2; iDir++ )
1881 TIsoNode* prevNode1 = 0, *prevNode2 = 0;
1882 TIsoNode* n = node->GetNext( iDir, 0 );
1883 if ( n->IsUVComputed() )
1886 startNodes.push_back( n );
1887 n = node->GetNext( iDir, 1 );
1888 if ( n->IsUVComputed() )
1891 startNodes.push_back( n );
1893 prevNode1 = prevNode2;
1896 if ( prevNode1 ) nbPrev++;
1897 if ( prevNode2 ) nbPrev++;
1900 double prevPar = prevNode1->myInitUV.Coord( 2 - iDir );
1901 double par = node->myInitUV.Coord( 2 - iDir );
1902 bool isEnd = ( prevPar > par );
1903 // dir = node->myDir[ 1 - iDir ].XY() * ( isEnd ? -1. : 1. );
1904 //cout << "__________"<<endl<< "NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<endl;
1905 TIsoNode* bndNode = node->GetBoundaryNode( iDir, isEnd );
1907 MESSAGE("Why we are here?");
1910 gp_XY tgt( bndNode->myDir[0].XY() + bndNode->myDir[1].XY() );
1911 dir.SetCoord( 1, tgt.Y() * ( reversed ? 1 : -1 ));
1912 dir.SetCoord( 2, tgt.X() * ( reversed ? -1 : 1 ));
1913 //cout << "bndNode UV: " << bndNode->myUV.X()<<" "<<bndNode->myUV.Y()<< endl;
1914 // cout << " tgt: "<< bndNode->myDir[ 0 ].X() <<" "<<bndNode->myDir[ 0 ].Y()<<" | "<<
1915 // bndNode->myDir[ 1 ].X() <<" "<<bndNode->myDir[ 1 ].Y()<<endl;
1916 //cout << "prevNode UV: " << prevNode1->myUV.X()<<" "<<prevNode1->myUV.Y()<<
1917 //" par: " << prevPar << endl;
1918 // cout <<" tgt: " << tgt.X()<<" "<<tgt.Y()<<endl;
1919 //cout << " DIR: "<< dir.X() <<" "<<dir.Y()<<endl;
1921 //cout << "____2next______"<<endl<< "NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<endl;
1922 gp_XY & uv1 = prevNode1->myUV;
1923 gp_XY & uv2 = prevNode2->myUV;
1924 // dir = ( uv2 - uv1 );
1925 // double len = dir.Modulus();
1926 // if ( len > DBL_MIN )
1927 // dir /= len * 0.5;
1928 double r = node->myRatio[ iDir ];
1929 newUV += uv1 * ( 1 - r ) + uv2 * r;
1932 newUV += prevNode1->myUV + dir * step[ iDir ];
1935 prevN[ iDir ] = prevNode1;
1939 if ( !nbComp ) continue;
1942 //cout << "NODE: "<<node->myInitUV.X()<<" "<<node->myInitUV.Y()<<endl;
1944 // check if a quadrangle is not distorted
1946 //int crit = ( nbPrev == 4 ) ? FIX_OLD : CHECK_NEW_IN;
1947 if ( !checkQuads( node, newUV, reversed, FIX_OLD, step[0] + step[1] )) {
1948 //cout <<" newUV: " << node->myUV.X() << " "<<node->myUV.Y() << " nbPrev: "<<nbPrev<< endl;
1949 // cout << "_FIX_INIT_ fixedUV: " << newUV.X() << " "<<newUV.Y() << endl;
1953 internNodes.push_back( node );
1958 static int maxNbIter = 100;
1959 #ifdef DEB_COMPUVBYELASTICISOLINES
1961 bool useNbMoveNode = 0;
1962 static int maxNbNodeMove = 100;
1965 if ( !useNbMoveNode )
1966 maxNbIter = ( maxNbIter < 0 ) ? 100 : -1;
1971 if ( !needIteration) break;
1972 #ifdef DEB_COMPUVBYELASTICISOLINES
1973 if ( nbIter >= maxNbIter ) break;
1976 list < TIsoNode* >::iterator nIt = internNodes.begin();
1977 for ( ; nIt != internNodes.end(); nIt++ ) {
1978 #ifdef DEB_COMPUVBYELASTICISOLINES
1980 cout << nbNodeMove <<" =================================================="<<endl;
1982 TIsoNode * node = *nIt;
1986 for ( iDir = 0; iDir < 2; iDir++ )
1988 gp_XY & uv1 = node->GetNext( iDir, 0 )->myUV;
1989 gp_XY & uv2 = node->GetNext( iDir, 1 )->myUV;
1990 double r = node->myRatio[ iDir ];
1991 loc[ iDir ] = uv1 * ( 1 - r ) + uv2 * r;
1992 // line[ iDir ].SetLocation( loc[ iDir ] );
1993 // line[ iDir ].SetDirection( node->myDir[ iDir ] );
1996 bool ok = true; // <- stupid fix TO AVOID PB OF NODES WITH NULL BND NODES
1997 double locR[2] = { 0, 0 };
1998 for ( iDir = 0; iDir < 2; iDir++ )
2000 const int iCoord = 2 - iDir; // coord changing along an isoline
2001 TIsoNode* bndNode1 = node->GetBoundaryNode( iDir, 0 );
2002 TIsoNode* bndNode2 = node->GetBoundaryNode( iDir, 1 );
2003 if ( !bndNode1 || !bndNode2 ) {
2006 double par1 = bndNode1->myInitUV.Coord( iCoord );
2007 double par2 = node->myInitUV.Coord( iCoord );
2008 double par3 = bndNode2->myInitUV.Coord( iCoord );
2009 double r = ( par2 - par1 ) / ( par3 - par1 );
2010 r = Abs ( r - 0.5 ) * 2.0; // [0,1] - distance from the middle
2011 locR[ iDir ] = ( 1 - r * r ) * 0.25;
2013 //locR[0] = locR[1] = 0.25;
2014 // intersect the 2 lines and move a node
2015 //IntAna2d_AnaIntersection inter( line[0], line[1] );
2016 if ( ok /*inter.IsDone() && inter.NbPoints() ==*/ )
2018 // double intR = 1 - locR[0] - locR[1];
2019 // gp_XY newUV = inter.Point(1).Value().XY();
2020 // if ( !checkQuads( node, newUV, reversed, CHECK_NEW_IN ))
2021 // newUV = ( locR[0] * loc[0] + locR[1] * loc[1] ) / ( 1 - intR );
2023 // newUV = intR * newUV + locR[0] * loc[0] + locR[1] * loc[1];
2024 gp_XY newUV = 0.5 * ( loc[0] + loc[1] );
2025 // avoid parallel isolines intersection
2026 checkQuads( node, newUV, reversed );
2028 maxMove = Max( maxMove, ( newUV - node->myUV ).SquareModulus());
2030 } // intersection found
2031 #ifdef DEB_COMPUVBYELASTICISOLINES
2032 if (useNbMoveNode && ++nbNodeMove >= maxNbNodeMove ) break;
2034 } // loop on internal nodes
2035 #ifdef DEB_COMPUVBYELASTICISOLINES
2036 if (useNbMoveNode && nbNodeMove >= maxNbNodeMove ) break;
2038 } while ( maxMove > 1e-8 && nbIter++ < maxNbIter );
2040 MESSAGE( "compUVByElasticIsolines(): Nb iterations " << nbIter << " dist: " << sqrt( maxMove ));
2042 if ( nbIter >= maxNbIter && sqrt(maxMove) > minUvSize * 0.05 ) {
2043 MESSAGE( "compUVByElasticIsolines() failed: "<<sqrt(maxMove)<<">"<<minUvSize * 0.05);
2044 #ifndef DEB_COMPUVBYELASTICISOLINES
2049 // Set computed UV to points
2051 for ( pIt = thePntToCompute.begin(); pIt != thePntToCompute.end(); pIt++ ) {
2052 TPoint* point = *pIt;
2053 //gp_XY oldUV = point->myUV;
2054 double minDist = DBL_MAX;
2055 list < TIsoNode >::iterator nIt = nodes.begin();
2056 for ( ; nIt != nodes.end(); nIt++ ) {
2057 double dist = ( (*nIt).myInitUV - point->myInitUV ).SquareModulus();
2058 if ( dist < minDist ) {
2060 point->myUV = (*nIt).myUV;
2069 //=======================================================================
2070 //function : setFirstEdge
2071 //purpose : choose the best first edge of theWire; return the summary distance
2072 // between point UV computed by isolines intersection and
2073 // eventual UV got from edge p-curves
2074 //=======================================================================
2076 //#define DBG_SETFIRSTEDGE
2077 double SMESH_Pattern::setFirstEdge (list< TopoDS_Edge > & theWire, int theFirstEdgeID)
2079 int iE, nbEdges = theWire.size();
2083 // Transform UVs computed by iso to fit bnd box of a wire
2085 // max nb of points on an edge
2087 int eID = theFirstEdgeID;
2088 for ( iE = 0; iE < nbEdges; iE++ )
2089 maxNbPnt = Max ( maxNbPnt, getShapePoints( eID++ ).size() );
2091 // compute bnd boxes
2092 TopoDS_Face face = TopoDS::Face( myShape );
2093 Bnd_Box2d bndBox, eBndBox;
2094 eID = theFirstEdgeID;
2095 list< TopoDS_Edge >::iterator eIt;
2096 list< TPoint* >::iterator pIt;
2097 for ( eIt = theWire.begin(); eIt != theWire.end(); eIt++ )
2099 // UV by isos stored in TPoint.myXYZ
2100 list< TPoint* > & ePoints = getShapePoints( eID++ );
2101 for ( pIt = ePoints.begin(); pIt != ePoints.end(); pIt++ ) {
2103 bndBox.Add( gp_Pnt2d( p->myXYZ.X(), p->myXYZ.Y() ));
2105 // UV by an edge p-curve
2107 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface( *eIt, face, f, l );
2108 double dU = ( l - f ) / ( maxNbPnt - 1 );
2109 for ( int i = 0; i < maxNbPnt; i++ )
2110 eBndBox.Add( C2d->Value( f + i * dU ));
2113 // transform UVs by isos
2114 double minPar[2], maxPar[2], eMinPar[2], eMaxPar[2];
2115 bndBox.Get( minPar[0], minPar[1], maxPar[0], maxPar[1] );
2116 eBndBox.Get( eMinPar[0], eMinPar[1], eMaxPar[0], eMaxPar[1] );
2117 #ifdef DBG_SETFIRSTEDGE
2118 MESSAGE ( "EDGES: X: " << eMinPar[0] << " - " << eMaxPar[0] << " Y: "
2119 << eMinPar[1] << " - " << eMaxPar[1] );
2121 for ( int iC = 1, i = 0; i < 2; iC++, i++ ) // loop on 2 coordinates
2123 double dMin = eMinPar[i] - minPar[i];
2124 double dMax = eMaxPar[i] - maxPar[i];
2125 double dPar = maxPar[i] - minPar[i];
2126 eID = theFirstEdgeID;
2127 for ( iE = 0; iE < nbEdges; iE++ ) // loop on edges of a boundary
2129 list< TPoint* > & ePoints = getShapePoints( eID++ );
2130 for ( pIt = ++ePoints.begin(); pIt != ePoints.end(); pIt++ ) // loop on edge points
2132 double par = (*pIt)->myXYZ.Coord( iC );
2133 double r = ( par - minPar[i] ) / dPar;
2134 par += ( 1 - r ) * dMin + r * dMax;
2135 (*pIt)->myXYZ.SetCoord( iC, par );
2141 double minDist = DBL_MAX;
2142 for ( iE = 0 ; iE < nbEdges; iE++ )
2144 #ifdef DBG_SETFIRSTEDGE
2145 MESSAGE ( " VARIANT " << iE );
2147 // evaluate the distance between UV computed by the 2 methods:
2148 // by isos intersection ( myXYZ ) and by edge p-curves ( myUV )
2150 int eID = theFirstEdgeID;
2151 for ( eIt = theWire.begin(); eIt != theWire.end(); eIt++ )
2153 list< TPoint* > & ePoints = getShapePoints( eID++ );
2154 computeUVOnEdge( *eIt, ePoints );
2155 for ( pIt = ++ePoints.begin(); pIt != ePoints.end(); pIt++ ) {
2157 dist += ( p->myUV - gp_XY( p->myXYZ.X(), p->myXYZ.Y() )).SquareModulus();
2158 #ifdef DBG_SETFIRSTEDGE
2159 MESSAGE ( " ISO : ( " << p->myXYZ.X() << ", "<< p->myXYZ.Y() << " ) PCURVE : ( " <<
2160 p->myUV.X() << ", " << p->myUV.Y() << ") " );
2164 #ifdef DBG_SETFIRSTEDGE
2165 MESSAGE ( "dist -- " << dist );
2167 if ( dist < minDist ) {
2169 eBest = theWire.front();
2171 // check variant with another first edge
2172 theWire.splice( theWire.begin(), theWire, --theWire.end(), theWire.end() );
2174 // put the best first edge to the theWire front
2175 if ( eBest != theWire.front() ) {
2176 eIt = find ( theWire.begin(), theWire.end(), eBest );
2177 theWire.splice( theWire.begin(), theWire, eIt, theWire.end() );
2183 //=======================================================================
2184 //function : sortSameSizeWires
2185 //purpose : sort wires in theWireList from theFromWire until theToWire,
2186 // the wires are set in the order to correspond to the order
2187 // of boundaries; after sorting, edges in the wires are put
2188 // in a good order, point UVs on edges are computed and points
2189 // are appended to theEdgesPointsList
2190 //=======================================================================
2192 bool SMESH_Pattern::sortSameSizeWires (TListOfEdgesList & theWireList,
2193 const TListOfEdgesList::iterator& theFromWire,
2194 const TListOfEdgesList::iterator& theToWire,
2195 const int theFirstEdgeID,
2196 list< list< TPoint* > >& theEdgesPointsList )
2198 TopoDS_Face F = TopoDS::Face( myShape );
2199 int iW, nbWires = 0;
2200 TListOfEdgesList::iterator wlIt = theFromWire;
2201 while ( wlIt++ != theToWire )
2204 // Recompute key-point UVs by isolines intersection,
2205 // compute CG of key-points for each wire and bnd boxes of GCs
2208 gp_XY orig( gp::Origin2d().XY() );
2209 vector< gp_XY > vGcVec( nbWires, orig ), gcVec( nbWires, orig );
2210 Bnd_Box2d bndBox, vBndBox;
2211 int eID = theFirstEdgeID;
2212 list< TopoDS_Edge >::iterator eIt;
2213 for ( iW = 0, wlIt = theFromWire; wlIt != theToWire; wlIt++, iW++ )
2215 list< TopoDS_Edge > & wire = *wlIt;
2216 for ( eIt = wire.begin(); eIt != wire.end(); eIt++ )
2218 list< TPoint* > & ePoints = getShapePoints( eID++ );
2219 TPoint* p = ePoints.front();
2220 if ( !compUVByIsoIntersection( theEdgesPointsList, p->myInitUV, p->myUV, aBool )) {
2221 MESSAGE("cant sortSameSizeWires()");
2224 gcVec[iW] += p->myUV;
2225 bndBox.Add( gp_Pnt2d( p->myUV ));
2226 TopoDS_Vertex V = TopExp::FirstVertex( *eIt, true );
2227 gp_Pnt2d vXY = BRep_Tool::Parameters( V, F );
2228 vGcVec[iW] += vXY.XY();
2230 // keep the computed UV to compare against by setFirstEdge()
2231 p->myXYZ.SetCoord( p->myUV.X(), p->myUV.Y(), 0. );
2233 gcVec[iW] /= nbWires;
2234 vGcVec[iW] /= nbWires;
2235 // cout << " Wire " << iW << " iso: " << gcVec[iW].X() << " " << gcVec[iW].Y() << endl <<
2236 // " \t vertex: " << vGcVec[iW].X() << " " << vGcVec[iW].Y() << endl;
2239 // Transform GCs computed by isos to fit in bnd box of GCs by vertices
2241 double minPar[2], maxPar[2], vMinPar[2], vMaxPar[2];
2242 bndBox.Get( minPar[0], minPar[1], maxPar[0], maxPar[1] );
2243 vBndBox.Get( vMinPar[0], vMinPar[1], vMaxPar[0], vMaxPar[1] );
2244 for ( int iC = 1, i = 0; i < 2; iC++, i++ ) // loop on 2 coordinates
2246 double dMin = vMinPar[i] - minPar[i];
2247 double dMax = vMaxPar[i] - maxPar[i];
2248 double dPar = maxPar[i] - minPar[i];
2249 if ( Abs( dPar ) <= DBL_MIN )
2251 for ( iW = 0; iW < nbWires; iW++ ) { // loop on GCs of wires
2252 double par = gcVec[iW].Coord( iC );
2253 double r = ( par - minPar[i] ) / dPar;
2254 par += ( 1 - r ) * dMin + r * dMax;
2255 gcVec[iW].SetCoord( iC, par );
2259 // Define boundary - wire correspondence by GC closeness
2261 TListOfEdgesList tmpWList;
2262 tmpWList.splice( tmpWList.end(), theWireList, theFromWire, theToWire );
2263 typedef map< int, TListOfEdgesList::iterator > TIntWirePosMap;
2264 TIntWirePosMap bndIndWirePosMap;
2265 vector< bool > bndFound( nbWires, false );
2266 for ( iW = 0, wlIt = tmpWList.begin(); iW < nbWires; iW++, wlIt++ )
2268 // cout << " TRSF Wire " << iW << " iso: " << gcVec[iW].X() << " " << gcVec[iW].Y() << endl <<
2269 // " \t vertex: " << vGcVec[iW].X() << " " << vGcVec[iW].Y() << endl;
2270 double minDist = DBL_MAX;
2271 gp_XY & wGc = vGcVec[ iW ];
2273 for ( int iB = 0; iB < nbWires; iB++ ) {
2274 if ( bndFound[ iB ] ) continue;
2275 double dist = ( wGc - gcVec[ iB ] ).SquareModulus();
2276 if ( dist < minDist ) {
2281 bndFound[ bIndex ] = true;
2282 bndIndWirePosMap.insert( TIntWirePosMap::value_type( bIndex, wlIt ));
2287 TIntWirePosMap::iterator bIndWPosIt = bndIndWirePosMap.begin();
2288 eID = theFirstEdgeID;
2289 for ( ; bIndWPosIt != bndIndWirePosMap.end(); bIndWPosIt++ )
2291 TListOfEdgesList::iterator wirePos = (*bIndWPosIt).second;
2292 list < TopoDS_Edge > & wire = ( *wirePos );
2294 // choose the best first edge of a wire
2295 setFirstEdge( wire, eID );
2297 // compute eventual UV and fill theEdgesPointsList
2298 theEdgesPointsList.push_back( list< TPoint* >() );
2299 list< TPoint* > & edgesPoints = theEdgesPointsList.back();
2300 for ( eIt = wire.begin(); eIt != wire.end(); eIt++ )
2302 list< TPoint* > & ePoints = getShapePoints( eID++ );
2303 computeUVOnEdge( *eIt, ePoints );
2304 edgesPoints.insert( edgesPoints.end(), ePoints.begin(), (--ePoints.end()));
2306 // put wire back to theWireList
2308 theWireList.splice( theToWire, tmpWList, wlIt, wirePos );
2314 //=======================================================================
2316 //purpose : Compute nodes coordinates applying
2317 // the loaded pattern to <theFace>. The first key-point
2318 // will be mapped into <theVertexOnKeyPoint1>
2319 //=======================================================================
2321 bool SMESH_Pattern::Apply (const TopoDS_Face& theFace,
2322 const TopoDS_Vertex& theVertexOnKeyPoint1,
2323 const bool theReverse)
2325 MESSAGE(" ::Apply(face) " );
2326 TopoDS_Face face = theReverse ? TopoDS::Face( theFace.Reversed() ) : theFace;
2327 if ( !setShapeToMesh( face ))
2330 // find points on edges, it fills myNbKeyPntInBoundary
2331 if ( !findBoundaryPoints() )
2334 // Define the edges order so that the first edge starts at
2335 // theVertexOnKeyPoint1
2337 list< TopoDS_Edge > eList;
2338 list< int > nbVertexInWires;
2339 int nbWires = SMESH_Block::GetOrderedEdges( face, theVertexOnKeyPoint1, eList, nbVertexInWires);
2340 if ( !theVertexOnKeyPoint1.IsSame( TopExp::FirstVertex( eList.front(), true )))
2342 MESSAGE( " theVertexOnKeyPoint1 not found in the outer wire ");
2343 return setErrorCode( ERR_APPLF_BAD_VERTEX );
2345 // check nb wires and edges
2346 list< int > l1 = myNbKeyPntInBoundary, l2 = nbVertexInWires;
2347 l1.sort(); l2.sort();
2350 MESSAGE( "Wrong nb vertices in wires" );
2351 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2354 // here shapes get IDs, for the outer wire IDs are OK
2355 list<TopoDS_Edge>::iterator elIt = eList.begin();
2356 for ( ; elIt != eList.end(); elIt++ ) {
2357 myShapeIDMap.Add( TopExp::FirstVertex( *elIt, true ));
2358 bool isClosed1 = BRep_Tool::IsClosed( *elIt, theFace );
2359 // BEGIN: jfa for bug 0019943
2362 for (TopExp_Explorer expw (theFace, TopAbs_WIRE); expw.More() && !isClosed1; expw.Next()) {
2363 const TopoDS_Wire& wire = TopoDS::Wire(expw.Current());
2365 for (BRepTools_WireExplorer we (wire, theFace); we.More() && !isClosed1; we.Next()) {
2366 if (we.Current().IsSame(*elIt)) {
2368 if (nbe == 2) isClosed1 = true;
2373 // END: jfa for bug 0019943
2375 myShapeIDMap.Add( TopExp::LastVertex( *elIt, true ));// vertex orienation is REVERSED
2377 int nbVertices = myShapeIDMap.Extent();
2379 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ )
2380 myShapeIDMap.Add( *elIt );
2382 myShapeIDMap.Add( face );
2384 if ( myShapeIDToPointsMap.size() != myShapeIDMap.Extent() ) {
2385 MESSAGE( myShapeIDToPointsMap.size() <<" != " << myShapeIDMap.Extent());
2386 return setErrorCode( ERR_APPLF_INTERNAL_EEROR );
2389 // points on edges to be used for UV computation of in-face points
2390 list< list< TPoint* > > edgesPointsList;
2391 edgesPointsList.push_back( list< TPoint* >() );
2392 list< TPoint* > * edgesPoints = & edgesPointsList.back();
2393 list< TPoint* >::iterator pIt;
2395 // compute UV of points on the outer wire
2396 int iE, nbEdgesInOuterWire = nbVertexInWires.front();
2397 for (iE = 0, elIt = eList.begin();
2398 iE < nbEdgesInOuterWire && elIt != eList.end();
2401 list< TPoint* > & ePoints = getShapePoints( *elIt );
2403 computeUVOnEdge( *elIt, ePoints );
2404 // collect on-edge points (excluding the last one)
2405 edgesPoints->insert( edgesPoints->end(), ePoints.begin(), --ePoints.end());
2408 // If there are several wires, define the order of edges of inner wires:
2409 // compute UV of inner edge-points using 2 methods: the one for in-face points
2410 // and the one for on-edge points and then choose the best edge order
2411 // by the best correspondance of the 2 results
2414 // compute UV of inner edge-points using the method for in-face points
2415 // and devide eList into a list of separate wires
2417 list< list< TopoDS_Edge > > wireList;
2418 list<TopoDS_Edge>::iterator eIt = elIt;
2419 list<int>::iterator nbEIt = nbVertexInWires.begin();
2420 for ( nbEIt++; nbEIt != nbVertexInWires.end(); nbEIt++ )
2422 int nbEdges = *nbEIt;
2423 wireList.push_back( list< TopoDS_Edge >() );
2424 list< TopoDS_Edge > & wire = wireList.back();
2425 for ( iE = 0 ; iE < nbEdges; eIt++, iE++ )
2427 list< TPoint* > & ePoints = getShapePoints( *eIt );
2428 pIt = ePoints.begin();
2429 for ( pIt++; pIt != ePoints.end(); pIt++ ) {
2431 if ( !compUVByIsoIntersection( edgesPointsList, p->myInitUV, p->myUV, aBool )) {
2432 MESSAGE("cant Apply(face)");
2435 // keep the computed UV to compare against by setFirstEdge()
2436 p->myXYZ.SetCoord( p->myUV.X(), p->myUV.Y(), 0. );
2438 wire.push_back( *eIt );
2441 // remove inner edges from eList
2442 eList.erase( elIt, eList.end() );
2444 // sort wireList by nb edges in a wire
2445 sortBySize< TopoDS_Edge > ( wireList );
2447 // an ID of the first edge of a boundary
2448 int id1 = nbVertices + nbEdgesInOuterWire + 1;
2449 // if ( nbSeamShapes > 0 )
2450 // id1 += 2; // 2 vertices more
2452 // find points - edge correspondence for wires of unique size,
2453 // edge order within a wire should be defined only
2455 list< list< TopoDS_Edge > >::iterator wlIt = wireList.begin();
2456 while ( wlIt != wireList.end() )
2458 list< TopoDS_Edge >& wire = (*wlIt);
2459 int nbEdges = wire.size();
2461 if ( wlIt == wireList.end() || (*wlIt).size() != nbEdges ) // a unique size wire
2463 // choose the best first edge of a wire
2464 setFirstEdge( wire, id1 );
2466 // compute eventual UV and collect on-edge points
2467 edgesPointsList.push_back( list< TPoint* >() );
2468 edgesPoints = & edgesPointsList.back();
2470 for ( eIt = wire.begin(); eIt != wire.end(); eIt++ )
2472 list< TPoint* > & ePoints = getShapePoints( eID++ );
2473 computeUVOnEdge( *eIt, ePoints );
2474 edgesPoints->insert( edgesPoints->end(), ePoints.begin(), (--ePoints.end()));
2480 // find boundary - wire correspondence for several wires of same size
2482 id1 = nbVertices + nbEdgesInOuterWire + 1;
2483 wlIt = wireList.begin();
2484 while ( wlIt != wireList.end() )
2486 int nbSameSize = 0, nbEdges = (*wlIt).size();
2487 list< list< TopoDS_Edge > >::iterator wlIt2 = wlIt;
2489 while ( wlIt2 != wireList.end() && (*wlIt2).size() == nbEdges ) { // a same size wire
2493 if ( nbSameSize > 0 )
2494 if (!sortSameSizeWires(wireList, wlIt, wlIt2, id1, edgesPointsList))
2497 id1 += nbEdges * ( nbSameSize + 1 );
2500 // add well-ordered edges to eList
2502 for ( wlIt = wireList.begin(); wlIt != wireList.end(); wlIt++ )
2504 list< TopoDS_Edge >& wire = (*wlIt);
2505 eList.splice( eList.end(), wire, wire.begin(), wire.end() );
2508 // re-fill myShapeIDMap - all shapes get good IDs
2510 myShapeIDMap.Clear();
2511 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ )
2512 myShapeIDMap.Add( TopExp::FirstVertex( *elIt, true ));
2513 for ( elIt = eList.begin(); elIt != eList.end(); elIt++ )
2514 myShapeIDMap.Add( *elIt );
2515 myShapeIDMap.Add( face );
2517 } // there are inner wires
2519 // Compute XYZ of on-edge points
2521 TopLoc_Location loc;
2522 for ( iE = nbVertices + 1, elIt = eList.begin(); elIt != eList.end(); elIt++ )
2524 BRepAdaptor_Curve C3d( *elIt );
2525 list< TPoint* > & ePoints = getShapePoints( iE++ );
2526 pIt = ePoints.begin();
2527 for ( pIt++; pIt != ePoints.end(); pIt++ )
2529 TPoint* point = *pIt;
2530 point->myXYZ = C3d.Value( point->myU );
2534 // Compute UV and XYZ of in-face points
2536 // try to use a simple algo
2537 list< TPoint* > & fPoints = getShapePoints( face );
2538 bool isDeformed = false;
2539 for ( pIt = fPoints.begin(); !isDeformed && pIt != fPoints.end(); pIt++ )
2540 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2541 (*pIt)->myUV, isDeformed )) {
2542 MESSAGE("cant Apply(face)");
2545 // try to use a complex algo if it is a difficult case
2546 if ( isDeformed && !compUVByElasticIsolines( edgesPointsList, fPoints ))
2548 for ( ; pIt != fPoints.end(); pIt++ ) // continue with the simple algo
2549 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2550 (*pIt)->myUV, isDeformed )) {
2551 MESSAGE("cant Apply(face)");
2556 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( face, loc );
2557 const gp_Trsf & aTrsf = loc.Transformation();
2558 for ( pIt = fPoints.begin(); pIt != fPoints.end(); pIt++ )
2560 TPoint * point = *pIt;
2561 point->myXYZ = aSurface->Value( point->myUV.X(), point->myUV.Y() );
2562 if ( !loc.IsIdentity() )
2563 aTrsf.Transforms( point->myXYZ.ChangeCoord() );
2566 myIsComputed = true;
2568 return setErrorCode( ERR_OK );
2571 //=======================================================================
2573 //purpose : Compute nodes coordinates applying
2574 // the loaded pattern to <theFace>. The first key-point
2575 // will be mapped into <theNodeIndexOnKeyPoint1>-th node
2576 //=======================================================================
2578 bool SMESH_Pattern::Apply (const SMDS_MeshFace* theFace,
2579 const int theNodeIndexOnKeyPoint1,
2580 const bool theReverse)
2582 // MESSAGE(" ::Apply(MeshFace) " );
2584 if ( !IsLoaded() ) {
2585 MESSAGE( "Pattern not loaded" );
2586 return setErrorCode( ERR_APPL_NOT_LOADED );
2589 // check nb of nodes
2590 if (theFace->NbNodes() != myNbKeyPntInBoundary.front() ) {
2591 MESSAGE( myKeyPointIDs.size() << " != " << theFace->NbNodes() );
2592 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2595 // find points on edges, it fills myNbKeyPntInBoundary
2596 if ( !findBoundaryPoints() )
2599 // check that there are no holes in a pattern
2600 if (myNbKeyPntInBoundary.size() > 1 ) {
2601 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2604 // Define the nodes order
2606 list< const SMDS_MeshNode* > nodes;
2607 list< const SMDS_MeshNode* >::iterator n = nodes.end();
2608 SMDS_ElemIteratorPtr noIt = theFace->nodesIterator();
2610 while ( noIt->more() ) {
2611 const SMDS_MeshNode* node = smdsNode( noIt->next() );
2612 nodes.push_back( node );
2613 if ( iSub++ == theNodeIndexOnKeyPoint1 )
2616 if ( n != nodes.end() ) {
2618 if ( n != --nodes.end() )
2619 nodes.splice( nodes.begin(), nodes, ++n, nodes.end() );
2622 else if ( n != nodes.begin() )
2623 nodes.splice( nodes.end(), nodes, nodes.begin(), n );
2625 list< gp_XYZ > xyzList;
2626 myOrderedNodes.resize( theFace->NbNodes() );
2627 for ( iSub = 0, n = nodes.begin(); n != nodes.end(); ++n ) {
2628 xyzList.push_back( gp_XYZ( (*n)->X(), (*n)->Y(), (*n)->Z() ));
2629 myOrderedNodes[ iSub++] = *n;
2632 // Define a face plane
2634 list< gp_XYZ >::iterator xyzIt = xyzList.begin();
2635 gp_Pnt P ( *xyzIt++ );
2636 gp_Vec Vx( P, *xyzIt++ ), N;
2638 N = Vx ^ gp_Vec( P, *xyzIt++ );
2639 } while ( N.SquareMagnitude() <= DBL_MIN && xyzIt != xyzList.end() );
2640 if ( N.SquareMagnitude() <= DBL_MIN )
2641 return setErrorCode( ERR_APPLF_BAD_FACE_GEOM );
2642 gp_Ax2 pos( P, N, Vx );
2644 // Compute UV of key-points on a plane
2645 for ( xyzIt = xyzList.begin(), iSub = 1; xyzIt != xyzList.end(); xyzIt++, iSub++ )
2647 gp_Vec vec ( pos.Location(), *xyzIt );
2648 TPoint* p = getShapePoints( iSub ).front();
2649 p->myUV.SetX( vec * pos.XDirection() );
2650 p->myUV.SetY( vec * pos.YDirection() );
2654 // points on edges to be used for UV computation of in-face points
2655 list< list< TPoint* > > edgesPointsList;
2656 edgesPointsList.push_back( list< TPoint* >() );
2657 list< TPoint* > * edgesPoints = & edgesPointsList.back();
2658 list< TPoint* >::iterator pIt;
2660 // compute UV and XYZ of points on edges
2662 for ( xyzIt = xyzList.begin(); xyzIt != xyzList.end(); iSub++ )
2664 gp_XYZ& xyz1 = *xyzIt++;
2665 gp_XYZ& xyz2 = ( xyzIt != xyzList.end() ) ? *xyzIt : xyzList.front();
2667 list< TPoint* > & ePoints = getShapePoints( iSub );
2668 ePoints.back()->myInitU = 1.0;
2669 list< TPoint* >::const_iterator pIt = ++ePoints.begin();
2670 while ( *pIt != ePoints.back() )
2673 p->myXYZ = xyz1 * ( 1 - p->myInitU ) + xyz2 * p->myInitU;
2674 gp_Vec vec ( pos.Location(), p->myXYZ );
2675 p->myUV.SetX( vec * pos.XDirection() );
2676 p->myUV.SetY( vec * pos.YDirection() );
2678 // collect on-edge points (excluding the last one)
2679 edgesPoints->insert( edgesPoints->end(), ePoints.begin(), --ePoints.end());
2682 // Compute UV and XYZ of in-face points
2684 // try to use a simple algo to compute UV
2685 list< TPoint* > & fPoints = getShapePoints( iSub );
2686 bool isDeformed = false;
2687 for ( pIt = fPoints.begin(); !isDeformed && pIt != fPoints.end(); pIt++ )
2688 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2689 (*pIt)->myUV, isDeformed )) {
2690 MESSAGE("cant Apply(face)");
2693 // try to use a complex algo if it is a difficult case
2694 if ( isDeformed && !compUVByElasticIsolines( edgesPointsList, fPoints ))
2696 for ( ; pIt != fPoints.end(); pIt++ ) // continue with the simple algo
2697 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2698 (*pIt)->myUV, isDeformed )) {
2699 MESSAGE("cant Apply(face)");
2704 for ( pIt = fPoints.begin(); pIt != fPoints.end(); pIt++ )
2706 (*pIt)->myXYZ = ElSLib::PlaneValue( (*pIt)->myUV.X(), (*pIt)->myUV.Y(), pos );
2709 myIsComputed = true;
2711 return setErrorCode( ERR_OK );
2714 //=======================================================================
2716 //purpose : Compute nodes coordinates applying
2717 // the loaded pattern to <theFace>. The first key-point
2718 // will be mapped into <theNodeIndexOnKeyPoint1>-th node
2719 //=======================================================================
2721 bool SMESH_Pattern::Apply (SMESH_Mesh* theMesh,
2722 const SMDS_MeshFace* theFace,
2723 const TopoDS_Shape& theSurface,
2724 const int theNodeIndexOnKeyPoint1,
2725 const bool theReverse)
2727 // MESSAGE(" ::Apply(MeshFace) " );
2728 if ( theSurface.IsNull() || theSurface.ShapeType() != TopAbs_FACE ) {
2729 return Apply( theFace, theNodeIndexOnKeyPoint1, theReverse);
2731 const TopoDS_Face& face = TopoDS::Face( theSurface );
2732 TopLoc_Location loc;
2733 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
2734 const gp_Trsf & aTrsf = loc.Transformation();
2736 if ( !IsLoaded() ) {
2737 MESSAGE( "Pattern not loaded" );
2738 return setErrorCode( ERR_APPL_NOT_LOADED );
2741 // check nb of nodes
2742 if (theFace->NbNodes() != myNbKeyPntInBoundary.front() ) {
2743 MESSAGE( myKeyPointIDs.size() << " != " << theFace->NbNodes() );
2744 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2747 // find points on edges, it fills myNbKeyPntInBoundary
2748 if ( !findBoundaryPoints() )
2751 // check that there are no holes in a pattern
2752 if (myNbKeyPntInBoundary.size() > 1 ) {
2753 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2756 // Define the nodes order
2758 list< const SMDS_MeshNode* > nodes;
2759 list< const SMDS_MeshNode* >::iterator n = nodes.end();
2760 SMDS_ElemIteratorPtr noIt = theFace->nodesIterator();
2762 while ( noIt->more() ) {
2763 const SMDS_MeshNode* node = smdsNode( noIt->next() );
2764 nodes.push_back( node );
2765 if ( iSub++ == theNodeIndexOnKeyPoint1 )
2768 if ( n != nodes.end() ) {
2770 if ( n != --nodes.end() )
2771 nodes.splice( nodes.begin(), nodes, ++n, nodes.end() );
2774 else if ( n != nodes.begin() )
2775 nodes.splice( nodes.end(), nodes, nodes.begin(), n );
2778 // find a node not on a seam edge, if necessary
2779 SMESH_MesherHelper helper( *theMesh );
2780 helper.SetSubShape( theSurface );
2781 const SMDS_MeshNode* inFaceNode = 0;
2782 if ( helper.GetNodeUVneedInFaceNode() )
2784 SMESH_MeshEditor editor( theMesh );
2785 for ( n = nodes.begin(); ( !inFaceNode && n != nodes.end()); ++n ) {
2786 int shapeID = editor.FindShape( *n );
2788 return Apply( theFace, theNodeIndexOnKeyPoint1, theReverse);
2789 if ( !helper.IsSeamShape( shapeID ))
2794 // Set UV of key-points (i.e. of nodes of theFace )
2795 vector< gp_XY > keyUV( theFace->NbNodes() );
2796 myOrderedNodes.resize( theFace->NbNodes() );
2797 for ( iSub = 1, n = nodes.begin(); n != nodes.end(); ++n, ++iSub )
2799 TPoint* p = getShapePoints( iSub ).front();
2800 p->myUV = helper.GetNodeUV( face, *n, inFaceNode );
2801 p->myXYZ = gp_XYZ( (*n)->X(), (*n)->Y(), (*n)->Z() );
2803 keyUV[ iSub-1 ] = p->myUV;
2804 myOrderedNodes[ iSub-1 ] = *n;
2807 // points on edges to be used for UV computation of in-face points
2808 list< list< TPoint* > > edgesPointsList;
2809 edgesPointsList.push_back( list< TPoint* >() );
2810 list< TPoint* > * edgesPoints = & edgesPointsList.back();
2811 list< TPoint* >::iterator pIt;
2813 // compute UV and XYZ of points on edges
2815 for ( int i = 0; i < myOrderedNodes.size(); ++i, ++iSub )
2817 gp_XY& uv1 = keyUV[ i ];
2818 gp_XY& uv2 = ( i+1 < keyUV.size() ) ? keyUV[ i+1 ] : keyUV[ 0 ];
2820 list< TPoint* > & ePoints = getShapePoints( iSub );
2821 ePoints.back()->myInitU = 1.0;
2822 list< TPoint* >::const_iterator pIt = ++ePoints.begin();
2823 while ( *pIt != ePoints.back() )
2826 p->myUV = uv1 * ( 1 - p->myInitU ) + uv2 * p->myInitU;
2827 p->myXYZ = surface->Value( p->myUV.X(), p->myUV.Y() );
2828 if ( !loc.IsIdentity() )
2829 aTrsf.Transforms( p->myXYZ.ChangeCoord() );
2831 // collect on-edge points (excluding the last one)
2832 edgesPoints->insert( edgesPoints->end(), ePoints.begin(), --ePoints.end());
2835 // Compute UV and XYZ of in-face points
2837 // try to use a simple algo to compute UV
2838 list< TPoint* > & fPoints = getShapePoints( iSub );
2839 bool isDeformed = false;
2840 for ( pIt = fPoints.begin(); !isDeformed && pIt != fPoints.end(); pIt++ )
2841 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2842 (*pIt)->myUV, isDeformed )) {
2843 MESSAGE("cant Apply(face)");
2846 // try to use a complex algo if it is a difficult case
2847 if ( isDeformed && !compUVByElasticIsolines( edgesPointsList, fPoints ))
2849 for ( ; pIt != fPoints.end(); pIt++ ) // continue with the simple algo
2850 if ( !compUVByIsoIntersection( edgesPointsList, (*pIt)->myInitUV,
2851 (*pIt)->myUV, isDeformed )) {
2852 MESSAGE("cant Apply(face)");
2857 for ( pIt = fPoints.begin(); pIt != fPoints.end(); pIt++ )
2859 TPoint * point = *pIt;
2860 point->myXYZ = surface->Value( point->myUV.X(), point->myUV.Y() );
2861 if ( !loc.IsIdentity() )
2862 aTrsf.Transforms( point->myXYZ.ChangeCoord() );
2865 myIsComputed = true;
2867 return setErrorCode( ERR_OK );
2870 //=======================================================================
2871 //function : undefinedXYZ
2873 //=======================================================================
2875 static const gp_XYZ& undefinedXYZ()
2877 static gp_XYZ xyz( 1.e100, 0., 0. );
2881 //=======================================================================
2882 //function : isDefined
2884 //=======================================================================
2886 inline static bool isDefined(const gp_XYZ& theXYZ)
2888 return theXYZ.X() < 1.e100;
2891 //=======================================================================
2893 //purpose : Compute nodes coordinates applying
2894 // the loaded pattern to <theFaces>. The first key-point
2895 // will be mapped into <theNodeIndexOnKeyPoint1>-th node
2896 //=======================================================================
2898 bool SMESH_Pattern::Apply (SMESH_Mesh* theMesh,
2899 std::set<const SMDS_MeshFace*>& theFaces,
2900 const int theNodeIndexOnKeyPoint1,
2901 const bool theReverse)
2903 MESSAGE(" ::Apply(set<MeshFace>) " );
2905 if ( !IsLoaded() ) {
2906 MESSAGE( "Pattern not loaded" );
2907 return setErrorCode( ERR_APPL_NOT_LOADED );
2910 // find points on edges, it fills myNbKeyPntInBoundary
2911 if ( !findBoundaryPoints() )
2914 // check that there are no holes in a pattern
2915 if (myNbKeyPntInBoundary.size() > 1 ) {
2916 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
2921 myElemXYZIDs.clear();
2922 myXYZIdToNodeMap.clear();
2924 myIdsOnBoundary.clear();
2925 myReverseConnectivity.clear();
2927 myXYZ.resize( myPoints.size() * theFaces.size(), undefinedXYZ() );
2928 myElements.reserve( theFaces.size() );
2930 // to find point index
2931 map< TPoint*, int > pointIndex;
2932 for ( int i = 0; i < myPoints.size(); i++ )
2933 pointIndex.insert( make_pair( & myPoints[ i ], i ));
2935 int ind1 = 0; // lowest point index for a face
2940 // SMESH_MeshEditor editor( theMesh );
2942 // apply to each face in theFaces set
2943 set<const SMDS_MeshFace*>::iterator face = theFaces.begin();
2944 for ( ; face != theFaces.end(); ++face )
2946 // int curShapeId = editor.FindShape( *face );
2947 // if ( curShapeId != shapeID ) {
2948 // if ( curShapeId )
2949 // shape = theMesh->GetMeshDS()->IndexToShape( curShapeId );
2952 // shapeID = curShapeId;
2955 if ( shape.IsNull() )
2956 ok = Apply( *face, theNodeIndexOnKeyPoint1, theReverse );
2958 ok = Apply( theMesh, *face, shape, theNodeIndexOnKeyPoint1, theReverse );
2960 MESSAGE( "Failed on " << *face );
2963 myElements.push_back( *face );
2965 // store computed points belonging to elements
2966 list< TElemDef >::iterator ll = myElemPointIDs.begin();
2967 for ( ; ll != myElemPointIDs.end(); ++ll )
2969 myElemXYZIDs.push_back(TElemDef());
2970 TElemDef& xyzIds = myElemXYZIDs.back();
2971 TElemDef& pIds = *ll;
2972 for ( TElemDef::iterator id = pIds.begin(); id != pIds.end(); id++ ) {
2973 int pIndex = *id + ind1;
2974 xyzIds.push_back( pIndex );
2975 myXYZ[ pIndex ] = myPoints[ *id ].myXYZ.XYZ();
2976 myReverseConnectivity[ pIndex ].push_back( & xyzIds );
2979 // put points on links to myIdsOnBoundary,
2980 // they will be used to sew new elements on adjacent refined elements
2981 int nbNodes = (*face)->NbNodes(), eID = nbNodes + 1;
2982 for ( int i = 0; i < nbNodes; i++ )
2984 list< TPoint* > & linkPoints = getShapePoints( eID++ );
2985 const SMDS_MeshNode* n1 = myOrderedNodes[ i ];
2986 const SMDS_MeshNode* n2 = myOrderedNodes[ i + 1 == nbNodes ? 0 : i + 1 ];
2987 // make a link and a node set
2988 TNodeSet linkSet, node1Set;
2989 linkSet.insert( n1 );
2990 linkSet.insert( n2 );
2991 node1Set.insert( n1 );
2992 list< TPoint* >::iterator p = linkPoints.begin();
2994 // map the first link point to n1
2995 int nId = pointIndex[ *p ] + ind1;
2996 myXYZIdToNodeMap[ nId ] = n1;
2997 list< list< int > >& groups = myIdsOnBoundary[ node1Set ];
2998 groups.push_back(list< int > ());
2999 groups.back().push_back( nId );
3001 // add the linkSet to the map
3002 list< list< int > >& groups = myIdsOnBoundary[ linkSet ];
3003 groups.push_back(list< int > ());
3004 list< int >& indList = groups.back();
3005 // add points to the map excluding the end points
3006 for ( p++; *p != linkPoints.back(); p++ )
3007 indList.push_back( pointIndex[ *p ] + ind1 );
3009 ind1 += myPoints.size();
3012 return !myElemXYZIDs.empty();
3015 //=======================================================================
3017 //purpose : Compute nodes coordinates applying
3018 // the loaded pattern to <theVolumes>. The (0,0,0) key-point
3019 // will be mapped into <theNode000Index>-th node. The
3020 // (0,0,1) key-point will be mapped into <theNode000Index>-th
3022 //=======================================================================
3024 bool SMESH_Pattern::Apply (std::set<const SMDS_MeshVolume*> & theVolumes,
3025 const int theNode000Index,
3026 const int theNode001Index)
3028 MESSAGE(" ::Apply(set<MeshVolumes>) " );
3030 if ( !IsLoaded() ) {
3031 MESSAGE( "Pattern not loaded" );
3032 return setErrorCode( ERR_APPL_NOT_LOADED );
3035 // bind ID to points
3036 if ( !findBoundaryPoints() )
3039 // check that there are no holes in a pattern
3040 if (myNbKeyPntInBoundary.size() > 1 ) {
3041 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
3046 myElemXYZIDs.clear();
3047 myXYZIdToNodeMap.clear();
3049 myIdsOnBoundary.clear();
3050 myReverseConnectivity.clear();
3052 myXYZ.resize( myPoints.size() * theVolumes.size(), undefinedXYZ() );
3053 myElements.reserve( theVolumes.size() );
3055 // to find point index
3056 map< TPoint*, int > pointIndex;
3057 for ( int i = 0; i < myPoints.size(); i++ )
3058 pointIndex.insert( make_pair( & myPoints[ i ], i ));
3060 int ind1 = 0; // lowest point index for an element
3062 // apply to each element in theVolumes set
3063 set<const SMDS_MeshVolume*>::iterator vol = theVolumes.begin();
3064 for ( ; vol != theVolumes.end(); ++vol )
3066 if ( !Apply( *vol, theNode000Index, theNode001Index )) {
3067 MESSAGE( "Failed on " << *vol );
3070 myElements.push_back( *vol );
3072 // store computed points belonging to elements
3073 list< TElemDef >::iterator ll = myElemPointIDs.begin();
3074 for ( ; ll != myElemPointIDs.end(); ++ll )
3076 myElemXYZIDs.push_back(TElemDef());
3077 TElemDef& xyzIds = myElemXYZIDs.back();
3078 TElemDef& pIds = *ll;
3079 for ( TElemDef::iterator id = pIds.begin(); id != pIds.end(); id++ ) {
3080 int pIndex = *id + ind1;
3081 xyzIds.push_back( pIndex );
3082 myXYZ[ pIndex ] = myPoints[ *id ].myXYZ.XYZ();
3083 myReverseConnectivity[ pIndex ].push_back( & xyzIds );
3086 // put points on edges and faces to myIdsOnBoundary,
3087 // they will be used to sew new elements on adjacent refined elements
3088 for ( int Id = SMESH_Block::ID_V000; Id <= SMESH_Block::ID_F1yz; Id++ )
3090 // make a set of sub-points
3092 vector< int > subIDs;
3093 if ( SMESH_Block::IsVertexID( Id )) {
3094 subNodes.insert( myOrderedNodes[ Id - 1 ]);
3096 else if ( SMESH_Block::IsEdgeID( Id )) {
3097 SMESH_Block::GetEdgeVertexIDs( Id, subIDs );
3098 subNodes.insert( myOrderedNodes[ subIDs.front() - 1 ]);
3099 subNodes.insert( myOrderedNodes[ subIDs.back() - 1 ]);
3102 SMESH_Block::GetFaceEdgesIDs( Id, subIDs );
3103 int e1 = subIDs[ 0 ], e2 = subIDs[ 1 ];
3104 SMESH_Block::GetEdgeVertexIDs( e1, subIDs );
3105 subNodes.insert( myOrderedNodes[ subIDs.front() - 1 ]);
3106 subNodes.insert( myOrderedNodes[ subIDs.back() - 1 ]);
3107 SMESH_Block::GetEdgeVertexIDs( e2, subIDs );
3108 subNodes.insert( myOrderedNodes[ subIDs.front() - 1 ]);
3109 subNodes.insert( myOrderedNodes[ subIDs.back() - 1 ]);
3112 list< TPoint* > & points = getShapePoints( Id );
3113 list< TPoint* >::iterator p = points.begin();
3114 list< list< int > >& groups = myIdsOnBoundary[ subNodes ];
3115 groups.push_back(list< int > ());
3116 list< int >& indList = groups.back();
3117 for ( ; p != points.end(); p++ )
3118 indList.push_back( pointIndex[ *p ] + ind1 );
3119 if ( subNodes.size() == 1 ) // vertex case
3120 myXYZIdToNodeMap[ indList.back() ] = myOrderedNodes[ Id - 1 ];
3122 ind1 += myPoints.size();
3125 return !myElemXYZIDs.empty();
3128 //=======================================================================
3130 //purpose : Create a pattern from the mesh built on <theBlock>
3131 //=======================================================================
3133 bool SMESH_Pattern::Load (SMESH_Mesh* theMesh,
3134 const TopoDS_Shell& theBlock)
3136 MESSAGE(" ::Load(volume) " );
3139 SMESHDS_SubMesh * aSubMesh;
3141 // load shapes in myShapeIDMap
3143 TopoDS_Vertex v1, v2;
3144 if ( !block.LoadBlockShapes( theBlock, v1, v2, myShapeIDMap ))
3145 return setErrorCode( ERR_LOADV_BAD_SHAPE );
3148 int nbNodes = 0, shapeID;
3149 for ( shapeID = 1; shapeID <= myShapeIDMap.Extent(); shapeID++ )
3151 const TopoDS_Shape& S = myShapeIDMap( shapeID );
3152 aSubMesh = getSubmeshWithElements( theMesh, S );
3154 nbNodes += aSubMesh->NbNodes();
3156 myPoints.resize( nbNodes );
3158 // load U of points on edges
3159 TNodePointIDMap nodePointIDMap;
3161 for ( shapeID = 1; shapeID <= myShapeIDMap.Extent(); shapeID++ )
3163 const TopoDS_Shape& S = myShapeIDMap( shapeID );
3164 list< TPoint* > & shapePoints = getShapePoints( shapeID );
3165 aSubMesh = getSubmeshWithElements( theMesh, S );
3166 if ( ! aSubMesh ) continue;
3167 SMDS_NodeIteratorPtr nIt = aSubMesh->GetNodes();
3168 if ( !nIt->more() ) continue;
3170 // store a node and a point
3171 while ( nIt->more() ) {
3172 const SMDS_MeshNode* node = smdsNode( nIt->next() );
3173 nodePointIDMap.insert( make_pair( node, iPoint ));
3174 if ( block.IsVertexID( shapeID ))
3175 myKeyPointIDs.push_back( iPoint );
3176 TPoint* p = & myPoints[ iPoint++ ];
3177 shapePoints.push_back( p );
3178 p->myXYZ.SetCoord( node->X(), node->Y(), node->Z() );
3179 p->myInitXYZ.SetCoord( 0,0,0 );
3181 list< TPoint* >::iterator pIt = shapePoints.begin();
3184 switch ( S.ShapeType() )
3189 for ( ; pIt != shapePoints.end(); pIt++ ) {
3190 double * coef = block.GetShapeCoef( shapeID );
3191 for ( int iCoord = 1; iCoord <= 3; iCoord++ )
3192 if ( coef[ iCoord - 1] > 0 )
3193 (*pIt)->myInitXYZ.SetCoord( iCoord, 1. );
3195 if ( S.ShapeType() == TopAbs_VERTEX )
3198 const TopoDS_Edge& edge = TopoDS::Edge( S );
3200 BRep_Tool::Range( edge, f, l );
3201 int iCoord = SMESH_Block::GetCoordIndOnEdge( shapeID );
3202 bool isForward = SMESH_Block::IsForwardEdge( edge, myShapeIDMap );
3203 pIt = shapePoints.begin();
3204 nIt = aSubMesh->GetNodes();
3205 for ( ; nIt->more(); pIt++ )
3207 const SMDS_MeshNode* node = smdsNode( nIt->next() );
3208 const SMDS_EdgePosition* epos =
3209 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
3210 double u = ( epos->GetUParameter() - f ) / ( l - f );
3211 (*pIt)->myInitXYZ.SetCoord( iCoord, isForward ? u : 1 - u );
3216 for ( ; pIt != shapePoints.end(); pIt++ )
3218 if ( !block.ComputeParameters( (*pIt)->myXYZ, (*pIt)->myInitXYZ, shapeID )) {
3219 MESSAGE( "!block.ComputeParameters()" );
3220 return setErrorCode( ERR_LOADV_COMPUTE_PARAMS );
3224 } // loop on block sub-shapes
3228 aSubMesh = getSubmeshWithElements( theMesh, theBlock );
3231 SMDS_ElemIteratorPtr elemIt = aSubMesh->GetElements();
3232 while ( elemIt->more() ) {
3233 SMDS_ElemIteratorPtr nIt = elemIt->next()->nodesIterator();
3234 myElemPointIDs.push_back( TElemDef() );
3235 TElemDef& elemPoints = myElemPointIDs.back();
3236 while ( nIt->more() )
3237 elemPoints.push_back( nodePointIDMap[ nIt->next() ]);
3241 myIsBoundaryPointsFound = true;
3243 return setErrorCode( ERR_OK );
3246 //=======================================================================
3247 //function : getSubmeshWithElements
3248 //purpose : return submesh containing elements bound to theBlock in theMesh
3249 //=======================================================================
3251 SMESHDS_SubMesh * SMESH_Pattern::getSubmeshWithElements(SMESH_Mesh* theMesh,
3252 const TopoDS_Shape& theShape)
3254 SMESHDS_SubMesh * aSubMesh = theMesh->GetMeshDS()->MeshElements( theShape );
3255 if ( aSubMesh && ( aSubMesh->GetElements()->more() || aSubMesh->GetNodes()->more() ))
3258 if ( theShape.ShapeType() == TopAbs_SHELL )
3260 // look for submesh of VOLUME
3261 TopTools_ListIteratorOfListOfShape it( theMesh->GetAncestors( theShape ));
3262 for (; it.More(); it.Next()) {
3263 aSubMesh = theMesh->GetMeshDS()->MeshElements( it.Value() );
3264 if ( aSubMesh && ( aSubMesh->GetElements()->more() || aSubMesh->GetNodes()->more() ))
3272 //=======================================================================
3274 //purpose : Compute nodes coordinates applying
3275 // the loaded pattern to <theBlock>. The (0,0,0) key-point
3276 // will be mapped into <theVertex000>. The (0,0,1)
3277 // fifth key-point will be mapped into <theVertex001>.
3278 //=======================================================================
3280 bool SMESH_Pattern::Apply (const TopoDS_Shell& theBlock,
3281 const TopoDS_Vertex& theVertex000,
3282 const TopoDS_Vertex& theVertex001)
3284 MESSAGE(" ::Apply(volume) " );
3286 if (!findBoundaryPoints() || // bind ID to points
3287 !setShapeToMesh( theBlock )) // check theBlock is a suitable shape
3290 SMESH_Block block; // bind ID to shape
3291 if (!block.LoadBlockShapes( theBlock, theVertex000, theVertex001, myShapeIDMap ))
3292 return setErrorCode( ERR_APPLV_BAD_SHAPE );
3294 // compute XYZ of points on shapes
3296 for ( int shapeID = 1; shapeID <= myShapeIDMap.Extent(); shapeID++ )
3298 list< TPoint* > & shapePoints = getShapePoints( shapeID );
3299 list< TPoint* >::iterator pIt = shapePoints.begin();
3300 const TopoDS_Shape& S = myShapeIDMap( shapeID );
3301 switch ( S.ShapeType() )
3303 case TopAbs_VERTEX: {
3305 for ( ; pIt != shapePoints.end(); pIt++ )
3306 block.VertexPoint( shapeID, (*pIt)->myXYZ.ChangeCoord() );
3311 for ( ; pIt != shapePoints.end(); pIt++ )
3312 block.EdgePoint( shapeID, (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3317 for ( ; pIt != shapePoints.end(); pIt++ )
3318 block.FacePoint( shapeID, (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3322 for ( ; pIt != shapePoints.end(); pIt++ )
3323 block.ShellPoint( (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3325 } // loop on block sub-shapes
3327 myIsComputed = true;
3329 return setErrorCode( ERR_OK );
3332 //=======================================================================
3334 //purpose : Compute nodes coordinates applying
3335 // the loaded pattern to <theVolume>. The (0,0,0) key-point
3336 // will be mapped into <theNode000Index>-th node. The
3337 // (0,0,1) key-point will be mapped into <theNode000Index>-th
3339 //=======================================================================
3341 bool SMESH_Pattern::Apply (const SMDS_MeshVolume* theVolume,
3342 const int theNode000Index,
3343 const int theNode001Index)
3345 //MESSAGE(" ::Apply(MeshVolume) " );
3347 if (!findBoundaryPoints()) // bind ID to points
3350 SMESH_Block block; // bind ID to shape
3351 if (!block.LoadMeshBlock( theVolume, theNode000Index, theNode001Index, myOrderedNodes ))
3352 return setErrorCode( ERR_APPLV_BAD_SHAPE );
3353 // compute XYZ of points on shapes
3355 for ( int ID = SMESH_Block::ID_V000; ID <= SMESH_Block::ID_Shell; ID++ )
3357 list< TPoint* > & shapePoints = getShapePoints( ID );
3358 list< TPoint* >::iterator pIt = shapePoints.begin();
3360 if ( block.IsVertexID( ID ))
3361 for ( ; pIt != shapePoints.end(); pIt++ ) {
3362 block.VertexPoint( ID, (*pIt)->myXYZ.ChangeCoord() );
3364 else if ( block.IsEdgeID( ID ))
3365 for ( ; pIt != shapePoints.end(); pIt++ ) {
3366 block.EdgePoint( ID, (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3368 else if ( block.IsFaceID( ID ))
3369 for ( ; pIt != shapePoints.end(); pIt++ ) {
3370 block.FacePoint( ID, (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3373 for ( ; pIt != shapePoints.end(); pIt++ )
3374 block.ShellPoint( (*pIt)->myInitXYZ, (*pIt)->myXYZ.ChangeCoord() );
3375 } // loop on block sub-shapes
3377 myIsComputed = true;
3379 return setErrorCode( ERR_OK );
3382 //=======================================================================
3383 //function : mergePoints
3384 //purpose : Merge XYZ on edges and/or faces.
3385 //=======================================================================
3387 void SMESH_Pattern::mergePoints (const bool uniteGroups)
3389 map< TNodeSet, list< list< int > > >::iterator idListIt = myIdsOnBoundary.begin();
3390 for ( ; idListIt != myIdsOnBoundary.end(); idListIt++ )
3392 list<list< int > >& groups = idListIt->second;
3393 if ( groups.size() < 2 )
3397 const TNodeSet& nodes = idListIt->first;
3398 double tol2 = 1.e-10;
3399 if ( nodes.size() > 1 ) {
3401 TNodeSet::const_iterator n = nodes.begin();
3402 for ( ; n != nodes.end(); ++n )
3403 box.Add( gp_Pnt( (*n)->X(), (*n)->Y(), (*n)->Z() ));
3404 double x, y, z, X, Y, Z;
3405 box.Get( x, y, z, X, Y, Z );
3406 gp_Pnt p( x, y, z ), P( X, Y, Z );
3407 tol2 = 1.e-4 * p.SquareDistance( P );
3410 // to unite groups on link
3411 bool unite = ( uniteGroups && nodes.size() == 2 );
3412 map< double, int > distIndMap;
3413 const SMDS_MeshNode* node = *nodes.begin();
3414 gp_Pnt P( node->X(), node->Y(), node->Z() );
3416 // compare points, replace indices
3418 list< int >::iterator ind1, ind2;
3419 list< list< int > >::iterator grpIt1, grpIt2;
3420 for ( grpIt1 = groups.begin(); grpIt1 != groups.end(); grpIt1++ )
3422 list< int >& indices1 = *grpIt1;
3424 for ( grpIt2++; grpIt2 != groups.end(); grpIt2++ )
3426 list< int >& indices2 = *grpIt2;
3427 for ( ind1 = indices1.begin(); ind1 != indices1.end(); ind1++ )
3429 gp_XYZ& p1 = myXYZ[ *ind1 ];
3430 ind2 = indices2.begin();
3431 while ( ind2 != indices2.end() )
3433 gp_XYZ& p2 = myXYZ[ *ind2 ];
3434 //MESSAGE("COMP: " << *ind1 << " " << *ind2 << " X: " << p2.X() << " tol2: " << tol2);
3435 if ( ( p1 - p2 ).SquareModulus() <= tol2 )
3437 ASSERT( myReverseConnectivity.find( *ind2 ) != myReverseConnectivity.end() );
3438 list< TElemDef* > & elemXYZIDsList = myReverseConnectivity[ *ind2 ];
3439 list< TElemDef* >::iterator elemXYZIDs = elemXYZIDsList.begin();
3440 for ( ; elemXYZIDs != elemXYZIDsList.end(); elemXYZIDs++ )
3442 //MESSAGE( " Replace " << *ind2 << " with " << *ind1 );
3443 myXYZ[ *ind2 ] = undefinedXYZ();
3444 replace( (*elemXYZIDs)->begin(), (*elemXYZIDs)->end(), *ind2, *ind1 );
3446 ind2 = indices2.erase( ind2 );
3453 if ( unite ) { // sort indices using distIndMap
3454 for ( ind1 = indices1.begin(); ind1 != indices1.end(); ind1++ )
3456 ASSERT( isDefined( myXYZ[ *ind1 ] ));
3457 double dist = P.SquareDistance( myXYZ[ *ind1 ]);
3458 distIndMap.insert( make_pair( dist, *ind1 ));
3462 if ( unite ) { // put all sorted indices into the first group
3463 list< int >& g = groups.front();
3465 map< double, int >::iterator dist_ind = distIndMap.begin();
3466 for ( ; dist_ind != distIndMap.end(); dist_ind++ )
3467 g.push_back( dist_ind->second );
3469 } // loop on myIdsOnBoundary
3472 //=======================================================================
3473 //function : makePolyElements
3474 //purpose : prepare intermediate data to create Polygons and Polyhedrons
3475 //=======================================================================
3477 void SMESH_Pattern::
3478 makePolyElements(const vector< const SMDS_MeshNode* >& theNodes,
3479 const bool toCreatePolygons,
3480 const bool toCreatePolyedrs)
3482 myPolyElemXYZIDs.clear();
3483 myPolyElems.clear();
3484 myPolyElems.reserve( myIdsOnBoundary.size() );
3486 // make a set of refined elements
3487 TIDSortedElemSet avoidSet, elemSet;
3488 std::vector<const SMDS_MeshElement*>::iterator itv = myElements.begin();
3489 for(; itv!=myElements.end(); itv++) {
3490 const SMDS_MeshElement* el = (*itv);
3491 avoidSet.insert( el );
3493 //avoidSet.insert( myElements.begin(), myElements.end() );
3495 map< TNodeSet, list< list< int > > >::iterator indListIt, nn_IdList;
3497 if ( toCreatePolygons )
3499 int lastFreeId = myXYZ.size();
3501 // loop on links of refined elements
3502 indListIt = myIdsOnBoundary.begin();
3503 for ( ; indListIt != myIdsOnBoundary.end(); indListIt++ )
3505 const TNodeSet & linkNodes = indListIt->first;
3506 if ( linkNodes.size() != 2 )
3507 continue; // skip face
3508 const SMDS_MeshNode* n1 = * linkNodes.begin();
3509 const SMDS_MeshNode* n2 = * linkNodes.rbegin();
3511 list<list< int > >& idGroups = indListIt->second; // ids of nodes to build
3512 if ( idGroups.empty() || idGroups.front().empty() )
3515 // find not refined face having n1-n2 link
3519 const SMDS_MeshElement* face =
3520 SMESH_MeshEditor::FindFaceInSet( n1, n2, elemSet, avoidSet );
3523 avoidSet.insert ( face );
3524 myPolyElems.push_back( face );
3526 // some links of <face> are split;
3527 // make list of xyz for <face>
3528 myPolyElemXYZIDs.push_back(TElemDef());
3529 TElemDef & faceNodeIds = myPolyElemXYZIDs.back();
3530 // loop on links of a <face>
3531 SMDS_ElemIteratorPtr nIt = face->nodesIterator();
3532 int i = 0, nbNodes = face->NbNodes();
3533 vector<const SMDS_MeshNode*> nodes( nbNodes + 1 );
3534 while ( nIt->more() )
3535 nodes[ i++ ] = smdsNode( nIt->next() );
3536 nodes[ i ] = nodes[ 0 ];
3537 for ( i = 0; i < nbNodes; ++i )
3539 // look for point mapped on a link
3540 TNodeSet faceLinkNodes;
3541 faceLinkNodes.insert( nodes[ i ] );
3542 faceLinkNodes.insert( nodes[ i + 1 ] );
3543 if ( faceLinkNodes == linkNodes )
3544 nn_IdList = indListIt;
3546 nn_IdList = myIdsOnBoundary.find( faceLinkNodes );
3547 // add face point ids
3548 faceNodeIds.push_back( ++lastFreeId );
3549 myXYZIdToNodeMap.insert( make_pair( lastFreeId, nodes[ i ]));
3550 if ( nn_IdList != myIdsOnBoundary.end() )
3552 // there are points mapped on a link
3553 list< int >& mappedIds = nn_IdList->second.front();
3554 if ( isReversed( nodes[ i ], mappedIds ))
3555 faceNodeIds.insert (faceNodeIds.end(),mappedIds.rbegin(), mappedIds.rend() );
3557 faceNodeIds.insert (faceNodeIds.end(),mappedIds.begin(), mappedIds.end() );
3559 } // loop on links of a <face>
3565 if ( myIs2D && idGroups.size() > 1 ) {
3567 // sew new elements on 2 refined elements sharing n1-n2 link
3569 list< int >& idsOnLink = idGroups.front();
3570 // temporarily add ids of link nodes to idsOnLink
3571 bool rev = isReversed( n1, idsOnLink );
3572 for ( int i = 0; i < 2; ++i )
3575 nodeSet.insert( i ? n2 : n1 );
3576 ASSERT( myIdsOnBoundary.find( nodeSet ) != myIdsOnBoundary.end() );
3577 list<list< int > >& groups = myIdsOnBoundary[ nodeSet ];
3578 int nodeId = groups.front().front();
3580 if ( rev ) append = !append;
3582 idsOnLink.push_back( nodeId );
3584 idsOnLink.push_front( nodeId );
3586 list< int >::iterator id = idsOnLink.begin();
3587 for ( ; id != idsOnLink.end(); ++id ) // loop on XYZ ids on a link
3589 list< TElemDef* >& elemDefs = myReverseConnectivity[ *id ]; // elems sharing id
3590 list< TElemDef* >::iterator pElemDef = elemDefs.begin();
3591 for ( ; pElemDef != elemDefs.end(); pElemDef++ ) // loop on elements sharing id
3593 TElemDef* pIdList = *pElemDef; // ptr on list of ids making element up
3594 // look for <id> in element definition
3595 TElemDef::iterator idDef = find( pIdList->begin(), pIdList->end(), *id );
3596 ASSERT ( idDef != pIdList->end() );
3597 // look for 2 neighbour ids of <id> in element definition
3598 for ( int prev = 0; prev < 2; ++prev ) {
3599 TElemDef::iterator idDef2 = idDef;
3601 idDef2 = ( idDef2 == pIdList->begin() ) ? --pIdList->end() : --idDef2;
3603 idDef2 = ( ++idDef2 == pIdList->end() ) ? pIdList->begin() : idDef2;
3604 // look for idDef2 on a link starting from id
3605 list< int >::iterator id2 = find( id, idsOnLink.end(), *idDef2 );
3606 if ( id2 != idsOnLink.end() && id != --id2 ) { // found not next to id
3607 // insert ids located on link between <id> and <id2>
3608 // into the element definition between idDef and idDef2
3610 for ( ; id2 != id; --id2 )
3611 pIdList->insert( idDef, *id2 );
3613 list< int >::iterator id1 = id;
3614 for ( ++id1, ++id2; id1 != id2; ++id1 )
3615 pIdList->insert( idDef2, *id1 );
3621 // remove ids of link nodes
3622 idsOnLink.pop_front();
3623 idsOnLink.pop_back();
3625 } // loop on myIdsOnBoundary
3626 } // if ( toCreatePolygons )
3628 if ( toCreatePolyedrs )
3630 // check volumes adjacent to the refined elements
3631 SMDS_VolumeTool volTool;
3632 vector<const SMDS_MeshElement*>::iterator refinedElem = myElements.begin();
3633 for ( ; refinedElem != myElements.end(); ++refinedElem )
3635 // loop on nodes of refinedElem
3636 SMDS_ElemIteratorPtr nIt = (*refinedElem)->nodesIterator();
3637 while ( nIt->more() ) {
3638 const SMDS_MeshNode* node = smdsNode( nIt->next() );
3639 // loop on inverse elements of node
3640 SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator();
3641 while ( eIt->more() )
3643 const SMDS_MeshElement* elem = eIt->next();
3644 if ( !volTool.Set( elem ) || !avoidSet.insert( elem ).second )
3645 continue; // skip faces or refined elements
3646 // add polyhedron definition
3647 myPolyhedronQuantities.push_back(vector<int> ());
3648 myPolyElemXYZIDs.push_back(TElemDef());
3649 vector<int>& quantity = myPolyhedronQuantities.back();
3650 TElemDef & elemDef = myPolyElemXYZIDs.back();
3651 // get definitions of new elements on volume faces
3652 bool makePoly = false;
3653 for ( int iF = 0; iF < volTool.NbFaces(); ++iF )
3655 if ( getFacesDefinition(volTool.GetFaceNodes( iF ),
3656 volTool.NbFaceNodes( iF ),
3657 theNodes, elemDef, quantity))
3661 myPolyElems.push_back( elem );
3663 myPolyhedronQuantities.pop_back();
3664 myPolyElemXYZIDs.pop_back();
3672 //=======================================================================
3673 //function : getFacesDefinition
3674 //purpose : return faces definition for a volume face defined by theBndNodes
3675 //=======================================================================
3677 bool SMESH_Pattern::
3678 getFacesDefinition(const SMDS_MeshNode** theBndNodes,
3679 const int theNbBndNodes,
3680 const vector< const SMDS_MeshNode* >& theNodes,
3681 list< int >& theFaceDefs,
3682 vector<int>& theQuantity)
3684 bool makePoly = false;
3685 // cout << "FROM FACE NODES: " <<endl;
3686 // for ( int i = 0; i < theNbBndNodes; ++i )
3687 // cout << theBndNodes[ i ];
3689 set< const SMDS_MeshNode* > bndNodeSet;
3690 for ( int i = 0; i < theNbBndNodes; ++i )
3691 bndNodeSet.insert( theBndNodes[ i ]);
3693 map< TNodeSet, list< list< int > > >::iterator nn_IdList;
3695 // make a set of all nodes on a face
3697 if ( !myIs2D ) { // for 2D, merge only edges
3698 nn_IdList = myIdsOnBoundary.find( bndNodeSet );
3699 if ( nn_IdList != myIdsOnBoundary.end() ) {
3701 list< int > & faceIds = nn_IdList->second.front();
3702 ids.insert( faceIds.begin(), faceIds.end() );
3705 //bool hasIdsInFace = !ids.empty();
3707 // add ids on links and bnd nodes
3708 int lastFreeId = Max( myXYZIdToNodeMap.rbegin()->first, theNodes.size() );
3709 TElemDef faceDef; // definition for the case if there is no new adjacent volumes
3710 for ( int iN = 0; iN < theNbBndNodes; ++iN )
3712 // add id of iN-th bnd node
3714 nSet.insert( theBndNodes[ iN ] );
3715 nn_IdList = myIdsOnBoundary.find( nSet );
3716 int bndId = ++lastFreeId;
3717 if ( nn_IdList != myIdsOnBoundary.end() ) {
3718 bndId = nn_IdList->second.front().front();
3719 ids.insert( bndId );
3722 myXYZIdToNodeMap.insert( make_pair( bndId, theBndNodes[ iN ] ));
3723 faceDef.push_back( bndId );
3724 // add ids on a link
3726 linkNodes.insert( theBndNodes[ iN ]);
3727 linkNodes.insert( theBndNodes[ iN + 1 == theNbBndNodes ? 0 : iN + 1 ]);
3728 nn_IdList = myIdsOnBoundary.find( linkNodes );
3729 if ( nn_IdList != myIdsOnBoundary.end() ) {
3731 list< int > & linkIds = nn_IdList->second.front();
3732 ids.insert( linkIds.begin(), linkIds.end() );
3733 if ( isReversed( theBndNodes[ iN ], linkIds ))
3734 faceDef.insert( faceDef.end(), linkIds.begin(), linkIds.end() );
3736 faceDef.insert( faceDef.end(), linkIds.rbegin(), linkIds.rend() );
3740 // find faces definition of new volumes
3742 bool defsAdded = false;
3743 if ( !myIs2D ) { // for 2D, merge only edges
3744 SMDS_VolumeTool vol;
3745 set< TElemDef* > checkedVolDefs;
3746 set< int >::iterator id = ids.begin();
3747 for ( ; id != ids.end(); ++id )
3749 // definitions of volumes sharing id
3750 list< TElemDef* >& defList = myReverseConnectivity[ *id ];
3751 ASSERT( !defList.empty() );
3752 // loop on volume definitions
3753 list< TElemDef* >::iterator pIdList = defList.begin();
3754 for ( ; pIdList != defList.end(); ++pIdList)
3756 if ( !checkedVolDefs.insert( *pIdList ).second )
3757 continue; // skip already checked volume definition
3758 vector< int > idVec;
3759 idVec.reserve( (*pIdList)->size() );
3760 idVec.insert( idVec.begin(), (*pIdList)->begin(), (*pIdList)->end() );
3761 // loop on face defs of a volume
3762 SMDS_VolumeTool::VolumeType volType = vol.GetType( idVec.size() );
3763 if ( volType == SMDS_VolumeTool::UNKNOWN )
3765 int nbFaces = vol.NbFaces( volType );
3766 for ( int iF = 0; iF < nbFaces; ++iF )
3768 const int* nodeInds = vol.GetFaceNodesIndices( volType, iF, true );
3769 int iN, nbN = vol.NbFaceNodes( volType, iF );
3770 // check if all nodes of a faces are in <ids>
3772 for ( iN = 0; iN < nbN && all; ++iN ) {
3773 int nodeId = idVec[ nodeInds[ iN ]];
3774 all = ( ids.find( nodeId ) != ids.end() );
3777 // store a face definition
3778 for ( iN = 0; iN < nbN; ++iN ) {
3779 theFaceDefs.push_back( idVec[ nodeInds[ iN ]]);
3781 theQuantity.push_back( nbN );
3789 theQuantity.push_back( faceDef.size() );
3790 theFaceDefs.splice( theFaceDefs.end(), faceDef, faceDef.begin(), faceDef.end() );
3796 //=======================================================================
3797 //function : clearSubMesh
3799 //=======================================================================
3801 static bool clearSubMesh( SMESH_Mesh* theMesh,
3802 const TopoDS_Shape& theShape)
3804 bool removed = false;
3805 if ( SMESH_subMesh * aSubMesh = theMesh->GetSubMeshContaining( theShape ))
3807 removed = !aSubMesh->IsEmpty();
3809 aSubMesh->ComputeStateEngine( SMESH_subMesh::CLEAN );
3812 SMESHDS_Mesh* aMeshDS = theMesh->GetMeshDS();
3813 if ( SMESHDS_SubMesh* aSubMeshDS = aMeshDS->MeshElements( theShape ))
3815 SMDS_ElemIteratorPtr eIt = aSubMeshDS->GetElements();
3816 removed = eIt->more();
3817 while ( eIt->more() )
3818 aMeshDS->RemoveElement( eIt->next() );
3819 SMDS_NodeIteratorPtr nIt = aSubMeshDS->GetNodes();
3820 removed = removed || nIt->more();
3821 while ( nIt->more() )
3822 aMeshDS->RemoveNode( smdsNode( nIt->next() ));
3828 //=======================================================================
3829 //function : clearMesh
3830 //purpose : clear mesh elements existing on myShape in theMesh
3831 //=======================================================================
3833 void SMESH_Pattern::clearMesh(SMESH_Mesh* theMesh) const
3836 if ( !myShape.IsNull() )
3838 if ( !clearSubMesh( theMesh, myShape ) && !myIs2D ) { // myShape is SHELL but volumes may be bound to SOLID
3839 TopTools_ListIteratorOfListOfShape it( theMesh->GetAncestors( myShape ));
3840 for (; it.More() && it.Value().ShapeType() == TopAbs_SOLID; it.Next())
3842 clearSubMesh( theMesh, it.Value() );
3848 //=======================================================================
3849 //function : MakeMesh
3850 //purpose : Create nodes and elements in <theMesh> using nodes
3851 // coordinates computed by either of Apply...() methods
3852 // WARNING : StdMeshers_Projection_... relies on MakeMesh() behavior: that
3853 // it does not care of nodes and elements already existing on
3854 // subshapes. DO NOT MERGE them or modify also StdMeshers_Projection_..
3855 //=======================================================================
3857 bool SMESH_Pattern::MakeMesh(SMESH_Mesh* theMesh,
3858 const bool toCreatePolygons,
3859 const bool toCreatePolyedrs)
3861 MESSAGE(" ::MakeMesh() " );
3862 if ( !myIsComputed )
3863 return setErrorCode( ERR_MAKEM_NOT_COMPUTED );
3865 mergePoints( toCreatePolygons );
3867 SMESHDS_Mesh* aMeshDS = theMesh->GetMeshDS();
3869 // clear elements and nodes existing on myShape
3872 bool onMeshElements = ( !myElements.empty() );
3874 // Create missing nodes
3876 vector< const SMDS_MeshNode* > nodesVector; // i-th point/xyz -> node
3877 if ( onMeshElements )
3879 nodesVector.resize( Max( myXYZ.size(), myXYZIdToNodeMap.rbegin()->first ), 0 );
3880 map< int, const SMDS_MeshNode*>::iterator i_node = myXYZIdToNodeMap.begin();
3881 for ( ; i_node != myXYZIdToNodeMap.end(); i_node++ ) {
3882 nodesVector[ i_node->first ] = i_node->second;
3884 for ( int i = 0; i < myXYZ.size(); ++i ) {
3885 if ( !nodesVector[ i ] && isDefined( myXYZ[ i ] ) )
3886 nodesVector[ i ] = aMeshDS->AddNode (myXYZ[ i ].X(),
3893 nodesVector.resize( myPoints.size(), 0 );
3895 // to find point index
3896 map< TPoint*, int > pointIndex;
3897 for ( int i = 0; i < myPoints.size(); i++ )
3898 pointIndex.insert( make_pair( & myPoints[ i ], i ));
3900 // loop on sub-shapes of myShape: create nodes
3901 map< int, list< TPoint* > >::iterator idPointIt = myShapeIDToPointsMap.begin();
3902 for ( ; idPointIt != myShapeIDToPointsMap.end(); idPointIt++ )
3905 //SMESHDS_SubMesh * subMeshDS = 0;
3906 if ( !myShapeIDMap.IsEmpty() ) {
3907 S = myShapeIDMap( idPointIt->first );
3908 //subMeshDS = aMeshDS->MeshElements( S );
3910 list< TPoint* > & points = idPointIt->second;
3911 list< TPoint* >::iterator pIt = points.begin();
3912 for ( ; pIt != points.end(); pIt++ )
3914 TPoint* point = *pIt;
3915 int pIndex = pointIndex[ point ];
3916 if ( nodesVector [ pIndex ] )
3918 SMDS_MeshNode* node = aMeshDS->AddNode (point->myXYZ.X(),
3921 nodesVector [ pIndex ] = node;
3923 if ( true /*subMeshDS*/ ) {
3924 // !!!!! do not merge new nodes with ones existing on submeshes (see method comment)
3925 switch ( S.ShapeType() ) {
3926 case TopAbs_VERTEX: {
3927 aMeshDS->SetNodeOnVertex( node, TopoDS::Vertex( S )); break;
3930 aMeshDS->SetNodeOnEdge( node, TopoDS::Edge( S ), point->myU ); break;
3933 aMeshDS->SetNodeOnFace( node, TopoDS::Face( S ),
3934 point->myUV.X(), point->myUV.Y() ); break;
3937 aMeshDS->SetNodeInVolume( node, TopoDS::Shell( S ));
3946 if ( onMeshElements )
3948 // prepare data to create poly elements
3949 makePolyElements( nodesVector, toCreatePolygons, toCreatePolyedrs );
3952 createElements( theMesh, nodesVector, myElemXYZIDs, myElements );
3953 // sew old and new elements
3954 createElements( theMesh, nodesVector, myPolyElemXYZIDs, myPolyElems );
3958 createElements( theMesh, nodesVector, myElemPointIDs, myElements );
3961 // const map<int,SMESHDS_SubMesh*>& sm = aMeshDS->SubMeshes();
3962 // map<int,SMESHDS_SubMesh*>::const_iterator i_sm = sm.begin();
3963 // for ( ; i_sm != sm.end(); i_sm++ )
3965 // cout << " SM " << i_sm->first << " ";
3966 // TopAbs::Print( aMeshDS->IndexToShape( i_sm->first ).ShapeType(), cout)<< " ";
3967 // //SMDS_ElemIteratorPtr GetElements();
3968 // SMDS_NodeIteratorPtr nit = i_sm->second->GetNodes();
3969 // while ( nit->more() )
3970 // cout << nit->next()->GetID() << " ";
3973 return setErrorCode( ERR_OK );
3976 //=======================================================================
3977 //function : createElements
3978 //purpose : add elements to the mesh
3979 //=======================================================================
3981 void SMESH_Pattern::createElements(SMESH_Mesh* theMesh,
3982 const vector<const SMDS_MeshNode* >& theNodesVector,
3983 const list< TElemDef > & theElemNodeIDs,
3984 const vector<const SMDS_MeshElement*>& theElements)
3986 SMESHDS_Mesh* aMeshDS = theMesh->GetMeshDS();
3987 SMESH_MeshEditor editor( theMesh );
3989 bool onMeshElements = !theElements.empty();
3991 // shapes and groups theElements are on
3992 vector< int > shapeIDs;
3993 vector< list< SMESHDS_Group* > > groups;
3994 set< const SMDS_MeshNode* > shellNodes;
3995 if ( onMeshElements )
3997 shapeIDs.resize( theElements.size() );
3998 groups.resize( theElements.size() );
3999 const set<SMESHDS_GroupBase*>& allGroups = aMeshDS->GetGroups();
4000 set<SMESHDS_GroupBase*>::const_iterator grIt;
4001 for ( int i = 0; i < theElements.size(); i++ )
4003 shapeIDs[ i ] = editor.FindShape( theElements[ i ] );
4004 for ( grIt = allGroups.begin(); grIt != allGroups.end(); grIt++ ) {
4005 SMESHDS_Group* group = dynamic_cast<SMESHDS_Group*>( *grIt );
4006 if ( group && group->SMDSGroup().Contains( theElements[ i ] ))
4007 groups[ i ].push_back( group );
4010 // get all nodes bound to shells because their SpacePosition is not set
4011 // by SMESHDS_Mesh::SetNodeInVolume()
4012 TopoDS_Shape aMainShape = aMeshDS->ShapeToMesh();
4013 if ( !aMainShape.IsNull() ) {
4014 TopExp_Explorer shellExp( aMainShape, TopAbs_SHELL );
4015 for ( ; shellExp.More(); shellExp.Next() )
4017 SMESHDS_SubMesh * sm = aMeshDS->MeshElements( shellExp.Current() );
4019 SMDS_NodeIteratorPtr nIt = sm->GetNodes();
4020 while ( nIt->more() )
4021 shellNodes.insert( nIt->next() );
4026 // nb new elements per a refined element
4027 int nbNewElemsPerOld = 1;
4028 if ( onMeshElements )
4029 nbNewElemsPerOld = theElemNodeIDs.size() / theElements.size();
4033 list< TElemDef >::const_iterator enIt = theElemNodeIDs.begin();
4034 list< vector<int> >::iterator quantity = myPolyhedronQuantities.begin();
4035 for ( int iElem = 0; enIt != theElemNodeIDs.end(); enIt++, iElem++ )
4037 const TElemDef & elemNodeInd = *enIt;
4039 vector< const SMDS_MeshNode* > nodes( elemNodeInd.size() );
4040 TElemDef::const_iterator id = elemNodeInd.begin();
4042 for ( nbNodes = 0; id != elemNodeInd.end(); id++ ) {
4043 if ( *id < theNodesVector.size() )
4044 nodes[ nbNodes++ ] = theNodesVector[ *id ];
4046 nodes[ nbNodes++ ] = myXYZIdToNodeMap[ *id ];
4048 // dim of refined elem
4049 int elemIndex = iElem / nbNewElemsPerOld; // refined element index
4050 if ( onMeshElements ) {
4051 is2d = ( theElements[ elemIndex ]->GetType() == SMDSAbs_Face );
4054 const SMDS_MeshElement* elem = 0;
4056 switch ( nbNodes ) {
4058 elem = aMeshDS->AddFace( nodes[0], nodes[1], nodes[2] ); break;
4060 elem = aMeshDS->AddFace( nodes[0], nodes[1], nodes[2], nodes[3] ); break;
4062 if ( !onMeshElements ) {// create a quadratic face
4063 elem = aMeshDS->AddFace (nodes[0], nodes[1], nodes[2], nodes[3],
4064 nodes[4], nodes[5] ); break;
4065 } // else do not break but create a polygon
4067 if ( !onMeshElements ) {// create a quadratic face
4068 elem = aMeshDS->AddFace (nodes[0], nodes[1], nodes[2], nodes[3],
4069 nodes[4], nodes[5], nodes[6], nodes[7] ); break;
4070 } // else do not break but create a polygon
4072 elem = aMeshDS->AddPolygonalFace( nodes );
4076 switch ( nbNodes ) {
4078 elem = aMeshDS->AddVolume (nodes[0], nodes[1], nodes[2], nodes[3] ); break;
4080 elem = aMeshDS->AddVolume (nodes[0], nodes[1], nodes[2], nodes[3],
4083 elem = aMeshDS->AddVolume (nodes[0], nodes[1], nodes[2], nodes[3],
4084 nodes[4], nodes[5] ); break;
4086 elem = aMeshDS->AddVolume (nodes[0], nodes[1], nodes[2], nodes[3],
4087 nodes[4], nodes[5], nodes[6], nodes[7] ); break;
4089 elem = aMeshDS->AddPolyhedralVolume( nodes, *quantity++ );
4092 // set element on a shape
4093 if ( elem && onMeshElements ) // applied to mesh elements
4095 int shapeID = shapeIDs[ elemIndex ];
4096 if ( shapeID > 0 ) {
4097 aMeshDS->SetMeshElementOnShape( elem, shapeID );
4098 // set nodes on a shape
4099 TopoDS_Shape S = aMeshDS->IndexToShape( shapeID );
4100 if ( S.ShapeType() == TopAbs_SOLID ) {
4101 TopoDS_Iterator shellIt( S );
4102 if ( shellIt.More() )
4103 shapeID = aMeshDS->ShapeToIndex( shellIt.Value() );
4105 SMDS_ElemIteratorPtr noIt = elem->nodesIterator();
4106 while ( noIt->more() ) {
4107 SMDS_MeshNode* node = const_cast<SMDS_MeshNode*>(smdsNode( noIt->next() ));
4108 if (!node->GetPosition()->GetShapeId() &&
4109 shellNodes.find( node ) == shellNodes.end() ) {
4110 if ( S.ShapeType() == TopAbs_FACE )
4111 aMeshDS->SetNodeOnFace( node, shapeID );
4113 aMeshDS->SetNodeInVolume( node, shapeID );
4114 shellNodes.insert( node );
4119 // add elem in groups
4120 list< SMESHDS_Group* >::iterator g = groups[ elemIndex ].begin();
4121 for ( ; g != groups[ elemIndex ].end(); ++g )
4122 (*g)->SMDSGroup().Add( elem );
4124 if ( elem && !myShape.IsNull() ) // applied to shape
4125 aMeshDS->SetMeshElementOnShape( elem, myShape );
4128 // make that SMESH_subMesh::_computeState == COMPUTE_OK
4129 // so that operations with hypotheses will erase the mesh being built
4131 SMESH_subMesh * subMesh;
4132 if ( !myShape.IsNull() ) {
4133 subMesh = theMesh->GetSubMesh( myShape );
4135 subMesh->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
4137 if ( onMeshElements ) {
4138 list< int > elemIDs;
4139 for ( int i = 0; i < theElements.size(); i++ )
4141 subMesh = theMesh->GetSubMeshContaining( shapeIDs[ i ] );
4143 subMesh->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
4145 elemIDs.push_back( theElements[ i ]->GetID() );
4147 // remove refined elements
4148 editor.Remove( elemIDs, false );
4152 //=======================================================================
4153 //function : isReversed
4154 //purpose : check xyz ids order in theIdsList taking into account
4155 // theFirstNode on a link
4156 //=======================================================================
4158 bool SMESH_Pattern::isReversed(const SMDS_MeshNode* theFirstNode,
4159 const list< int >& theIdsList) const
4161 if ( theIdsList.size() < 2 )
4164 gp_Pnt Pf ( theFirstNode->X(), theFirstNode->Y(), theFirstNode->Z() );
4166 list<int>::const_iterator id = theIdsList.begin();
4167 for ( int i = 0; i < 2; ++i, ++id ) {
4168 if ( *id < myXYZ.size() )
4169 P[ i ] = myXYZ[ *id ];
4171 map< int, const SMDS_MeshNode*>::const_iterator i_n;
4172 i_n = myXYZIdToNodeMap.find( *id );
4173 ASSERT( i_n != myXYZIdToNodeMap.end() );
4174 const SMDS_MeshNode* n = i_n->second;
4175 P[ i ].SetCoord( n->X(), n->Y(), n->Z() );
4178 return Pf.SquareDistance( P[ 1 ] ) < Pf.SquareDistance( P[ 0 ] );
4182 //=======================================================================
4183 //function : arrangeBoundaries
4184 //purpose : if there are several wires, arrange boundaryPoints so that
4185 // the outer wire goes first and fix inner wires orientation
4186 // update myKeyPointIDs to correspond to the order of key-points
4187 // in boundaries; sort internal boundaries by the nb of key-points
4188 //=======================================================================
4190 void SMESH_Pattern::arrangeBoundaries (list< list< TPoint* > >& boundaryList)
4192 typedef list< list< TPoint* > >::iterator TListOfListIt;
4193 TListOfListIt bndIt;
4194 list< TPoint* >::iterator pIt;
4196 int nbBoundaries = boundaryList.size();
4197 if ( nbBoundaries > 1 )
4199 // sort boundaries by nb of key-points
4200 if ( nbBoundaries > 2 )
4202 // move boundaries in tmp list
4203 list< list< TPoint* > > tmpList;
4204 tmpList.splice( tmpList.begin(), boundaryList, boundaryList.begin(), boundaryList.end());
4205 // make a map nb-key-points to boundary-position-in-tmpList,
4206 // boundary-positions get ordered in it
4207 typedef map< int, TListOfListIt > TNbKpBndPosMap;
4208 TNbKpBndPosMap nbKpBndPosMap;
4209 bndIt = tmpList.begin();
4210 list< int >::iterator nbKpIt = myNbKeyPntInBoundary.begin();
4211 for ( ; nbKpIt != myNbKeyPntInBoundary.end(); nbKpIt++, bndIt++ ) {
4212 int nb = *nbKpIt * nbBoundaries;
4213 while ( nbKpBndPosMap.find ( nb ) != nbKpBndPosMap.end() )
4215 nbKpBndPosMap.insert( TNbKpBndPosMap::value_type( nb, bndIt ));
4217 // move boundaries back to boundaryList
4218 TNbKpBndPosMap::iterator nbKpBndPosIt = nbKpBndPosMap.begin();
4219 for ( ; nbKpBndPosIt != nbKpBndPosMap.end(); nbKpBndPosIt++ ) {
4220 TListOfListIt & bndPos2 = (*nbKpBndPosIt).second;
4221 TListOfListIt bndPos1 = bndPos2++;
4222 boundaryList.splice( boundaryList.end(), tmpList, bndPos1, bndPos2 );
4226 // Look for the outer boundary: the one with the point with the least X
4227 double leastX = DBL_MAX;
4228 TListOfListIt outerBndPos;
4229 for ( bndIt = boundaryList.begin(); bndIt != boundaryList.end(); bndIt++ )
4231 list< TPoint* >& boundary = (*bndIt);
4232 for ( pIt = boundary.begin(); pIt != boundary.end(); pIt++)
4234 TPoint* point = *pIt;
4235 if ( point->myInitXYZ.X() < leastX ) {
4236 leastX = point->myInitXYZ.X();
4237 outerBndPos = bndIt;
4242 if ( outerBndPos != boundaryList.begin() )
4243 boundaryList.splice( boundaryList.begin(), boundaryList, outerBndPos, ++outerBndPos );
4245 } // if nbBoundaries > 1
4247 // Check boundaries orientation and re-fill myKeyPointIDs
4249 set< TPoint* > keyPointSet;
4250 list< int >::iterator kpIt = myKeyPointIDs.begin();
4251 for ( ; kpIt != myKeyPointIDs.end(); kpIt++ )
4252 keyPointSet.insert( & myPoints[ *kpIt ]);
4253 myKeyPointIDs.clear();
4255 // update myNbKeyPntInBoundary also
4256 list< int >::iterator nbKpIt = myNbKeyPntInBoundary.begin();
4258 for ( bndIt = boundaryList.begin(); bndIt != boundaryList.end(); bndIt++, nbKpIt++ )
4260 // find the point with the least X
4261 double leastX = DBL_MAX;
4262 list< TPoint* >::iterator xpIt;
4263 list< TPoint* >& boundary = (*bndIt);
4264 for ( pIt = boundary.begin(); pIt != boundary.end(); pIt++)
4266 TPoint* point = *pIt;
4267 if ( point->myInitXYZ.X() < leastX ) {
4268 leastX = point->myInitXYZ.X();
4272 // find points next to the point with the least X
4273 TPoint* p = *xpIt, *pPrev, *pNext;
4274 if ( p == boundary.front() )
4275 pPrev = *(++boundary.rbegin());
4281 if ( p == boundary.back() )
4282 pNext = *(++boundary.begin());
4287 // vectors of boundary direction near <p>
4288 gp_Vec2d v1( pPrev->myInitUV, p->myInitUV ), v2( p->myInitUV, pNext->myInitUV );
4289 double sqMag1 = v1.SquareMagnitude(), sqMag2 = v2.SquareMagnitude();
4290 if ( sqMag1 > DBL_MIN && sqMag2 > DBL_MIN ) {
4291 double yPrev = v1.Y() / sqrt( sqMag1 );
4292 double yNext = v2.Y() / sqrt( sqMag2 );
4293 double sumY = yPrev + yNext;
4295 if ( bndIt == boundaryList.begin() ) // outer boundary
4303 // Put key-point IDs of a well-oriented boundary in myKeyPointIDs
4304 (*nbKpIt) = 0; // count nb of key-points again
4305 pIt = boundary.begin();
4306 for ( ; pIt != boundary.end(); pIt++)
4308 TPoint* point = *pIt;
4309 if ( keyPointSet.find( point ) == keyPointSet.end() )
4311 // find an index of a keypoint
4313 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
4314 for ( ; pVecIt != myPoints.end(); pVecIt++, index++ )
4315 if ( &(*pVecIt) == point )
4317 myKeyPointIDs.push_back( index );
4320 myKeyPointIDs.pop_back(); // remove the first key-point from the back
4323 } // loop on a list of boundaries
4325 ASSERT( myKeyPointIDs.size() == keyPointSet.size() );
4328 //=======================================================================
4329 //function : findBoundaryPoints
4330 //purpose : if loaded from file, find points to map on edges and faces and
4331 // compute their parameters
4332 //=======================================================================
4334 bool SMESH_Pattern::findBoundaryPoints()
4336 if ( myIsBoundaryPointsFound ) return true;
4338 MESSAGE(" findBoundaryPoints() ");
4340 myNbKeyPntInBoundary.clear();
4344 set< TPoint* > pointsInElems;
4346 // Find free links of elements:
4347 // put links of all elements in a set and remove links encountered twice
4349 typedef pair< TPoint*, TPoint*> TLink;
4350 set< TLink > linkSet;
4351 list<TElemDef >::iterator epIt = myElemPointIDs.begin();
4352 for ( ; epIt != myElemPointIDs.end(); epIt++ )
4354 TElemDef & elemPoints = *epIt;
4355 TElemDef::iterator pIt = elemPoints.begin();
4356 int prevP = elemPoints.back();
4357 for ( ; pIt != elemPoints.end(); pIt++ ) {
4358 TPoint* p1 = & myPoints[ prevP ];
4359 TPoint* p2 = & myPoints[ *pIt ];
4360 TLink link(( p1 < p2 ? p1 : p2 ), ( p1 < p2 ? p2 : p1 ));
4361 ASSERT( link.first != link.second );
4362 pair<set< TLink >::iterator,bool> itUniq = linkSet.insert( link );
4363 if ( !itUniq.second )
4364 linkSet.erase( itUniq.first );
4367 pointsInElems.insert( p1 );
4370 // Now linkSet contains only free links,
4371 // find the points order that they have in boundaries
4373 // 1. make a map of key-points
4374 set< TPoint* > keyPointSet;
4375 list< int >::iterator kpIt = myKeyPointIDs.begin();
4376 for ( ; kpIt != myKeyPointIDs.end(); kpIt++ )
4377 keyPointSet.insert( & myPoints[ *kpIt ]);
4379 // 2. chain up boundary points
4380 list< list< TPoint* > > boundaryList;
4381 boundaryList.push_back( list< TPoint* >() );
4382 list< TPoint* > * boundary = & boundaryList.back();
4384 TPoint *point1, *point2, *keypoint1;
4385 kpIt = myKeyPointIDs.begin();
4386 point1 = keypoint1 = & myPoints[ *kpIt++ ];
4387 // loop on free links: look for the next point
4389 set< TLink >::iterator lIt = linkSet.begin();
4390 while ( lIt != linkSet.end() )
4392 if ( (*lIt).first == point1 )
4393 point2 = (*lIt).second;
4394 else if ( (*lIt).second == point1 )
4395 point2 = (*lIt).first;
4400 linkSet.erase( lIt );
4401 lIt = linkSet.begin();
4403 if ( keyPointSet.find( point2 ) == keyPointSet.end() ) // not a key-point
4405 boundary->push_back( point2 );
4407 else // a key-point found
4409 keyPointSet.erase( point2 ); // keyPointSet contains not found key-points only
4411 if ( point2 != keypoint1 ) // its not the boundary end
4413 boundary->push_back( point2 );
4415 else // the boundary end reached
4417 boundary->push_front( keypoint1 );
4418 boundary->push_back( keypoint1 );
4419 myNbKeyPntInBoundary.push_back( iKeyPoint );
4420 if ( keyPointSet.empty() )
4421 break; // all boundaries containing key-points are found
4423 // prepare to search for the next boundary
4424 boundaryList.push_back( list< TPoint* >() );
4425 boundary = & boundaryList.back();
4426 point2 = keypoint1 = (*keyPointSet.begin());
4430 } // loop on the free links set
4432 if ( boundary->empty() ) {
4433 MESSAGE(" a separate key-point");
4434 return setErrorCode( ERR_READ_BAD_KEY_POINT );
4437 // if there are several wires, arrange boundaryPoints so that
4438 // the outer wire goes first and fix inner wires orientation;
4439 // sort myKeyPointIDs to correspond to the order of key-points
4441 arrangeBoundaries( boundaryList );
4443 // Find correspondence shape ID - points,
4444 // compute points parameter on edge
4446 keyPointSet.clear();
4447 for ( kpIt = myKeyPointIDs.begin(); kpIt != myKeyPointIDs.end(); kpIt++ )
4448 keyPointSet.insert( & myPoints[ *kpIt ]);
4450 set< TPoint* > edgePointSet; // to find in-face points
4451 int vertexID = 1; // the first index in TopTools_IndexedMapOfShape
4452 int edgeID = myKeyPointIDs.size() + 1;
4454 list< list< TPoint* > >::iterator bndIt = boundaryList.begin();
4455 for ( ; bndIt != boundaryList.end(); bndIt++ )
4457 boundary = & (*bndIt);
4458 double edgeLength = 0;
4459 list< TPoint* >::iterator pIt = boundary->begin();
4460 getShapePoints( edgeID ).push_back( *pIt );
4461 getShapePoints( vertexID++ ).push_back( *pIt );
4462 for ( pIt++; pIt != boundary->end(); pIt++)
4464 list< TPoint* > & edgePoints = getShapePoints( edgeID );
4465 TPoint* prevP = edgePoints.empty() ? 0 : edgePoints.back();
4466 TPoint* point = *pIt;
4467 edgePointSet.insert( point );
4468 if ( keyPointSet.find( point ) == keyPointSet.end() ) // inside-edge point
4470 edgePoints.push_back( point );
4471 edgeLength += ( point->myInitUV - prevP->myInitUV ).Modulus();
4472 point->myInitU = edgeLength;
4476 // treat points on the edge which ends up: compute U [0,1]
4477 edgePoints.push_back( point );
4478 if ( edgePoints.size() > 2 ) {
4479 edgeLength += ( point->myInitUV - prevP->myInitUV ).Modulus();
4480 list< TPoint* >::iterator epIt = edgePoints.begin();
4481 for ( ; epIt != edgePoints.end(); epIt++ )
4482 (*epIt)->myInitU /= edgeLength;
4484 // begin the next edge treatment
4487 if ( point != boundary->front() ) { // not the first key-point again
4488 getShapePoints( edgeID ).push_back( point );
4489 getShapePoints( vertexID++ ).push_back( point );
4495 // find in-face points
4496 list< TPoint* > & facePoints = getShapePoints( edgeID );
4497 vector< TPoint >::iterator pVecIt = myPoints.begin();
4498 for ( ; pVecIt != myPoints.end(); pVecIt++ ) {
4499 TPoint* point = &(*pVecIt);
4500 if ( edgePointSet.find( point ) == edgePointSet.end() &&
4501 pointsInElems.find( point ) != pointsInElems.end())
4502 facePoints.push_back( point );
4509 // bind points to shapes according to point parameters
4510 vector< TPoint >::iterator pVecIt = myPoints.begin();
4511 for ( int i = 0; pVecIt != myPoints.end(); pVecIt++, i++ ) {
4512 TPoint* point = &(*pVecIt);
4513 int shapeID = SMESH_Block::GetShapeIDByParams( point->myInitXYZ );
4514 getShapePoints( shapeID ).push_back( point );
4515 // detect key-points
4516 if ( SMESH_Block::IsVertexID( shapeID ))
4517 myKeyPointIDs.push_back( i );
4521 myIsBoundaryPointsFound = true;
4522 return myIsBoundaryPointsFound;
4525 //=======================================================================
4527 //purpose : clear fields
4528 //=======================================================================
4530 void SMESH_Pattern::Clear()
4532 myIsComputed = myIsBoundaryPointsFound = false;
4535 myKeyPointIDs.clear();
4536 myElemPointIDs.clear();
4537 myShapeIDToPointsMap.clear();
4538 myShapeIDMap.Clear();
4540 myNbKeyPntInBoundary.clear();
4543 //=======================================================================
4544 //function : setShapeToMesh
4545 //purpose : set a shape to be meshed. Return True if meshing is possible
4546 //=======================================================================
4548 bool SMESH_Pattern::setShapeToMesh(const TopoDS_Shape& theShape)
4550 if ( !IsLoaded() ) {
4551 MESSAGE( "Pattern not loaded" );
4552 return setErrorCode( ERR_APPL_NOT_LOADED );
4555 TopAbs_ShapeEnum aType = theShape.ShapeType();
4556 bool dimOk = ( myIs2D ? aType == TopAbs_FACE : aType == TopAbs_SHELL );
4558 MESSAGE( "Pattern dimention mismatch" );
4559 return setErrorCode( ERR_APPL_BAD_DIMENTION );
4562 // check if a face is closed
4563 int nbNodeOnSeamEdge = 0;
4565 TopTools_MapOfShape seamVertices;
4566 TopoDS_Face face = TopoDS::Face( theShape );
4567 TopExp_Explorer eExp( theShape, TopAbs_EDGE );
4568 for ( ; eExp.More() && nbNodeOnSeamEdge == 0; eExp.Next() ) {
4569 const TopoDS_Edge& ee = TopoDS::Edge(eExp.Current());
4570 if ( BRep_Tool::IsClosed(ee, face) ) {
4571 // seam edge and vertices encounter twice in theFace
4572 if ( !seamVertices.Add( TopExp::FirstVertex( ee ))) nbNodeOnSeamEdge++;
4573 if ( !seamVertices.Add( TopExp::LastVertex( ee ))) nbNodeOnSeamEdge++;
4578 // check nb of vertices
4579 TopTools_IndexedMapOfShape vMap;
4580 TopExp::MapShapes( theShape, TopAbs_VERTEX, vMap );
4581 if ( vMap.Extent() + nbNodeOnSeamEdge != myKeyPointIDs.size() ) {
4582 MESSAGE( myKeyPointIDs.size() + nbNodeOnSeamEdge << " != " << vMap.Extent() );
4583 return setErrorCode( ERR_APPL_BAD_NB_VERTICES );
4586 myElements.clear(); // not refine elements
4587 myElemXYZIDs.clear();
4589 myShapeIDMap.Clear();
4594 //=======================================================================
4595 //function : GetMappedPoints
4596 //purpose : Return nodes coordinates computed by Apply() method
4597 //=======================================================================
4599 bool SMESH_Pattern::GetMappedPoints ( list< const gp_XYZ * > & thePoints ) const
4602 if ( !myIsComputed )
4605 if ( myElements.empty() ) { // applied to shape
4606 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
4607 for ( ; pVecIt != myPoints.end(); pVecIt++ )
4608 thePoints.push_back( & (*pVecIt).myXYZ.XYZ() );
4610 else { // applied to mesh elements
4611 const gp_XYZ * definedXYZ = & myPoints[ myKeyPointIDs.front() ].myXYZ.XYZ();
4612 vector<gp_XYZ>::const_iterator xyz = myXYZ.begin();
4613 for ( ; xyz != myXYZ.end(); ++xyz )
4614 if ( !isDefined( *xyz ))
4615 thePoints.push_back( definedXYZ );
4617 thePoints.push_back( & (*xyz) );
4619 return !thePoints.empty();
4623 //=======================================================================
4624 //function : GetPoints
4625 //purpose : Return nodes coordinates of the pattern
4626 //=======================================================================
4628 bool SMESH_Pattern::GetPoints ( list< const gp_XYZ * > & thePoints ) const
4635 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
4636 for ( ; pVecIt != myPoints.end(); pVecIt++ )
4637 thePoints.push_back( & (*pVecIt).myInitXYZ );
4639 return ( thePoints.size() > 0 );
4642 //=======================================================================
4643 //function : getShapePoints
4644 //purpose : return list of points located on theShape
4645 //=======================================================================
4647 list< SMESH_Pattern::TPoint* > &
4648 SMESH_Pattern::getShapePoints(const TopoDS_Shape& theShape)
4651 if ( !myShapeIDMap.Contains( theShape ))
4652 aShapeID = myShapeIDMap.Add( theShape );
4654 aShapeID = myShapeIDMap.FindIndex( theShape );
4656 return myShapeIDToPointsMap[ aShapeID ];
4659 //=======================================================================
4660 //function : getShapePoints
4661 //purpose : return list of points located on the shape
4662 //=======================================================================
4664 list< SMESH_Pattern::TPoint* > & SMESH_Pattern::getShapePoints(const int theShapeID)
4666 return myShapeIDToPointsMap[ theShapeID ];
4669 //=======================================================================
4670 //function : DumpPoints
4672 //=======================================================================
4674 void SMESH_Pattern::DumpPoints() const
4677 vector< TPoint >::const_iterator pVecIt = myPoints.begin();
4678 for ( int i = 0; pVecIt != myPoints.end(); pVecIt++, i++ )
4679 MESSAGE_ADD ( std::endl << i << ": " << *pVecIt );
4683 //=======================================================================
4684 //function : TPoint()
4686 //=======================================================================
4688 SMESH_Pattern::TPoint::TPoint()
4691 myInitXYZ.SetCoord(0,0,0);
4692 myInitUV.SetCoord(0.,0.);
4694 myXYZ.SetCoord(0,0,0);
4695 myUV.SetCoord(0.,0.);
4700 //=======================================================================
4701 //function : operator <<
4703 //=======================================================================
4705 ostream & operator <<(ostream & OS, const SMESH_Pattern::TPoint& p)
4707 gp_XYZ xyz = p.myInitXYZ;
4708 OS << "\tinit( xyz( " << xyz.X() << " " << xyz.Y() << " " << xyz.Z() << " )";
4709 gp_XY xy = p.myInitUV;
4710 OS << " uv( " << xy.X() << " " << xy.Y() << " )";
4711 double u = p.myInitU;
4712 OS << " u( " << u << " )) " << &p << endl;
4713 xyz = p.myXYZ.XYZ();
4714 OS << "\t ( xyz( " << xyz.X() << " " << xyz.Y() << " " << xyz.Z() << " )";
4716 OS << " uv( " << xy.X() << " " << xy.Y() << " )";
4718 OS << " u( " << u << " ))" << endl;