1 // Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // SMESH SMESH : implementaion of SMESH idl descriptions
23 // File : StdMeshers_Regular_1D.cxx
24 // Moved here from SMESH_Regular_1D.cxx
25 // Author : Paul RASCLE, EDF
29 #include "StdMeshers_CompositeSegment_1D.hxx"
30 #include "StdMeshers_FaceSide.hxx"
31 #include "StdMeshers_AutomaticLength.hxx"
33 #include "SMESH_Gen.hxx"
34 #include "SMESH_Mesh.hxx"
35 #include "SMESH_HypoFilter.hxx"
36 #include "SMESH_subMesh.hxx"
37 #include "SMESH_subMeshEventListener.hxx"
38 #include "SMESH_Comment.hxx"
40 #include "SMDS_MeshElement.hxx"
41 #include "SMDS_MeshNode.hxx"
43 #include "utilities.h"
45 #include <BRepAdaptor_CompCurve.hxx>
46 #include <BRep_Builder.hxx>
47 #include <GCPnts_AbscissaPoint.hxx>
49 #include <TopExp_Explorer.hxx>
50 #include <TopTools_ListIteratorOfListOfShape.hxx>
51 #include <TopTools_MapOfShape.hxx>
53 #include <TopoDS_Edge.hxx>
54 #include <TopoDS_Vertex.hxx>
55 #include <TopoDS_Wire.hxx>
58 #include <Standard_ErrorHandler.hxx>
59 #include <Standard_Failure.hxx>
61 typedef SMESH_Comment TComm;
68 //================================================================================
70 * \brief Search for an edge conjunct to the given one by the vertex
71 * Return NULL if more than 2 edges share the vertex or edges
72 * continuity is less than C1
74 //================================================================================
76 TopoDS_Edge nextC1Edge(const TopoDS_Edge& edge,
81 TopTools_MapOfShape edgeCounter;
82 edgeCounter.Add( edge );
84 v = forward ? TopExp::LastVertex( edge,1 ) : TopExp::FirstVertex( edge,1 );
85 TopTools_ListIteratorOfListOfShape ancestIt = aMesh.GetAncestors( v );
86 for ( ; ancestIt.More(); ancestIt.Next() )
88 const TopoDS_Shape & ancestor = ancestIt.Value();
89 if ( ancestor.ShapeType() == TopAbs_EDGE && edgeCounter.Add( ancestor ))
90 eNext = TopoDS::Edge( ancestor );
92 if ( edgeCounter.Extent() < 3 && !eNext.IsNull() ) {
93 if ( SMESH_Algo::IsContinuous( edge, eNext )) {
94 // care of orientation
97 reverse = ( !v.IsSame( TopExp::FirstVertex( eNext, true )));
99 reverse = ( !v.IsSame( TopExp::LastVertex( eNext, true )));
105 return TopoDS_Edge();
108 //================================================================================
110 * \brief Update submeshes state for all edges and internal vertices,
111 * make them look computed even if none edge or node is set on them
113 //================================================================================
115 void careOfSubMeshes( StdMeshers_FaceSide& side, EventListener* eListener)
117 if ( side.NbEdges() < 2)
119 for ( int iE = 0; iE < side.NbEdges(); ++iE )
121 // set listener and its data
122 EventListenerData * listenerData = new EventListenerData(true);
123 const TopoDS_Edge& edge = side.Edge( iE );
124 SMESH_subMesh * sm = side.GetMesh()->GetSubMesh( edge );
125 sm->SetEventListener( eListener, listenerData, sm );
126 // add edge submesh to the data
127 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
128 if ( sm->GetComputeState() != SMESH_subMesh::COMPUTE_OK ) {
129 sm->SetIsAlwaysComputed( true );
130 listenerData->mySubMeshes.push_back( sm );
132 // add internal vertex submesh to the data
135 TopoDS_Vertex V = side.FirstVertex( iE );
136 sm = side.GetMesh()->GetSubMesh( V );
137 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
138 if ( sm->GetComputeState() != SMESH_subMesh::COMPUTE_OK )
139 sm->SetIsAlwaysComputed( true );
140 listenerData->mySubMeshes.push_back( sm );
145 //================================================================================
147 * \brief Class used to restore nodes on internal vertices of a complex side
148 * when StdMeshers_CompositeSegment_1D algorithm is removed
150 //================================================================================
152 struct VertexNodesRestoringListener : public SMESH_subMeshEventListener
154 VertexNodesRestoringListener():SMESH_subMeshEventListener(0) // won't be deleted by submesh
157 * \brief Restore nodes on internal vertices of a complex side
158 * \param event - algo_event or compute_event itself (of SMESH_subMesh)
159 * \param eventType - ALGO_EVENT or COMPUTE_EVENT (of SMESH_subMesh)
160 * \param subMesh - the submesh where the event occures
161 * \param data - listener data stored in the subMesh
162 * \param hyp - hypothesis, if eventType is algo_event
164 void ProcessEvent(const int event,
166 SMESH_subMesh* subMesh,
167 EventListenerData* data,
168 const SMESH_Hypothesis* /*hyp*/)
170 bool hypRemoved = ( eventType == SMESH_subMesh::ALGO_EVENT &&
171 subMesh->GetAlgoState() != SMESH_subMesh::HYP_OK );
172 if ( hypRemoved && data )
174 list<SMESH_subMesh*>::iterator smIt = data->mySubMeshes.begin();
175 for ( ; smIt != data->mySubMeshes.end(); ++smIt )
177 if ( SMESH_subMesh* sm = *smIt ) {
178 sm->SetIsAlwaysComputed( false );
179 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
183 // at study restoration:
184 // check if edge submesh must have _alwaysComputed flag
185 else if ( event == SMESH_subMesh::SUBMESH_RESTORED &&
186 eventType == SMESH_subMesh::COMPUTE_EVENT )
188 if ( !subMesh->GetEventListenerData( this )) { // not yet checked
189 SMESHDS_Mesh * meshDS = subMesh->GetFather()->GetMeshDS();
190 if ( meshDS->NbNodes() > 0 ) {
191 // check if there are nodes on all vertices
192 bool hasNodesOnVerext = true;
193 SMESH_subMeshIteratorPtr smIt = subMesh->getDependsOnIterator(false,false);
194 while ( hasNodesOnVerext && smIt->more() ) {
195 SMESH_subMesh* sm = smIt->next();
196 hasNodesOnVerext = ( sm->GetSubMeshDS() && sm->GetSubMeshDS()->NbNodes() );
198 if ( !hasNodesOnVerext ) {
199 // check if an edge is a part of a complex side
201 TopoDS_Edge edge = TopoDS::Edge( subMesh->GetSubShape() );
202 auto_ptr< StdMeshers_FaceSide > side
203 ( StdMeshers_CompositeSegment_1D::GetFaceSide(*subMesh->GetFather(),
204 edge, face, false ));
205 if ( side->NbEdges() > 1 && side->NbSegments() )
206 careOfSubMeshes( *side, this );
212 }; // struct VertexNodesRestoringListener
215 //=============================================================================
219 //=============================================================================
221 StdMeshers_CompositeSegment_1D::StdMeshers_CompositeSegment_1D(int hypId,
224 :StdMeshers_Regular_1D(hypId, studyId, gen)
226 MESSAGE("StdMeshers_CompositeSegment_1D::StdMeshers_CompositeSegment_1D");
227 _name = "CompositeSegment_1D";
228 _EventListener = new VertexNodesRestoringListener();
231 //=============================================================================
235 //=============================================================================
237 StdMeshers_CompositeSegment_1D::~StdMeshers_CompositeSegment_1D()
239 delete _EventListener;
242 //=============================================================================
244 * \brief Sets event listener to submeshes if necessary
245 * \param subMesh - submesh where algo is set
247 * This method is called when a submesh gets HYP_OK algo_state.
248 * After being set, event listener is notified on each event of a submesh.
250 //=============================================================================
252 void StdMeshers_CompositeSegment_1D::SetEventListener(SMESH_subMesh* subMesh)
254 subMesh->SetEventListener( _EventListener, 0, subMesh);
255 StdMeshers_Regular_1D::SetEventListener( subMesh );
258 //=============================================================================
260 * \brief Return a face side the edge belongs to
262 //=============================================================================
264 StdMeshers_FaceSide *
265 StdMeshers_CompositeSegment_1D::GetFaceSide(SMESH_Mesh& aMesh,
266 const TopoDS_Edge& anEdge,
267 const TopoDS_Face& aFace,
268 const bool ignoreMeshed)
270 list< TopoDS_Edge > edges;
271 edges.push_back( anEdge );
273 list <const SMESHDS_Hypothesis *> hypList;
274 SMESH_Algo* theAlgo = aMesh.GetGen()->GetAlgo( aMesh, anEdge );
275 if ( theAlgo ) hypList = theAlgo->GetUsedHypothesis(aMesh, anEdge, false);
276 for ( int forward = 0; forward < 2; ++forward )
278 TopoDS_Edge eNext = nextC1Edge( anEdge, aMesh, forward );
279 while ( !eNext.IsNull() ) {
280 if ( ignoreMeshed ) {
281 // eNext must not have computed mesh
282 if ( SMESHDS_SubMesh* sm = aMesh.GetMeshDS()->MeshElements(eNext) )
283 if ( sm->NbNodes() || sm->NbElements() )
286 // eNext must have same hypotheses
287 SMESH_Algo* algo = aMesh.GetGen()->GetAlgo( aMesh, eNext );
289 string(theAlgo->GetName()) != algo->GetName() ||
290 hypList != algo->GetUsedHypothesis(aMesh, eNext, false))
293 edges.push_back( eNext );
295 edges.push_front( eNext );
296 eNext = nextC1Edge( eNext, aMesh, forward );
299 return new StdMeshers_FaceSide( aFace, edges, &aMesh, true, false );
302 //=============================================================================
306 //=============================================================================
308 bool StdMeshers_CompositeSegment_1D::Compute(SMESH_Mesh & aMesh,
309 const TopoDS_Shape & aShape)
311 TopoDS_Edge edge = TopoDS::Edge( aShape );
312 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
314 // Get edges to be discretized as a whole
315 TopoDS_Face nullFace;
316 auto_ptr< StdMeshers_FaceSide > side( GetFaceSide(aMesh, edge, nullFace, true ));
317 //side->dump("IN COMPOSITE SEG");
319 if ( side->NbEdges() < 2 )
320 return StdMeshers_Regular_1D::Compute( aMesh, aShape );
322 // update segment lenght computed by StdMeshers_AutomaticLength
323 const list <const SMESHDS_Hypothesis * > & hyps = GetUsedHypothesis(aMesh, aShape);
324 if ( !hyps.empty() ) {
325 StdMeshers_AutomaticLength * autoLenHyp = const_cast<StdMeshers_AutomaticLength *>
326 (dynamic_cast <const StdMeshers_AutomaticLength * >(hyps.front()));
328 _value[ BEG_LENGTH_IND ]= autoLenHyp->GetLength( &aMesh, side->Length() );
331 // Compute node parameters
332 auto_ptr< BRepAdaptor_CompCurve > C3d ( side->GetCurve3d() );
333 double f = C3d->FirstParameter(), l = C3d->LastParameter();
334 list< double > params;
335 if ( !computeInternalParameters ( aMesh, *C3d, side->Length(), f, l, params, false ))
338 // Redistribute parameters near ends
339 TopoDS_Vertex VFirst = side->FirstVertex();
340 TopoDS_Vertex VLast = side->LastVertex();
341 redistributeNearVertices( aMesh, *C3d, side->Length(), params, VFirst, VLast );
343 params.push_front(f);
345 int nbNodes = params.size();
349 const SMDS_MeshNode * nFirst = SMESH_Algo::VertexNode( VFirst, meshDS );
350 const SMDS_MeshNode * nLast = SMESH_Algo::VertexNode( VLast, meshDS );
352 return error(COMPERR_BAD_INPUT_MESH, TComm("No node on vertex ")
353 <<meshDS->ShapeToIndex(VFirst));
355 return error(COMPERR_BAD_INPUT_MESH, TComm("No node on vertex ")
356 <<meshDS->ShapeToIndex(VLast));
358 vector<const SMDS_MeshNode*> nodes( nbNodes, (const SMDS_MeshNode*)0 );
359 nodes.front() = nFirst;
360 nodes.back() = nLast;
362 // create internal nodes
363 list< double >::iterator parIt = params.begin();
364 double prevPar = *parIt;
366 for ( int iN = 0; parIt != params.end(); ++iN, ++parIt)
368 if ( !nodes[ iN ] ) {
369 gp_Pnt p = C3d->Value( *parIt );
370 SMDS_MeshNode* n = meshDS->AddNode( p.X(), p.Y(), p.Z());
371 C3d->Edge( *parIt, edge, u );
372 meshDS->SetNodeOnEdge( n, edge, u );
373 // cout << "new NODE: par="<<*parIt<<" ePar="<<u<<" e="<<edge.TShape().operator->()
374 // << " " << n << endl;
379 double mPar = ( prevPar + *parIt )/2;
380 if ( _quadraticMesh ) {
381 // create medium node
382 double segLen = GCPnts_AbscissaPoint::Length(*C3d, prevPar, *parIt);
383 GCPnts_AbscissaPoint ruler( *C3d, segLen/2., prevPar );
384 if ( ruler.IsDone() )
385 mPar = ruler.Parameter();
386 gp_Pnt p = C3d->Value( mPar );
387 SMDS_MeshNode* n = meshDS->AddNode( p.X(), p.Y(), p.Z());
388 //cout << "new NODE "<< n << endl;
389 meshDS->SetNodeOnEdge( n, edge, u );
390 SMDS_MeshEdge * seg = meshDS->AddEdge(nodes[ iN-1 ], nodes[ iN ], n);
391 meshDS->SetMeshElementOnShape(seg, edge);
394 C3d->Edge( mPar, edge, u );
395 SMDS_MeshEdge * seg = meshDS->AddEdge(nodes[ iN-1 ], nodes[ iN ]);
396 meshDS->SetMeshElementOnShape(seg, edge);
402 // remove nodes on internal vertices
403 for ( int iE = 1; iE < side->NbEdges(); ++iE )
405 TopoDS_Vertex V = side->FirstVertex( iE );
406 while ( const SMDS_MeshNode * n = SMESH_Algo::VertexNode( V, meshDS ))
407 meshDS->RemoveNode( n );
410 // Update submeshes state for all edges and internal vertices,
411 // make them look computed even if none edge or node is set on them
412 careOfSubMeshes( *side, _EventListener );