1 // Copyright (C) 2007-2013 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (CEA/DEN)
21 #include "InterpKernelGeo2DComposedEdge.hxx"
22 #include "InterpKernelGeo2DElementaryEdge.hxx"
23 #include "InterpKernelGeo2DEdgeArcCircle.hxx"
24 #include "InterpKernelGeo2DEdgeInfLin.hxx"
25 #include "InterpKernelException.hxx"
32 using namespace INTERP_KERNEL;
34 ComposedEdge::ComposedEdge(const ComposedEdge& other)
36 for(std::list<ElementaryEdge *>::const_iterator iter=other._sub_edges.begin();iter!=other._sub_edges.end();iter++)
37 _sub_edges.push_back((*iter)->clone());
40 ComposedEdge::~ComposedEdge()
42 clearAll(_sub_edges.begin());
45 void ComposedEdge::setValueAt(int i, Edge *e, bool direction)
47 std::list<ElementaryEdge*>::iterator it=_sub_edges.begin();
51 *it=new ElementaryEdge(e,direction);
56 AbsEdgeCmp(ElementaryEdge *b):_b1(b) { }
57 bool operator()(ElementaryEdge *a) { return a->getPtr()==_b1->getPtr();}
62 double ComposedEdge::getCommonLengthWith(const ComposedEdge& other) const
65 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
67 if(find_if(other._sub_edges.begin(),other._sub_edges.end(),AbsEdgeCmp(*iter))!=other._sub_edges.end())
69 const ElementaryEdge *tmp=static_cast<const ElementaryEdge *>(*iter);
70 ret+=tmp->getCurveLength();
76 void ComposedEdge::clear()
78 clearAll(_sub_edges.begin());
82 void ComposedEdge::pushBack(Edge *edge, bool direction)
84 _sub_edges.push_back(new ElementaryEdge(edge,direction));
87 void ComposedEdge::pushBack(ElementaryEdge *elem)
89 _sub_edges.push_back(elem);
92 void ComposedEdge::pushBack(ComposedEdge *elem)
94 std::list<ElementaryEdge *> *elemsOfElem=elem->getListBehind();
95 _sub_edges.insert(_sub_edges.end(),elemsOfElem->begin(),elemsOfElem->end());
98 ElementaryEdge *ComposedEdge::operator[](int i) const
100 std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();
101 for(int ii=0;ii<i;ii++)
106 void ComposedEdge::reverse()
108 _sub_edges.reverse();
109 for(std::list<ElementaryEdge *>::iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
113 bool ComposedEdge::presenceOfOn() const
116 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end() && !ret;iter++)
117 ret=((*iter)->getLoc()==FULL_ON_1);
121 bool ComposedEdge::presenceOfQuadraticEdge() const
124 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end() && !ret;iter++)
126 Edge *e=(*iter)->getPtr();
128 ret=dynamic_cast<EdgeArcCircle*>(e)!=0;
133 void ComposedEdge::initLocations() const
135 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
136 (*iter)->initLocations();
139 void ComposedEdge::initLocationsWithOther(const ComposedEdge& other) const
141 std::set<Edge *> s1,s2;
142 for(std::list<ElementaryEdge *>::const_iterator it1=_sub_edges.begin();it1!=_sub_edges.end();it1++)
143 s1.insert((*it1)->getPtr());
144 for(std::list<ElementaryEdge *>::const_iterator it2=other._sub_edges.begin();it2!=other._sub_edges.end();it2++)
145 s2.insert((*it2)->getPtr());
147 other.initLocations();
148 std::vector<Edge *> s3;
149 std::set_intersection(s1.begin(),s1.end(),s2.begin(),s2.end(),std::back_insert_iterator< std::vector<Edge *> >(s3));
150 for(std::vector<Edge *>::const_iterator it3=s3.begin();it3!=s3.end();it3++)
154 ComposedEdge *ComposedEdge::clone() const
156 return new ComposedEdge(*this);
159 bool ComposedEdge::isNodeIn(Node *n) const
162 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end() && !ret;iter++)
163 ret=(*iter)->isNodeIn(n);
168 * This method computes the area of 'this'.
171 * Area=\int_{Polygon} dS
173 * Thanks to Green's theorem we have.
175 * \int_{Polygon} x \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}ydx=\sum_{0 \leq i < nb of edges} AreaOfZone_{Edge_{i}}
177 * Where \f$ AreaOfZone_{i} \f$ is computed virtually by INTERP_KERNEL::Edge::getAreaOfZone with following formula :
179 * AreaOfZone_{i}=\int_{Edge_{i}} -ydx
182 double ComposedEdge::getArea() const
185 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
186 ret+=(*iter)->getAreaOfZone();
190 double ComposedEdge::getPerimeter() const
193 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
194 ret+=(*iter)->getCurveLength();
198 double ComposedEdge::getHydraulicDiameter() const
200 return 4*fabs(getArea())/getPerimeter();
204 * This method computes barycenter of 'this' by returning xG in bary[0] and yG in bary[1].
207 * Area \cdot x_{G}=\int_{Polygon} x \cdot dS
210 * Area \cdot y_{G}=\int_{Polygon} y \cdot dS
212 * Thanks to Green's theorem we have.
214 * \int_{Polygon} x \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}yxdx
217 * \int_{Polygon} y \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}\frac{y^{2}}{2}dx
219 * Area is computed using the same principle than described in INTERP_KERNEL::ComposedEdge::getArea method.
220 * \f$ -\int_{Edge_{i}}yxdx \f$ and \f$ -\int_{Edge_{i}}\frac{y^{2}}{2}dx \f$ are computed virtually with INTERP_KERNEL::Edge::getBarycenterOfZone.
222 void ComposedEdge::getBarycenter(double *bary) const
227 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
229 (*iter)->getBarycenterOfZone(bary);
230 area+=(*iter)->getAreaOfZone();
237 * Idem ComposedEdge::getBarycenter except that the special case where _sub_edges==1 is dealt here.
239 void ComposedEdge::getBarycenterGeneral(double *bary) const
241 if(_sub_edges.empty())
242 throw INTERP_KERNEL::Exception("ComposedEdge::getBarycenterGeneral called on an empty polygon !");
243 if(_sub_edges.size()>2)
244 return getBarycenter(bary);
246 _sub_edges.back()->getBarycenter(bary,w);
249 double ComposedEdge::normalizeMe(double& xBary, double& yBary)
252 b.prepareForAggregation();
254 double dimChar=b.getCaracteristicDim();
255 b.getBarycenter(xBary,yBary);
256 applyGlobalSimilarity(xBary,yBary,dimChar);
260 double ComposedEdge::normalize(ComposedEdge *other, double& xBary, double& yBary)
263 b.prepareForAggregation();
265 other->fillBounds(b);
266 double dimChar=b.getCaracteristicDim();
267 b.getBarycenter(xBary,yBary);
268 applyGlobalSimilarity(xBary,yBary,dimChar);
269 other->applyGlobalSimilarity(xBary,yBary,dimChar);
274 * This method operates the opposite operation than ComposedEdge::applyGlobalSimilarity.
276 void ComposedEdge::unApplyGlobalSimilarityExt(ComposedEdge& other, double xBary, double yBary, double fact)
278 std::set<Node *> allNodes;
279 getAllNodes(allNodes);
280 other.getAllNodes(allNodes);
281 for(std::set<Node *>::iterator iter=allNodes.begin();iter!=allNodes.end();iter++)
282 (*iter)->unApplySimilarity(xBary,yBary,fact);
283 for(std::list<ElementaryEdge *>::iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
284 (*iter)->unApplySimilarity(xBary,yBary,fact);
285 for(std::list<ElementaryEdge *>::iterator iter=other._sub_edges.begin();iter!=other._sub_edges.end();iter++)
286 (*iter)->unApplySimilarity(xBary,yBary,fact);
289 double ComposedEdge::normalizeExt(ComposedEdge *other, double& xBary, double& yBary)
292 b.prepareForAggregation();
294 other->fillBounds(b);
295 double dimChar=b.getCaracteristicDim();
296 b.getBarycenter(xBary,yBary);
297 applyGlobalSimilarity2(other,xBary,yBary,dimChar);
301 void ComposedEdge::dumpInXfigFile(std::ostream& stream, int resolution, const Bounds& box) const
303 stream.precision(10);
304 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
305 (*iter)->dumpInXfigFile(stream,resolution,box);
308 Node *ComposedEdge::getEndNode() const
310 return _sub_edges.back()->getEndNode();
313 Node *ComposedEdge::getStartNode() const
315 return _sub_edges.front()->getStartNode();
318 bool ComposedEdge::changeEndNodeWith(Node *node) const
320 return _sub_edges.back()->changeEndNodeWith(node);
323 bool ComposedEdge::changeStartNodeWith(Node *node) const
325 return _sub_edges.front()->changeStartNodeWith(node);
328 void ComposedEdge::fillBounds(Bounds& output) const
330 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
331 (*iter)->fillBounds(output);
335 * \b WARNING : applies similarity \b ONLY on edges without any change on Nodes. To perform a global similarity call applyGlobalSimilarity.
337 void ComposedEdge::applySimilarity(double xBary, double yBary, double dimChar)
339 for(std::list<ElementaryEdge *>::iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
340 (*iter)->applySimilarity(xBary,yBary,dimChar);
344 * Perform Similarity transformation on all elements of this Nodes and Edges.
346 void ComposedEdge::applyGlobalSimilarity(double xBary, double yBary, double dimChar)
348 std::set<Node *> allNodes;
349 getAllNodes(allNodes);
350 for(std::set<Node *>::iterator iter=allNodes.begin();iter!=allNodes.end();iter++)
351 (*iter)->applySimilarity(xBary,yBary,dimChar);
352 for(std::list<ElementaryEdge *>::iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
353 (*iter)->applySimilarity(xBary,yBary,dimChar);
357 * Perform Similarity transformation on all elements of this Nodes and Edges on 'this' and 'other'.
358 * Nodes can be shared between 'this' and 'other'.
360 void ComposedEdge::applyGlobalSimilarity2(ComposedEdge *other, double xBary, double yBary, double dimChar)
362 std::set<Node *> allNodes;
363 getAllNodes(allNodes);
364 std::set<Node *> allNodes2;
365 other->getAllNodes(allNodes2);
366 for(std::set<Node *>::const_iterator it=allNodes2.begin();it!=allNodes2.end();it++)
367 if(allNodes.find(*it)!=allNodes.end())
369 allNodes.insert(allNodes2.begin(),allNodes2.end());
370 for(std::set<Node *>::iterator iter=allNodes.begin();iter!=allNodes.end();iter++)
371 (*iter)->applySimilarity(xBary,yBary,dimChar);
372 for(std::list<ElementaryEdge *>::iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
373 (*iter)->applySimilarity(xBary,yBary,dimChar);
374 for(std::list<ElementaryEdge *>::iterator iter=other->_sub_edges.begin();iter!=other->_sub_edges.end();iter++)
375 (*iter)->applySimilarity(xBary,yBary,dimChar);
379 * This method append to param 'partConsidered' the part of length of subedges IN or ON.
380 * @param partConsidered INOUT param.
382 void ComposedEdge::dispatchPerimeter(double& partConsidered) const
384 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
386 TypeOfEdgeLocInPolygon loc=(*iter)->getLoc();
387 if(loc==FULL_IN_1 || loc==FULL_ON_1)
388 partConsidered+=(*iter)->getCurveLength();
393 * Idem dispatchPerimeterExcl except that when a subedge is declared as ON this subedge is counted in commonPart.
395 void ComposedEdge::dispatchPerimeterExcl(double& partConsidered, double& commonPart) const
397 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
399 TypeOfEdgeLocInPolygon loc=(*iter)->getLoc();
401 partConsidered+=(*iter)->getCurveLength();
403 commonPart+=(*iter)->getCurveLength();
407 void ComposedEdge::getAllNodes(std::set<Node *>& output) const
409 std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();
410 for(;iter!=_sub_edges.end();iter++)
411 (*iter)->getAllNodes(output);
414 void ComposedEdge::getBarycenter(double *bary, double& weigh) const
416 weigh=0.; bary[0]=0.; bary[1]=0.;
418 for(std::list<ElementaryEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
420 (*iter)->getBarycenter(tmp2,tmp1);
422 bary[0]+=tmp1*tmp2[0];
423 bary[1]+=tmp1*tmp2[1];
430 * \sa ComposedEdge::isInOrOut2
432 bool ComposedEdge::isInOrOut(Node *nodeToTest) const
434 std::set< IntersectElement > inOutSwitch;
435 double ref(isInOrOutAlg(nodeToTest,inOutSwitch));
437 for(std::set< IntersectElement >::iterator iter4=inOutSwitch.begin();iter4!=inOutSwitch.end();iter4++)
439 if((*iter4).getVal1()<ref)
441 if((*iter4).getNodeOnly()->getLoc()==ON_1)
451 * This method is close to ComposedEdge::isInOrOut behaviour except that here EPSILON is taken into account to detect if it is IN or OUT.
452 * If \a nodeToTest is close to an edge in \a this, true will be returned even if it is outside informatically from \a this.
453 * This method makes the hypothesis that
455 * \sa ComposedEdge::isInOrOut
457 bool ComposedEdge::isInOrOut2(Node *nodeToTest) const
459 std::set< IntersectElement > inOutSwitch;
460 double ref(isInOrOutAlg(nodeToTest,inOutSwitch));
462 for(std::set< IntersectElement >::iterator iter4=inOutSwitch.begin();iter4!=inOutSwitch.end();iter4++)
464 double val((*iter4).getVal1());
465 if(fabs(val-ref)>=QUADRATIC_PLANAR::_precision)
469 if((*iter4).getNodeOnly()->getLoc()==ON_1)
481 double ComposedEdge::isInOrOutAlg(Node *nodeToTest, std::set< IntersectElement >& inOutSwitch) const
483 Bounds b; b.prepareForAggregation();
485 if(b.nearlyWhere((*nodeToTest)[0],(*nodeToTest)[1])==OUT)
488 std::set<Node *> nodes;
490 std::set<double> radialDistributionOfNodes;
491 std::set<Node *>::const_iterator iter;
492 for(iter=nodes.begin();iter!=nodes.end();iter++)
493 radialDistributionOfNodes.insert(nodeToTest->getSlope(*(*iter)));
494 std::vector<double> radialDistrib(radialDistributionOfNodes.begin(),radialDistributionOfNodes.end());
495 radialDistributionOfNodes.clear();
496 std::vector<double> radialDistrib2(radialDistrib.size());
497 copy(radialDistrib.begin()+1,radialDistrib.end(),radialDistrib2.begin());
498 radialDistrib2.back()=M_PI+radialDistrib.front();
499 std::vector<double> radialDistrib3(radialDistrib.size());
500 std::transform(radialDistrib2.begin(),radialDistrib2.end(),radialDistrib.begin(),radialDistrib3.begin(),std::minus<double>());
501 std::vector<double>::iterator iter3=max_element(radialDistrib3.begin(),radialDistrib3.end());
502 int i=iter3-radialDistrib3.begin();
503 // ok for e1 - Let's go.
504 EdgeInfLin *e1=new EdgeInfLin(nodeToTest,radialDistrib[i]+radialDistrib3[i]/2.);
505 double ref=e1->getCharactValue(*nodeToTest);
506 for(std::list<ElementaryEdge *>::const_iterator iter4=_sub_edges.begin();iter4!=_sub_edges.end();iter4++)
508 ElementaryEdge *val=(*iter4);
511 Edge *e=val->getPtr();
512 std::auto_ptr<EdgeIntersector> intersc(Edge::BuildIntersectorWith(e1,e));
513 bool obviousNoIntersection,areOverlapped;
514 intersc->areOverlappedOrOnlyColinears(0,obviousNoIntersection,areOverlapped);
515 if(obviousNoIntersection)
521 std::list< IntersectElement > listOfIntesc=intersc->getIntersectionsCharacteristicVal();
522 for(std::list< IntersectElement >::iterator iter2=listOfIntesc.begin();iter2!=listOfIntesc.end();iter2++)
523 if((*iter2).isIncludedByBoth())
524 inOutSwitch.insert(*iter2);
526 //if overlapped we can forget
529 throw Exception("Invalid use of ComposedEdge::isInOrOutAlg : only one level supported !");
535 /*bool ComposedEdge::isInOrOut(Node *aNodeOn, Node *nodeToTest) const
538 EdgeInfLin *e1=new EdgeInfLin(aNodeOn,nodeToTest);
539 double ref=e1->getCharactValue(*nodeToTest);
540 set< IntersectElement > inOutSwitch;
541 for(vector<AbstractEdge *>::const_iterator iter=_sub_edges.begin();iter!=_sub_edges.end();iter++)
543 ElementaryEdge *val=dynamic_cast<ElementaryEdge *>(*iter);
546 Edge *e=val->getPtr();
547 auto_ptr<Intersector> intersc(Edge::buildIntersectorWith(e1,e));
548 bool obviousNoIntersection,areOverlapped;
549 intersc->areOverlappedOrOnlyColinears(0,obviousNoIntersection,areOverlapped);
550 if(obviousNoIntersection)
556 list< IntersectElement > listOfIntesc=intersc->getIntersectionsCharacteristicVal();
557 for(list< IntersectElement >::iterator iter2=listOfIntesc.begin();iter2!=listOfIntesc.end();iter2++)
558 if((*iter2).isIncludedByBoth())
559 inOutSwitch.insert(*iter2);
561 //if overlapped we can forget
564 throw Exception("Invalid use of ComposedEdge::isInOrOut : only one level supported !");
568 for(set< IntersectElement >::iterator iter=inOutSwitch.begin();iter!=inOutSwitch.end();iter++)
570 if((*iter).getVal1()<ref)
572 if((*iter).getNodeOnly()->getLoc()==ON_1)
581 bool ComposedEdge::getDirection() const
583 throw Exception("ComposedEdge::getDirection : no sense");
586 bool ComposedEdge::intresincEqCoarse(const Edge *other) const
588 if(_sub_edges.size()!=1)
590 return _sub_edges.front()->intresincEqCoarse(other);
593 void ComposedEdge::clearAll(std::list<ElementaryEdge *>::iterator startToDel)
595 for(std::list<ElementaryEdge *>::iterator iter=startToDel;iter!=_sub_edges.end();iter++)