ForkMaster/smesh
1
0
Fork 0
mirror of https://git.salome-platform.org/gitpub/modules/smesh.git synced 2024-11-12 00:29:17 +05:00
Code Issues Packages Projects Releases Wiki Activity

0020184: EDF SMESH 952: Projection 2D does not work

Browse Source 
project only if there are nodes on face
This commit is contained in:
eap 2009-03-03 08:53:53 +00:00
parent cba66c5885
commit b17276ded0
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/StdMeshers/StdMeshers_Projection_2D.cxx
View File

@ -415,18 +415,20 @@ bool StdMeshers_Projection_2D::Compute(SMESH_Mesh& theMesh, const TopoDS_Shape&
// Check if node projection to a face is needed // Check if node projection to a face is needed
Bnd_B2d uvBox; Bnd_B2d uvBox;
SMDS_ElemIteratorPtr faceIt = srcSubMesh->GetSubMeshDS()->GetElements(); SMDS_ElemIteratorPtr faceIt = srcSubMesh->GetSubMeshDS()->GetElements();
for ( int nbN = 0; nbN < 3 && faceIt->more(); ) { int nbFaceNodes = 0;
for ( ; nbFaceNodes < 3 && faceIt->more(); ) {
const SMDS_MeshElement* face = faceIt->next(); const SMDS_MeshElement* face = faceIt->next();
SMDS_ElemIteratorPtr nodeIt = face->nodesIterator(); SMDS_ElemIteratorPtr nodeIt = face->nodesIterator();
while ( nodeIt->more() ) { while ( nodeIt->more() ) {
const SMDS_MeshNode* node = static_cast<const SMDS_MeshNode*>( nodeIt->next() ); const SMDS_MeshNode* node = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
if ( node->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) { if ( node->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
nbN++; nbFaceNodes++;
uvBox.Add( helper.GetNodeUV( srcFace, node )); uvBox.Add( helper.GetNodeUV( srcFace, node ));
} }
} }
} }
const bool toProjectNodes = ( uvBox.IsVoid() || uvBox.SquareExtent() < DBL_MIN ); const bool toProjectNodes =
( nbFaceNodes > 0 && ( uvBox.IsVoid() || uvBox.SquareExtent() < DBL_MIN ));
// Load pattern from the source face // Load pattern from the source face
SMESH_Pattern mapper; SMESH_Pattern mapper;