1 // Copyright (C) 2007-2015 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, or (at your option) any later version.
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 // File : SMESH_MAT2d.cxx
23 // Created : Thu May 28 17:49:53 2015
24 // Author : Edward AGAPOV (eap)
26 #include "SMESH_MAT2d.hxx"
30 #include <BRepAdaptor_CompCurve.hxx>
31 #include <BRepBuilderAPI_MakeEdge.hxx>
32 #include <BRepBuilderAPI_MakeVertex.hxx>
33 #include <BRep_Builder.hxx>
34 #include <BRep_Tool.hxx>
35 #include <Bnd_B2d.hxx>
36 //#include <GCPnts_AbscissaPoint.hxx>
37 #include <GCPnts_TangentialDeflection.hxx>
38 // #include <GCPnts_UniformAbscissa.hxx>
39 // #include <GCPnts_UniformDeflection.hxx>
40 #include <Geom2d_Curve.hxx>
41 //#include <GeomAdaptor_Curve.hxx>
42 #include <Geom2dAdaptor_Curve.hxx>
43 #include <Geom_Curve.hxx>
44 #include <Geom_Surface.hxx>
46 #include <TopoDS_Vertex.hxx>
47 #include <TopoDS_Wire.hxx>
51 #include "SMESH_File.hxx"
52 #include "SMESH_Comment.hxx"
56 using boost::polygon::x;
57 using boost::polygon::y;
58 using SMESH_MAT2d::TVD;
59 using SMESH_MAT2d::TVDEdge;
60 using SMESH_MAT2d::TVDCell;
61 using SMESH_MAT2d::TVDVertex;
65 // Input data for construct_voronoi()
66 // -------------------------------------------------------------------------------------
70 int _a, _b; // coordinates
71 double _param; // param on EDGE
72 InPoint(int x, int y, double param) : _a(x), _b(y), _param(param) {}
73 InPoint() : _a(0), _b(0), _param(0) {}
76 list< const TVDEdge* > _edges; // MA edges of a concave InPoint in CCW order
78 size_t index( const vector< InPoint >& inPoints ) const { return this - &inPoints[0]; }
79 bool operator==( const InPoint& other ) const { return _a == other._a && _b == other._b; }
80 bool operator==( const TVDVertex* v ) const { return ( Abs( _a - v->x() ) < 1. &&
81 Abs( _b - v->y() ) < 1. ); }
83 // -------------------------------------------------------------------------------------
91 size_t _geomEdgeInd; // EDGE index within the FACE
93 list< const TVDEdge* > _edges; // MA edges in CCW order within _cell
95 InSegment( InPoint * p0, InPoint * p1, size_t iE)
96 : _p0(p0), _p1(p1), _geomEdgeInd(iE) {}
97 InSegment() : _p0(0), _p1(0), _geomEdgeInd(0) {}
99 const InPoint& point0() const { return *_p0; }
100 const InPoint& point1() const { return *_p1; }
102 inline bool isConnected( const TVDEdge* edge );
104 inline bool isExternal( const TVDEdge* edge );
106 static void setGeomEdgeToCell( const TVDCell* cell, size_t eID ) { cell->color( eID ); }
108 static size_t getGeomEdge( const TVDCell* cell ) { return cell->color(); }
111 // check if a TVDEdge begins at my end or ends at my start
112 inline bool InSegment::isConnected( const TVDEdge* edge )
114 return (( edge->vertex0() && edge->vertex1() )
116 ((Abs( edge->vertex0()->x() - _p1->_a ) < 1.&&
117 Abs( edge->vertex0()->y() - _p1->_b ) < 1. ) ||
118 (Abs( edge->vertex1()->x() - _p0->_a ) < 1.&&
119 Abs( edge->vertex1()->y() - _p0->_b ) < 1. )));
122 // check if a MA TVDEdge is outside of a domain
123 inline bool InSegment::isExternal( const TVDEdge* edge )
125 double dot = // x1*x2 + y1*y2; (x1,y1) - internal normal of InSegment
126 ( _p0->_b - _p1->_b ) * ( 0.5 * ( edge->vertex0()->x() + edge->vertex1()->x() ) - _p0->_a ) +
127 ( _p1->_a - _p0->_a ) * ( 0.5 * ( edge->vertex0()->y() + edge->vertex1()->y() ) - _p0->_b );
131 // // -------------------------------------------------------------------------------------
132 // const size_t theExternMA = 111; // to mark external MA edges
134 // bool isExternal( const TVDEdge* edge )
136 // return ( SMESH_MAT2d::Branch::getBndSegment( edge ) == theExternMA );
139 // // mark external MA edges
140 // void markExternalEdges( const TVDEdge* edge )
142 // if ( isExternal( edge ))
144 // SMESH_MAT2d::Branch::setBndSegment( theExternMA, edge );
145 // SMESH_MAT2d::Branch::setBndSegment( theExternMA, edge->twin() );
146 // if ( edge->is_primary() && edge->vertex1() )
148 // const TVDVertex * v = edge->vertex1();
149 // edge = v->incident_edge();
151 // markExternalEdges( edge );
152 // edge = edge->rot_next();
153 // } while ( edge != v->incident_edge() );
157 // -------------------------------------------------------------------------------------
159 // writes segments into a txt file readable by voronoi_visualizer
160 void inSegmentsToFile( vector< InSegment>& inSegments)
162 if ( inSegments.size() > 1000 )
164 const char* fileName = "/misc/dn25/salome/eap/salome/misc/Code/C++/MAdebug.txt";
165 SMESH_File file(fileName, false );
167 file.openForWriting();
169 text << "0\n"; // nb points
170 text << inSegments.size() << "\n"; // nb segments
171 for ( size_t i = 0; i < inSegments.size(); ++i )
173 text << inSegments[i]._p0->_a << " "
174 << inSegments[i]._p0->_b << " "
175 << inSegments[i]._p1->_a << " "
176 << inSegments[i]._p1->_b << "\n";
179 file.write( text.c_str(), text.size() );
180 cout << "Write " << fileName << endl;
182 void dumpEdge( const TVDEdge* edge )
184 cout << "*Edge_" << edge;
185 if ( !edge->vertex0() )
186 cout << " ( INF, INF";
188 cout << " ( " << edge->vertex0()->x() << ", " << edge->vertex0()->y();
189 if ( !edge->vertex1() )
190 cout << ") -> ( INF, INF";
192 cout << ") -> ( " << edge->vertex1()->x() << ", " << edge->vertex1()->y();
193 cout << ")\t cell=" << edge->cell()
194 << " iBnd=" << edge->color()
195 << " twin=" << edge->twin()
196 << " twin_cell=" << edge->twin()->cell()
197 << " prev=" << edge->prev() << " next=" << edge->next()
198 << ( edge->is_primary() ? " MA " : " SCND" )
199 << ( edge->is_linear() ? " LIN " : " CURV" )
202 void dumpCell( const TVDCell* cell )
204 cout << "**Cell_" << cell << " GEOM=" << cell->color() << " ";
205 cout << ( cell->contains_segment() ? " SEG " : " PNT " );
206 if ( cell-> is_degenerate() )
211 const TVDEdge* edge = cell->incident_edge();
215 cout << " - " << ++i << " ";
217 } while (edge != cell->incident_edge());
221 void inSegmentsToFile( vector< InSegment>& inSegments) {}
222 void dumpEdge( const TVDEdge* edge ) {}
223 void dumpCell( const TVDCell* cell ) {}
226 // -------------------------------------------------------------------------------------
232 struct geometry_concept<InPoint> {
233 typedef point_concept type;
236 struct point_traits<InPoint> {
237 typedef int coordinate_type;
239 static inline coordinate_type get(const InPoint& point, orientation_2d orient) {
240 return (orient == HORIZONTAL) ? point._a : point._b;
245 struct geometry_concept<InSegment> {
246 typedef segment_concept type;
250 struct segment_traits<InSegment> {
251 typedef int coordinate_type;
252 typedef InPoint point_type;
254 static inline point_type get(const InSegment& segment, direction_1d dir) {
255 return *(dir.to_int() ? segment._p1 : segment._p0);
258 } // namespace polygon
260 // -------------------------------------------------------------------------------------
264 const int theNoBrachID = 0;
265 double theScale[2]; // scale used in bndSegsToMesh()
266 const size_t theNoEdgeID = std::numeric_limits<size_t>::max() / 1000;
268 // -------------------------------------------------------------------------------------
270 * \brief Intermediate DS to create InPoint's
276 UVU( gp_Pnt2d uv, double u ): _uv(uv), _u(u) {}
277 InPoint getInPoint( double scale[2] )
279 return InPoint( int( _uv.X() * scale[0]), int( _uv.Y() * scale[1]), _u );
282 // -------------------------------------------------------------------------------------
284 * \brief Segment of EDGE, used to create BndPoints
289 const TVDEdge* _edge;
291 BndSeg* _prev; // previous BndSeg in FACE boundary
292 int _branchID; // negative ID means reverse direction
294 BndSeg( InSegment* seg, const TVDEdge* edge, double u ):
295 _inSeg(seg), _edge(edge), _uLast(u), _prev(0), _branchID( theNoBrachID ) {}
297 void setIndexToEdge( size_t id )
299 SMESH_MAT2d::Branch::setBndSegment( id, _edge );
302 int branchID() const { return Abs( _branchID ); }
304 size_t geomEdge() const { return _inSeg->_geomEdgeInd; }
306 static BndSeg* getBndSegOfEdge( const TVDEdge* edge,
307 vector< vector< BndSeg > >& bndSegsPerEdge )
312 size_t oppSegIndex = SMESH_MAT2d::Branch::getBndSegment( edge );
313 size_t oppEdgeIndex = SMESH_MAT2d::Branch::getGeomEdge ( edge );
314 if ( oppEdgeIndex < bndSegsPerEdge.size() &&
315 oppSegIndex < bndSegsPerEdge[ oppEdgeIndex ].size() )
317 seg = & bndSegsPerEdge[ oppEdgeIndex ][ oppSegIndex ];
323 void setBranch( int branchID, vector< vector< BndSeg > >& bndSegsPerEdge )
325 _branchID = branchID;
327 // pass branch to an opposite BndSeg
329 if ( BndSeg* oppSeg = getBndSegOfEdge( _edge->twin(), bndSegsPerEdge ))
331 if ( oppSeg->_branchID == theNoBrachID )
332 oppSeg->_branchID = -branchID;
335 bool hasOppositeEdge()
337 if ( !_edge ) return false;
338 return ( _inSeg->getGeomEdge( _edge->twin()->cell() ) != theNoEdgeID );
341 // check a next segment in CW order
342 bool isSameBranch( const BndSeg& seg2 )
344 if ( !_edge || !seg2._edge )
347 const TVDCell* cell1 = this->_edge->twin()->cell();
348 const TVDCell* cell2 = seg2. _edge->twin()->cell();
349 if ( cell1 == cell2 )
352 const TVDEdge* edgeMedium1 = this->_edge->twin()->next();
353 const TVDEdge* edgeMedium2 = seg2. _edge->twin()->prev();
355 if ( edgeMedium1->is_secondary() && edgeMedium2->is_secondary() )
357 if ( edgeMedium1->twin() == edgeMedium2 )
359 // edgeMedium's are edges whose twin()->cell is built on an end point of inSegment
360 // and is located between cell1 and cell2
361 if ( edgeMedium1->twin() == edgeMedium2->twin() ) // is this possible???
363 if ( edgeMedium1->twin() == edgeMedium2->twin()->next() &&
364 edgeMedium1->twin()->cell()->contains_point() )
367 else if ( edgeMedium1->is_primary() && edgeMedium2->is_primary() )
369 if ( edgeMedium1->twin() == edgeMedium2 &&
370 SMESH_MAT2d::Branch::getBndSegment( edgeMedium1 ) ==
371 SMESH_MAT2d::Branch::getBndSegment( edgeMedium2 ))
372 // this is an ignored MA edge between inSegment's on one EDGE forming a convex corner
380 // -------------------------------------------------------------------------------------
384 struct BranchIterator
387 const std::vector<const TVDEdge*> & _edges;
390 BranchIterator(const std::vector<const TVDEdge*> & edges, int i )
391 :_i( i ), _size( edges.size() ), _edges( edges )
393 _closed = ( edges[0]->vertex1() == edges.back()->vertex0() || // closed branch
394 edges[0]->vertex0() == edges.back()->vertex1() );
396 const TVDEdge* operator++() { ++_i; return edge(); }
397 const TVDEdge* operator--() { --_i; return edge(); }
398 bool operator<( const BranchIterator& other ) { return _i < other._i; }
399 BranchIterator& operator=( const BranchIterator& other ) { _i = other._i; return *this; }
400 void set(int i) { _i = i; }
401 int index() const { return _i; }
402 int indexMod() const { return ( _i + _size ) % _size; }
403 const TVDEdge* edge() const {
404 return _closed ? _edges[ indexMod() ] : ( _i < 0 || _i >= _size ) ? 0 : _edges[ _i ];
406 const TVDEdge* edgePrev() { --_i; const TVDEdge* e = edge(); ++_i; return e; }
407 const TVDEdge* edgeNext() { ++_i; const TVDEdge* e = edge(); --_i; return e; }
410 //================================================================================
412 * \brief debug: to visually check found MA edges
414 //================================================================================
416 void bndSegsToMesh( const vector< BndSeg >& bndSegs )
419 if ( !getenv("bndSegsToMesh")) return;
420 map< const TVDVertex *, int > v2Node;
421 map< const TVDVertex *, int >::iterator v2n;
422 set< const TVDEdge* > addedEdges;
424 const char* fileName = "/misc/dn25/salome/eap/salome/misc/Code/C++/MAedges.py";
425 SMESH_File file(fileName, false );
427 file.openForWriting();
429 text << "import salome, SMESH\n";
430 text << "salome.salome_init()\n";
431 text << "from salome.smesh import smeshBuilder\n";
432 text << "smesh = smeshBuilder.New(salome.myStudy)\n";
433 text << "m=smesh.Mesh()\n";
434 for ( size_t i = 0; i < bndSegs.size(); ++i )
436 if ( !bndSegs[i]._edge )
437 text << "# " << i << " NULL edge\n";
438 else if ( !bndSegs[i]._edge->vertex0() ||
439 !bndSegs[i]._edge->vertex1() )
440 text << "# " << i << " INFINITE edge\n";
441 else if ( addedEdges.insert( bndSegs[i]._edge ).second &&
442 addedEdges.insert( bndSegs[i]._edge->twin() ).second )
444 v2n = v2Node.insert( make_pair( bndSegs[i]._edge->vertex0(), v2Node.size() + 1 )).first;
445 int n0 = v2n->second;
446 if ( n0 == v2Node.size() )
447 text << "n" << n0 << " = m.AddNode( "
448 << bndSegs[i]._edge->vertex0()->x() / theScale[0] << ", "
449 << bndSegs[i]._edge->vertex0()->y() / theScale[1] << ", 0 )\n";
451 v2n = v2Node.insert( make_pair( bndSegs[i]._edge->vertex1(), v2Node.size() + 1 )).first;
452 int n1 = v2n->second;
453 if ( n1 == v2Node.size() )
454 text << "n" << n1 << " = m.AddNode( "
455 << bndSegs[i]._edge->vertex1()->x() / theScale[0] << ", "
456 << bndSegs[i]._edge->vertex1()->y() / theScale[1] << ", 0 )\n";
458 text << "e" << i << " = m.AddEdge([ n" << n0 << ", n" << n1 << " ])\n";
462 file.write( text.c_str(), text.size() );
463 cout << "execfile( '" << fileName << "')" << endl;
467 //================================================================================
469 * \brief Computes length of a TVDEdge
471 //================================================================================
473 double length( const TVDEdge* edge )
475 gp_XY d( edge->vertex0()->x() - edge->vertex1()->x(),
476 edge->vertex0()->y() - edge->vertex1()->y() );
480 //================================================================================
482 * \brief Compute scale to have the same 2d proportions as in 3d
484 //================================================================================
486 void computeProportionScale( const TopoDS_Face& face,
487 const Bnd_B2d& uvBox,
490 scale[0] = scale[1] = 1.;
491 if ( uvBox.IsVoid() ) return;
494 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
496 const int nbDiv = 30;
497 gp_XY uvMin = uvBox.CornerMin(), uvMax = uvBox.CornerMax();
498 gp_XY uvMid = 0.5 * ( uvMin + uvMax );
499 double du = ( uvMax.X() - uvMin.X() ) / nbDiv;
500 double dv = ( uvMax.Y() - uvMin.Y() ) / nbDiv;
502 double uLen3d = 0, vLen3d = 0;
503 gp_Pnt uPrevP = surface->Value( uvMin.X(), uvMid.Y() );
504 gp_Pnt vPrevP = surface->Value( uvMid.X(), uvMin.Y() );
505 for (int i = 1; i <= nbDiv; i++)
507 double u = uvMin.X() + du * i;
508 double v = uvMin.Y() + dv * i;
509 gp_Pnt uP = surface->Value( u, uvMid.Y() );
510 gp_Pnt vP = surface->Value( uvMid.X(), v );
511 uLen3d += uP.Distance( uPrevP );
512 vLen3d += vP.Distance( vPrevP );
516 scale[0] = uLen3d / ( uvMax.X() - uvMin.X() );
517 scale[1] = vLen3d / ( uvMax.Y() - uvMin.Y() );
520 //================================================================================
522 * \brief Fill input data for construct_voronoi()
524 //================================================================================
526 bool makeInputData(const TopoDS_Face& face,
527 const std::vector< TopoDS_Edge >& edges,
528 const double minSegLen,
529 vector< InPoint >& inPoints,
530 vector< InSegment>& inSegments,
533 const double theDiscrCoef = 0.5; // to decrease minSegLen for discretization
536 // discretize the EDGEs to get 2d points and segments
538 vector< vector< UVU > > uvuVec( edges.size() );
540 for ( size_t iE = 0; iE < edges.size(); ++iE )
542 vector< UVU > & points = uvuVec[ iE ];
545 Handle(Geom_Curve) c3d = BRep_Tool::Curve ( edges[ iE ], loc, f, l );
546 Handle(Geom2d_Curve) c2d = BRep_Tool::CurveOnSurface( edges[ iE ], face, f, l );
547 if ( c2d.IsNull() ) return false;
549 points.push_back( UVU( c2d->Value( f ), f ));
550 uvBox.Add( points.back()._uv );
552 Geom2dAdaptor_Curve c2dAdaptor (c2d, f,l );
553 double curDeflect = 0.3; //0.01; //Curvature deflection
554 double angDeflect = 0.2; // 0.09; //Angular deflection
556 GCPnts_TangentialDeflection discret(c2dAdaptor, angDeflect, curDeflect);
557 // if ( discret.NbPoints() > 2 )
562 // discret.Initialize( c2dAdaptor, 100, curDeflect );
563 // cout << "C " << curDeflect << " " << discret.NbPoints() << endl;
564 // curDeflect *= 1.5;
566 // while ( discret.NbPoints() > 5 );
570 // discret.Initialize( c2dAdaptor, angDeflect, 100 );
571 // cout << "A " << angDeflect << " " << discret.NbPoints() << endl;
572 // angDeflect *= 1.5;
574 // while ( discret.NbPoints() > 5 );
578 pPrev = c3d->Value( f );
579 if ( discret.NbPoints() > 2 )
580 for ( int i = 2; i <= discret.NbPoints(); i++ ) // skip the 1st point
582 double u = discret.Parameter(i);
586 int nbDiv = int( p.Distance( pPrev ) / minSegLen / theDiscrCoef );
587 double dU = ( u - points.back()._u ) / nbDiv;
588 for ( int iD = 1; iD < nbDiv; ++iD )
590 double uD = points.back()._u + dU;
591 points.push_back( UVU( c2d->Value( uD ), uD ));
595 points.push_back( UVU( c2d->Value( u ), u ));
596 uvBox.Add( points.back()._uv );
598 // if ( !c3d.IsNull() )
600 // vector<double> params;
601 // GeomAdaptor_Curve c3dAdaptor( c3d,f,l );
604 // const double deflection = minSegLen * 0.1;
605 // GCPnts_UniformDeflection discret( c3dAdaptor, deflection, f, l, true );
606 // if ( !discret.IsDone() )
608 // int nbP = discret.NbPoints();
609 // for ( int i = 2; i < nbP; i++ ) // skip 1st and last points
610 // params.push_back( discret.Parameter(i) );
614 // double eLen = GCPnts_AbscissaPoint::Length( c3dAdaptor );
615 // int nbSeg = Max( 1, int( eLen / minSegLen / theDiscrCoef ));
616 // double segLen = eLen / nbSeg;
617 // GCPnts_UniformAbscissa discret( c3dAdaptor, segLen, f, l );
618 // int nbP = Min( discret.NbPoints(), nbSeg + 1 );
619 // for ( int i = 2; i < nbP; i++ ) // skip 1st and last points
620 // params.push_back( discret.Parameter(i) );
622 // for ( size_t i = 0; i < params.size(); ++i )
624 // points.push_back( UVU( c2d->Value( params[i] ), params[i] ));
625 // uvBox.Add( points.back()._uv );
628 if ( points.size() < 2 )
630 points.push_back( UVU( c2d->Value( l ), l ));
631 uvBox.Add( points.back()._uv );
633 if ( edges[ iE ].Orientation() == TopAbs_REVERSED )
634 std::reverse( points.begin(), points.end() );
637 // make connected EDGEs have same UV at shared VERTEX
638 TopoDS_Vertex vShared;
639 for ( size_t iE = 0; iE < edges.size(); ++iE )
641 size_t iE2 = (iE+1) % edges.size();
642 if ( !TopExp::CommonVertex( edges[iE], edges[iE2], vShared ))
644 if ( !vShared.IsSame( TopExp::LastVertex( edges[iE], true )))
646 vector< UVU > & points1 = uvuVec[ iE ];
647 vector< UVU > & points2 = uvuVec[ iE2 ];
648 gp_Pnt2d & uv1 = points1.back() ._uv;
649 gp_Pnt2d & uv2 = points2.front()._uv;
650 uv1 = uv2 = 0.5 * ( uv1.XY() + uv2.XY() );
653 // get scale to have the same 2d proportions as in 3d
654 computeProportionScale( face, uvBox, scale );
656 // make scale to have coordinates precise enough when converted to int
658 gp_XY uvMin = uvBox.CornerMin(), uvMax = uvBox.CornerMax();
659 uvMin.ChangeCoord(1) = uvMin.X() * scale[0];
660 uvMin.ChangeCoord(2) = uvMin.Y() * scale[1];
661 uvMax.ChangeCoord(1) = uvMax.X() * scale[0];
662 uvMax.ChangeCoord(2) = uvMax.Y() * scale[1];
663 double vMax[2] = { Max( Abs( uvMin.X() ), Abs( uvMax.X() )),
664 Max( Abs( uvMin.Y() ), Abs( uvMax.Y() )) };
665 int iMax = ( vMax[0] > vMax[1] ) ? 0 : 1;
666 const double precision = 1e-5;
667 double preciScale = Min( vMax[iMax] / precision,
668 std::numeric_limits<int>::max() / vMax[iMax] );
669 preciScale /= scale[iMax];
670 double roundedScale = 10; // to ease debug
671 while ( roundedScale * 10 < preciScale )
673 scale[0] *= roundedScale;
674 scale[1] *= roundedScale;
676 // create input points and segments
681 for ( size_t iE = 0; iE < uvuVec.size(); ++iE )
682 nbPnt += uvuVec[ iE ].size();
683 inPoints.resize( nbPnt );
684 inSegments.reserve( nbPnt );
687 if ( face.Orientation() == TopAbs_REVERSED )
689 for ( int iE = uvuVec.size()-1; iE >= 0; --iE )
691 vector< UVU > & points = uvuVec[ iE ];
692 inPoints[ iP++ ] = points.back().getInPoint( scale );
693 for ( size_t i = points.size()-1; i >= 1; --i )
695 inPoints[ iP++ ] = points[i-1].getInPoint( scale );
696 inSegments.push_back( InSegment( & inPoints[ iP-2 ], & inPoints[ iP-1 ], iE ));
702 for ( size_t iE = 0; iE < uvuVec.size(); ++iE )
704 vector< UVU > & points = uvuVec[ iE ];
705 inPoints[ iP++ ] = points[0].getInPoint( scale );
706 for ( size_t i = 1; i < points.size(); ++i )
708 inPoints[ iP++ ] = points[i].getInPoint( scale );
709 inSegments.push_back( InSegment( & inPoints[ iP-2 ], & inPoints[ iP-1 ], iE ));
714 theScale[0] = scale[0];
715 theScale[1] = scale[1];
720 //================================================================================
722 * \brief Update a branch joined to another one
724 //================================================================================
726 void updateJoinedBranch( vector< const TVDEdge* > & branchEdges,
728 vector< vector< BndSeg > > & bndSegs,
734 for ( size_t i = 0; i < branchEdges.size(); ++i )
736 if (( seg1 = BndSeg::getBndSegOfEdge( branchEdges[i], bndSegs )) &&
737 ( seg2 = BndSeg::getBndSegOfEdge( branchEdges[i]->twin(), bndSegs )))
739 seg1->_branchID /= seg1->branchID();
740 seg2->_branchID /= seg2->branchID();
741 seg1->_branchID *= -newID;
742 seg2->_branchID *= -newID;
743 branchEdges[i] = branchEdges[i]->twin();
746 std::reverse( branchEdges.begin(), branchEdges.end() );
750 for ( size_t i = 0; i < branchEdges.size(); ++i )
752 if (( seg1 = BndSeg::getBndSegOfEdge( branchEdges[i], bndSegs )) &&
753 ( seg2 = BndSeg::getBndSegOfEdge( branchEdges[i]->twin(), bndSegs )))
755 seg1->_branchID /= seg1->branchID();
756 seg2->_branchID /= seg2->branchID();
757 seg1->_branchID *= newID;
758 seg2->_branchID *= newID;
764 //================================================================================
766 * \brief Create MA branches and FACE boundary data
767 * \param [in] vd - voronoi diagram of \a inSegments
768 * \param [in] inPoints - FACE boundary points
769 * \param [in,out] inSegments - FACE boundary segments
770 * \param [out] branch - MA branches to fill
771 * \param [out] branchEnd - ends of MA branches to fill
772 * \param [out] boundary - FACE boundary to fill
774 //================================================================================
776 void makeMA( const TVD& vd,
777 const bool ignoreCorners,
778 vector< InPoint >& inPoints,
779 vector< InSegment > & inSegments,
780 vector< SMESH_MAT2d::Branch >& branch,
781 vector< const SMESH_MAT2d::BranchEnd* >& branchPnt,
782 SMESH_MAT2d::Boundary& boundary )
784 // Associate MA cells with geom EDGEs
785 for (TVD::const_cell_iterator it = vd.cells().begin(); it != vd.cells().end(); ++it)
787 const TVDCell* cell = &(*it);
788 if ( cell->contains_segment() )
790 InSegment& seg = inSegments[ cell->source_index() ];
792 seg.setGeomEdgeToCell( cell, seg._geomEdgeInd );
796 InSegment::setGeomEdgeToCell( cell, theNoEdgeID );
800 vector< bool > inPntChecked( inPoints.size(), false );
802 // Find MA edges of each inSegment
804 for ( size_t i = 0; i < inSegments.size(); ++i )
806 InSegment& inSeg = inSegments[i];
808 // get edges around the cell lying on MA
809 bool hasSecondary = false;
810 const TVDEdge* edge = inSeg._cell->incident_edge();
812 edge = edge->next(); // Returns the CCW next edge within the cell.
813 if ( edge->is_primary() && !inSeg.isExternal( edge ) )
814 inSeg._edges.push_back( edge ); // edge equidistant from two InSegments
817 } while (edge != inSeg._cell->incident_edge());
819 // there can be several continuous MA edges but maEdges can begin in the middle of
820 // a chain of continuous MA edges. Make the chain continuous.
821 list< const TVDEdge* >& maEdges = inSeg._edges;
822 if ( maEdges.empty() )
825 while ( maEdges.back()->next() == maEdges.front() )
826 maEdges.splice( maEdges.end(), maEdges, maEdges.begin() );
828 // remove maEdges equidistant from two neighbor InSegments of the same geom EDGE
829 list< const TVDEdge* >::iterator e = maEdges.begin();
830 while ( e != maEdges.end() )
832 const TVDCell* cell2 = (*e)->twin()->cell(); // cell on the other side of a MA edge
833 size_t geoE2 = InSegment::getGeomEdge( cell2 );
834 bool toRemove = ( inSeg._geomEdgeInd == geoE2 && inSeg.isConnected( *e ));
836 e = maEdges.erase( e );
840 if ( maEdges.empty() )
843 // add MA edges corresponding to concave InPoints
844 for ( int is2nd = 0; is2nd < 2; ++is2nd ) // loop on two ends of inSeg
846 InPoint& inPnt = *( is2nd ? inSeg._p1 : inSeg._p0 );
847 size_t pInd = inPnt.index( inPoints );
848 if ( inPntChecked[ pInd ] )
851 inPntChecked[ pInd-1 ] &&
852 inPoints[ pInd-1 ] == inPnt )
854 inPntChecked[ pInd ] = true;
856 const TVDEdge* maE = is2nd ? maEdges.front() : maEdges.back();
857 if ( inPnt == ( is2nd ? maE->vertex0() : maE->vertex1() ))
859 const TVDEdge* edge = // a secondary TVDEdge connecting inPnt and maE
860 is2nd ? maE->prev() : maE->next();
861 while ( inSeg.isConnected( edge ))
863 if ( edge->is_primary() ) break; // this should not happen
864 const TVDEdge* edge2 = edge->twin(); // we are in a neighbor cell, add MA edges to inPnt
865 if ( inSeg.getGeomEdge( edge2->cell() ) != theNoEdgeID )
866 break; // cell of an InSegment
867 bool hasInfinite = false;
868 list< const TVDEdge* > pointEdges;
872 edge = edge->next(); // Returns the CCW next edge within the cell.
873 if ( edge->is_infinite() )
875 else if ( edge->is_primary() && !inSeg.isExternal( edge ))
876 pointEdges.push_back( edge );
878 while ( edge != edge2 && !hasInfinite );
880 if ( hasInfinite || pointEdges.empty() )
882 inPnt._edges.splice( inPnt._edges.end(), pointEdges );
883 inSeg.setGeomEdgeToCell( edge->cell(), inSeg._geomEdgeInd );
885 edge = is2nd ? inPnt._edges.front()->prev() : inPnt._edges.back()->next();
887 } // add MA edges corresponding to concave InPoints
889 } // loop on inSegments to find corresponding MA edges
892 // -------------------------------------------
893 // Create Branches and BndPoints for each EDGE
894 // -------------------------------------------
896 if ( inPoints.front() == inPoints.back() /*&& !inPoints[0]._edges.empty()*/ )
898 inPntChecked[0] = false; // do not use the 1st point twice
899 //InSegment::setGeomEdgeToCell( inPoints[0]._edges.back()->cell(), theNoEdgeID );
900 inPoints[0]._edges.clear();
903 // Divide InSegment's into BndSeg's (so that each BndSeg corresponds to one MA edge)
905 vector< vector< BndSeg > > bndSegsPerEdge( boundary.nbEdges() ); // all BndSeg's
907 vector< BndSeg > bndSegs; // bndSeg's of a current EDGE
908 size_t prevGeomEdge = theNoEdgeID;
910 list< const TVDEdge* >::reverse_iterator e;
911 for ( size_t i = 0; i < inSegments.size(); ++i )
913 InSegment& inSeg = inSegments[i];
915 if ( inSeg._geomEdgeInd != prevGeomEdge )
917 if ( !bndSegs.empty() )
918 bndSegsPerEdge[ prevGeomEdge ].swap( bndSegs );
919 prevGeomEdge = inSeg._geomEdgeInd;
922 // segments around 1st concave point
923 size_t ip0 = inSeg._p0->index( inPoints );
924 if ( inPntChecked[ ip0 ] )
925 for ( e = inSeg._p0->_edges.rbegin(); e != inSeg._p0->_edges.rend(); ++e )
926 bndSegs.push_back( BndSeg( &inSeg, *e, inSeg._p0->_param ));
927 inPntChecked[ ip0 ] = false;
929 // segments of InSegment's
930 const size_t nbMaEdges = inSeg._edges.size();
931 switch ( nbMaEdges ) {
932 case 0: // "around" circle center
933 bndSegs.push_back( BndSeg( &inSeg, 0, inSeg._p1->_param )); break;
935 bndSegs.push_back( BndSeg( &inSeg, inSeg._edges.back(), inSeg._p1->_param )); break;
937 gp_XY inSegDir( inSeg._p1->_a - inSeg._p0->_a,
938 inSeg._p1->_b - inSeg._p0->_b );
939 const double inSegLen2 = inSegDir.SquareModulus();
940 e = inSeg._edges.rbegin();
941 for ( size_t iE = 1; iE < nbMaEdges; ++e, ++iE )
943 gp_XY toMA( (*e)->vertex0()->x() - inSeg._p0->_a,
944 (*e)->vertex0()->y() - inSeg._p0->_b );
945 double r = toMA * inSegDir / inSegLen2;
946 double u = r * inSeg._p1->_param + ( 1. - r ) * inSeg._p0->_param;
947 bndSegs.push_back( BndSeg( &inSeg, *e, u ));
949 bndSegs.push_back( BndSeg( &inSeg, *e, inSeg._p1->_param ));
951 // segments around 2nd concave point
952 size_t ip1 = inSeg._p1->index( inPoints );
953 if ( inPntChecked[ ip1 ] )
954 for ( e = inSeg._p1->_edges.rbegin(); e != inSeg._p1->_edges.rend(); ++e )
955 bndSegs.push_back( BndSeg( &inSeg, *e, inSeg._p1->_param ));
956 inPntChecked[ ip1 ] = false;
958 if ( !bndSegs.empty() )
959 bndSegsPerEdge[ prevGeomEdge ].swap( bndSegs );
962 // prepare to MA branch search
963 for ( size_t iE = 0; iE < bndSegsPerEdge.size(); ++iE )
965 // 1) make TVDEdge's know it's BndSeg to enable passing branchID to
966 // an opposite BndSeg in BndSeg::setBranch(); geom EDGE ID is known from TVDCell
967 // 2) connect bndSegs via BndSeg::_prev
969 vector< BndSeg >& bndSegs = bndSegsPerEdge[ iE ];
970 if ( bndSegs.empty() ) continue;
972 for ( size_t i = 1; i < bndSegs.size(); ++i )
974 bndSegs[i]._prev = & bndSegs[i-1];
975 bndSegs[i].setIndexToEdge( i );
977 // look for the last bndSeg of previous EDGE to set bndSegs[0]._prev
978 const InPoint& p0 = bndSegs[0]._inSeg->point0();
979 for ( size_t iE2 = 0; iE2 < bndSegsPerEdge.size(); ++iE2 )
980 if ( p0 == bndSegsPerEdge[ iE2 ].back()._inSeg->point1() )
982 bndSegs[0]._prev = & bndSegsPerEdge[ iE2 ].back();
985 bndSegs[0].setIndexToEdge( 0 );
988 //bndSegsToMesh( bndSegsPerEdge ); // debug: visually check found MA edges
991 // Find TVDEdge's of Branches and associate them with bndSegs
993 vector< vector<const TVDEdge*> > branchEdges;
994 branchEdges.reserve( boundary.nbEdges() * 4 );
996 map< const TVDVertex*, SMESH_MAT2d::BranchEndType > endType;
998 int branchID = 1; // we code orientation as branchID sign
999 branchEdges.resize( branchID );
1001 for ( size_t iE = 0; iE < bndSegsPerEdge.size(); ++iE )
1003 vector< BndSeg >& bndSegs = bndSegsPerEdge[ iE ];
1004 for ( size_t i = 0; i < bndSegs.size(); ++i )
1006 if ( bndSegs[i].branchID() )
1008 if ( bndSegs[i]._prev &&
1009 bndSegs[i]._branchID == -bndSegs[i]._prev->_branchID &&
1012 SMESH_MAT2d::BranchEndType type =
1013 ( bndSegs[i]._inSeg->isConnected( bndSegs[i]._edge ) ?
1014 SMESH_MAT2d::BE_ON_VERTEX :
1015 SMESH_MAT2d::BE_END );
1016 endType.insert( make_pair( bndSegs[i]._edge->vertex1(), type ));
1020 if ( !bndSegs[i]._prev &&
1021 !bndSegs[i].hasOppositeEdge() )
1024 if ( !bndSegs[i]._prev ||
1025 !bndSegs[i]._prev->isSameBranch( bndSegs[i] ))
1027 branchEdges.resize(( branchID = branchEdges.size()) + 1 );
1028 if ( bndSegs[i]._edge && bndSegs[i]._prev )
1029 endType.insert( make_pair( bndSegs[i]._edge->vertex1(), SMESH_MAT2d::BE_BRANCH_POINT ));
1031 else if ( bndSegs[i]._prev->_branchID )
1033 branchID = bndSegs[i]._prev->_branchID; // with sign
1035 else if ( bndSegs[i]._edge ) // 1st bndSeg of a WIRE
1037 branchEdges.resize(( branchID = branchEdges.size()) + 1 );
1038 if ( bndSegs[i]._inSeg->isConnected( bndSegs[i]._edge ))
1040 if ( bndSegs[i]._inSeg->point0() == bndSegs[i]._edge->vertex1() )
1041 endType.insert( make_pair( bndSegs[i]._edge->vertex1(), SMESH_MAT2d::BE_ON_VERTEX ));
1043 endType.insert( make_pair( bndSegs[i]._edge->vertex0(), SMESH_MAT2d::BE_ON_VERTEX ));
1047 bndSegs[i].setBranch( branchID, bndSegsPerEdge ); // set to i-th and to the opposite bndSeg
1048 if ( bndSegs[i].hasOppositeEdge() )
1049 branchEdges[ bndSegs[i].branchID() ].push_back( bndSegs[i]._edge );
1053 // join the 1st and the last branch edges if it is the same branch
1054 // if ( bndSegs.back().branchID() != bndSegs.front().branchID() &&
1055 // bndSegs.back().isSameBranch( bndSegs.front() ))
1057 // vector<const TVDEdge*> & br1 = branchEdges[ bndSegs.front().branchID() ];
1058 // vector<const TVDEdge*> & br2 = branchEdges[ bndSegs.back().branchID() ];
1059 // br1.insert( br1.begin(), br2.begin(), br2.end() );
1063 // remove branches ending at BE_ON_VERTEX
1065 vector<bool> isBranchRemoved( branchEdges.size(), false );
1067 if ( ignoreCorners && branchEdges.size() > 2 && !branchEdges[2].empty() )
1069 // find branches to remove
1070 map< const TVDVertex*, SMESH_MAT2d::BranchEndType >::iterator v2et;
1071 for ( size_t iB = 1; iB < branchEdges.size(); ++iB )
1073 if ( branchEdges[iB].empty() )
1075 const TVDVertex* v0 = branchEdges[iB][0]->vertex1();
1076 const TVDVertex* v1 = branchEdges[iB].back()->vertex0();
1077 v2et = endType.find( v0 );
1078 if ( v2et != endType.end() && v2et->second == SMESH_MAT2d::BE_ON_VERTEX )
1079 isBranchRemoved[ iB ] = true;
1080 v2et = endType.find( v1 );
1081 if ( v2et != endType.end() && v2et->second == SMESH_MAT2d::BE_ON_VERTEX )
1082 isBranchRemoved[ iB ] = true;
1084 // try to join not removed branches into one
1085 for ( size_t iB = 1; iB < branchEdges.size(); ++iB )
1087 if ( branchEdges[iB].empty() || isBranchRemoved[iB] )
1089 const TVDVertex* v0 = branchEdges[iB][0]->vertex1();
1090 const TVDVertex* v1 = branchEdges[iB].back()->vertex0();
1091 v2et = endType.find( v0 );
1092 if ( v2et == endType.end() || v2et->second != SMESH_MAT2d::BE_BRANCH_POINT )
1094 v2et = endType.find( v1 );
1095 if ( v2et == endType.end() || v2et->second != SMESH_MAT2d::BE_BRANCH_POINT )
1100 for ( int isV0 = 0; isV0 < 2; ++isV0 )
1102 const TVDVertex* v = isV0 ? v0 : v1;
1103 size_t iBrToJoin = 0;
1104 for ( size_t iB2 = 1; iB2 < branchEdges.size(); ++iB2 )
1106 if ( branchEdges[iB2].empty() || isBranchRemoved[iB2] || iB == iB2 )
1108 const TVDVertex* v02 = branchEdges[iB2][0]->vertex1();
1109 const TVDVertex* v12 = branchEdges[iB2].back()->vertex0();
1110 if ( v == v02 || v == v12 )
1112 if ( iBrToJoin > 0 )
1115 break; // more than 2 not removed branches meat at a TVDVertex
1120 if ( iBrToJoin > 0 )
1122 vector<const TVDEdge*>& branch = branchEdges[ iBrToJoin ];
1123 const TVDVertex* v02 = branch[0]->vertex1();
1124 const TVDVertex* v12 = branch.back()->vertex0();
1125 updateJoinedBranch( branch, iB, bndSegsPerEdge, /*reverse=*/(v0 == v02 || v1 == v12 ));
1126 if ( v0 == v02 || v0 == v12 )
1127 branchEdges[iB].insert( branchEdges[iB].begin(), branch.begin(), branch.end() );
1129 branchEdges[iB].insert( branchEdges[iB].end(), branch.begin(), branch.end() );
1133 } // loop on branchEdges
1134 } // if ( ignoreCorners )
1136 // associate branchIDs and the input branch vector (arg)
1137 vector< SMESH_MAT2d::Branch* > branchByID( branchEdges.size(), 0 );
1139 for ( size_t i = 0; i < branchEdges.size(); ++i )
1141 nbBranches += ( !branchEdges[i].empty() );
1143 branch.resize( nbBranches );
1145 for ( size_t brID = 1; brID < branchEdges.size(); ++brID ) // 1st - not removed
1147 if ( !branchEdges[ brID ].empty() && !isBranchRemoved[ brID ])
1148 branchByID[ brID ] = & branch[ iBr++ ];
1150 for ( size_t brID = 1; brID < branchEdges.size(); ++brID ) // then - removed
1152 if ( !branchEdges[ brID ].empty() && isBranchRemoved[ brID ])
1153 branchByID[ brID ] = & branch[ iBr++ ];
1156 // Fill in BndPoints of each EDGE of the boundary
1159 int edgeInd = -1, dInd = 0;
1160 for ( size_t iE = 0; iE < bndSegsPerEdge.size(); ++iE )
1162 vector< BndSeg >& bndSegs = bndSegsPerEdge[ iE ];
1163 SMESH_MAT2d::BndPoints & bndPoints = boundary.getPoints( iE );
1165 // make TVDEdge know an index of bndSegs within BndPoints
1166 for ( size_t i = 0; i < bndSegs.size(); ++i )
1167 if ( bndSegs[i]._edge )
1168 SMESH_MAT2d::Branch::setBndSegment( i, bndSegs[i]._edge );
1170 // parameters on EDGE
1172 bndPoints._params.reserve( bndSegs.size() + 1 );
1173 bndPoints._params.push_back( bndSegs[ 0 ]._inSeg->_p0->_param );
1175 for ( size_t i = 0; i < bndSegs.size(); ++i )
1176 bndPoints._params.push_back( bndSegs[ i ]._uLast );
1180 bndPoints._maEdges.reserve( bndSegs.size() );
1182 for ( size_t i = 0; i < bndSegs.size(); ++i )
1184 const size_t brID = bndSegs[ i ].branchID();
1185 const SMESH_MAT2d::Branch* br = branchByID[ brID ];
1187 if ( bndSegs[ i ]._edge && !branchEdges[ brID ].empty() )
1191 if (( edgeInd < 0 ||
1192 edgeInd >= (int) branchEdges[ brID ].size() ) ||
1193 ( branchEdges[ brID ][ edgeInd ] != bndSegs[ i ]._edge &&
1194 branchEdges[ brID ][ edgeInd ]->twin() != bndSegs[ i ]._edge ))
1196 if ( bndSegs[ i ]._branchID < 0 )
1199 for ( edgeInd = branchEdges[ brID ].size() - 1; edgeInd > 0; --edgeInd )
1200 if ( branchEdges[ brID ][ edgeInd ]->twin() == bndSegs[ i ]._edge )
1203 else // bndSegs[ i ]._branchID > 0
1206 for ( edgeInd = 0; edgeInd < branchEdges[ brID ].size(); ++edgeInd )
1207 if ( branchEdges[ brID ][ edgeInd ] == bndSegs[ i ]._edge )
1214 // no MA edge, bndSeg corresponds to an end point of a branch
1215 if ( bndPoints._maEdges.empty() )
1218 edgeInd = branchEdges[ brID ].size();
1219 dInd = bndSegs[ i ]._branchID > 0 ? +1 : -1;
1222 bndPoints._maEdges.push_back( make_pair( br, ( 1 + edgeInd ) * dInd ));
1224 } // loop on bndSegs of an EDGE
1225 } // loop on all bndSegs to construct Boundary
1227 // Initialize branches
1229 // find a not removed branch
1230 size_t iBrNorRemoved = 0;
1231 for ( size_t brID = 1; brID < branchEdges.size(); ++brID )
1232 if ( !branchEdges[brID].empty() && !isBranchRemoved[brID] )
1234 iBrNorRemoved = brID;
1237 // fill the branches with MA edges
1238 for ( size_t brID = 1; brID < branchEdges.size(); ++brID )
1239 if ( !branchEdges[brID].empty() )
1241 branchByID[ brID ]->init( branchEdges[brID], & boundary, endType );
1243 // mark removed branches
1244 for ( size_t brID = 1; brID < branchEdges.size(); ++brID )
1245 if ( isBranchRemoved[brID] && iBrNorRemoved > 0 )
1247 SMESH_MAT2d::Branch* branch = branchByID[ brID ];
1248 SMESH_MAT2d::Branch* mainBranch = branchByID[ iBrNorRemoved ];
1249 bool is1stBrPnt = ( branch->getEnd(0)->_type == SMESH_MAT2d::BE_BRANCH_POINT );
1250 const TVDVertex* branchVextex =
1251 is1stBrPnt ? branch->getEnd(0)->_vertex : branch->getEnd(1)->_vertex;
1252 SMESH_MAT2d::BranchPoint bp = mainBranch->getPoint( branchVextex );
1253 branch->setRemoved( bp );
1255 // set branches to branch ends
1256 for ( size_t i = 0; i < branch.size(); ++i )
1257 if ( !branch[i].isRemoved() )
1258 branch[i].setBranchesToEnds( branch );
1260 // fill branchPnt arg
1261 map< const TVDVertex*, const SMESH_MAT2d::BranchEnd* > v2end;
1262 for ( size_t i = 0; i < branch.size(); ++i )
1264 if ( branch[i].getEnd(0)->_branches.size() > 2 )
1265 v2end.insert( make_pair( branch[i].getEnd(0)->_vertex, branch[i].getEnd(0) ));
1266 if ( branch[i].getEnd(1)->_branches.size() > 2 )
1267 v2end.insert( make_pair( branch[i].getEnd(1)->_vertex, branch[i].getEnd(1) ));
1269 branchPnt.resize( v2end.size() );
1270 map< const TVDVertex*, const SMESH_MAT2d::BranchEnd* >::iterator v2e = v2end.begin();
1271 for ( size_t i = 0; v2e != v2end.end(); ++v2e, ++i )
1272 branchPnt[ i ] = v2e->second;
1278 //================================================================================
1280 * \brief MedialAxis constructor
1281 * \param [in] face - a face to create MA for
1282 * \param [in] edges - edges of the face (possibly not all) on the order they
1283 * encounter in the face boundary.
1284 * \param [in] minSegLen - minimal length of a mesh segment used to discretize
1285 * the edges. It is used to define precision of MA approximation
1287 //================================================================================
1289 SMESH_MAT2d::MedialAxis::MedialAxis(const TopoDS_Face& face,
1290 const std::vector< TopoDS_Edge >& edges,
1291 const double minSegLen,
1292 const bool ignoreCorners):
1293 _face( face ), _boundary( edges.size() )
1295 // input to construct_voronoi()
1296 vector< InPoint > inPoints;
1297 vector< InSegment> inSegments;
1298 if ( !makeInputData( face, edges, minSegLen, inPoints, inSegments, _scale ))
1301 inSegmentsToFile( inSegments );
1303 // build voronoi diagram
1304 construct_voronoi( inSegments.begin(), inSegments.end(), &_vd );
1307 makeMA( _vd, ignoreCorners, inPoints, inSegments, _branch, _branchPnt, _boundary );
1309 // count valid branches
1310 _nbBranches = _branch.size();
1311 for ( size_t i = 0; i < _branch.size(); ++i )
1312 if ( _branch[i].isRemoved() )
1316 //================================================================================
1318 * \brief Returns the i-th branch
1320 //================================================================================
1322 const SMESH_MAT2d::Branch* SMESH_MAT2d::MedialAxis::getBranch(size_t i) const
1324 return i < _nbBranches ? &_branch[i] : 0;
1327 //================================================================================
1329 * \brief Return UVs of ends of MA edges of a branch
1331 //================================================================================
1333 void SMESH_MAT2d::MedialAxis::getPoints( const Branch* branch,
1334 std::vector< gp_XY >& points) const
1336 branch->getPoints( points, _scale );
1339 //================================================================================
1341 * \brief Returns a BranchPoint corresponding to a given point on a geom EDGE
1342 * \param [in] iEdge - index of geom EDGE within a vector passed at MA construction
1343 * \param [in] u - parameter of the point on EDGE curve
1344 * \param [out] p - the found BranchPoint
1345 * \return bool - is OK
1347 //================================================================================
1349 bool SMESH_MAT2d::Boundary::getBranchPoint( const std::size_t iEdge,
1351 BranchPoint& p ) const
1353 if ( iEdge >= _pointsPerEdge.size() || _pointsPerEdge[iEdge]._params.empty() )
1356 const BndPoints& points = _pointsPerEdge[ iEdge ];
1357 const bool edgeReverse = ( points._params[0] > points._params.back() );
1359 if ( u < ( edgeReverse ? points._params.back() : points._params[0] ))
1360 u = edgeReverse ? points._params.back() : points._params[0];
1361 else if ( u > ( edgeReverse ? points._params[0] : points._params.back()) )
1362 u = edgeReverse ? points._params[0] : points._params.back();
1364 double r = ( u - points._params[0] ) / ( points._params.back() - points._params[0] );
1365 int i = int( r * double( points._maEdges.size()-1 ));
1368 while ( points._params[i ] < u ) --i;
1369 while ( points._params[i+1] > u ) ++i;
1373 while ( points._params[i ] > u ) --i;
1374 while ( points._params[i+1] < u ) ++i;
1377 double edgeParam = ( u - points._params[i] ) / ( points._params[i+1] - points._params[i] );
1379 if ( !points._maEdges[ i ].second ) // no branch at the EDGE end, look for a closest branch
1381 if ( i < points._maEdges.size() / 2 ) // near 1st point
1383 while ( i < points._maEdges.size()-1 && !points._maEdges[ i ].second )
1385 edgeParam = edgeReverse;
1387 else // near last point
1389 while ( i > 0 && !points._maEdges[ i ].second )
1391 edgeParam = !edgeReverse;
1394 const std::pair< const Branch*, int >& maE = points._maEdges[ i ];
1395 bool maReverse = ( maE.second < 0 );
1397 p._branch = maE.first;
1398 p._iEdge = ( maReverse ? -maE.second : maE.second ) - 1; // countered from 1 to store sign
1399 p._edgeParam = ( maE.first && maReverse ) ? ( 1. - edgeParam ) : edgeParam;
1404 //================================================================================
1406 * \brief Returns a BranchPoint corresponding to a given BoundaryPoint on a geom EDGE
1407 * \param [in] bp - the BoundaryPoint
1408 * \param [out] p - the found BranchPoint
1409 * \return bool - is OK
1411 //================================================================================
1413 bool SMESH_MAT2d::Boundary::getBranchPoint( const BoundaryPoint& bp,
1414 BranchPoint& p ) const
1416 return getBranchPoint( bp._edgeIndex, bp._param, p );
1419 //================================================================================
1421 * \brief Check if a given boundary segment is a null-length segment on a concave
1423 * \param [in] iEdge - index of a geom EDGE
1424 * \param [in] iSeg - index of a boundary segment
1425 * \return bool - true if the segment is on concave corner
1427 //================================================================================
1429 bool SMESH_MAT2d::Boundary::isConcaveSegment( std::size_t iEdge, std::size_t iSeg ) const
1431 if ( iEdge >= _pointsPerEdge.size() || _pointsPerEdge[iEdge]._params.empty() )
1434 const BndPoints& points = _pointsPerEdge[ iEdge ];
1435 if ( points._params.size() <= iSeg+1 )
1438 return Abs( points._params[ iSeg ] - points._params[ iSeg+1 ]) < 1e-20;
1441 //================================================================================
1443 * \brief Moves (changes _param) a given BoundaryPoint to a closest EDGE end
1445 //================================================================================
1447 bool SMESH_MAT2d::Boundary::moveToClosestEdgeEnd( BoundaryPoint& bp ) const
1449 if ( bp._edgeIndex >= _pointsPerEdge.size() )
1452 const BndPoints& points = _pointsPerEdge[ bp._edgeIndex ];
1453 if ( Abs( bp._param - points._params[0]) < Abs( points._params.back() - bp._param ))
1454 bp._param = points._params[0];
1456 bp._param = points._params.back();
1461 //================================================================================
1463 * \brief Creates a 3d curve corresponding to a Branch
1464 * \param [in] branch - the Branch
1465 * \return Adaptor3d_Curve* - the new curve the caller is to delete
1467 //================================================================================
1469 Adaptor3d_Curve* SMESH_MAT2d::MedialAxis::make3DCurve(const Branch& branch) const
1471 Handle(Geom_Surface) surface = BRep_Tool::Surface( _face );
1472 if ( surface.IsNull() )
1476 branch.getPoints( uv, _scale );
1477 if ( uv.size() < 2 )
1480 vector< TopoDS_Vertex > vertex( uv.size() );
1481 for ( size_t i = 0; i < uv.size(); ++i )
1482 vertex[i] = BRepBuilderAPI_MakeVertex( surface->Value( uv[i].X(), uv[i].Y() ));
1485 BRep_Builder aBuilder;
1486 aBuilder.MakeWire(aWire);
1487 for ( size_t i = 1; i < vertex.size(); ++i )
1489 TopoDS_Edge edge = BRepBuilderAPI_MakeEdge( vertex[i-1], vertex[i] );
1490 aBuilder.Add( aWire, edge );
1493 // if ( myEdge.size() == 2 && FirstVertex().IsSame( LastVertex() ))
1494 // aWire.Closed(true); // issue 0021141
1496 return new BRepAdaptor_CompCurve( aWire );
1499 //================================================================================
1501 * \brief Copy points of an EDGE
1503 //================================================================================
1505 void SMESH_MAT2d::Branch::init( vector<const TVDEdge*>& maEdges,
1506 const Boundary* boundary,
1507 map< const TVDVertex*, BranchEndType > endType )
1509 if ( maEdges.empty() ) return;
1511 _boundary = boundary;
1512 _maEdges.swap( maEdges );
1515 _params.reserve( _maEdges.size() + 1 );
1516 _params.push_back( 0. );
1517 for ( size_t i = 0; i < _maEdges.size(); ++i )
1518 _params.push_back( _params.back() + length( _maEdges[i] ));
1520 for ( size_t i = 1; i < _params.size(); ++i )
1521 _params[i] /= _params.back();
1524 _endPoint1._vertex = _maEdges.front()->vertex1();
1525 _endPoint2._vertex = _maEdges.back ()->vertex0();
1527 if ( endType.count( _endPoint1._vertex ))
1528 _endPoint1._type = endType[ _endPoint1._vertex ];
1529 if ( endType.count( _endPoint2._vertex ))
1530 _endPoint2._type = endType[ _endPoint2._vertex ];
1533 //================================================================================
1535 * \brief fills BranchEnd::_branches of its ends
1537 //================================================================================
1539 void SMESH_MAT2d::Branch::setBranchesToEnds( const vector< Branch >& branches )
1541 for ( size_t i = 0; i < branches.size(); ++i )
1543 if ( this->_endPoint1._vertex == branches[i]._endPoint1._vertex ||
1544 this->_endPoint1._vertex == branches[i]._endPoint2._vertex )
1545 this->_endPoint1._branches.push_back( &branches[i] );
1547 if ( this->_endPoint2._vertex == branches[i]._endPoint1._vertex ||
1548 this->_endPoint2._vertex == branches[i]._endPoint2._vertex )
1549 this->_endPoint2._branches.push_back( &branches[i] );
1553 //================================================================================
1555 * \brief returns a BranchPoint corresponding to a TVDVertex
1557 //================================================================================
1559 SMESH_MAT2d::BranchPoint SMESH_MAT2d::Branch::getPoint( const TVDVertex* vertex ) const
1565 if ( vertex == _maEdges[0]->vertex1() )
1571 for ( ; p._iEdge < _maEdges.size(); ++p._iEdge )
1572 if ( vertex == _maEdges[ p._iEdge ]->vertex0() )
1574 p._edgeParam = _params[ p._iEdge ];
1581 //================================================================================
1583 * \brief Sets a proxy point for a removed branch
1584 * \param [in] proxyPoint - a point of another branch to which all points of this
1587 //================================================================================
1589 void SMESH_MAT2d::Branch::setRemoved( const BranchPoint& proxyPoint )
1591 _proxyPoint = proxyPoint;
1594 //================================================================================
1596 * \brief Returns points on two EDGEs, equidistant from a given point of this Branch
1597 * \param [in] param - [0;1] normalized param on the Branch
1598 * \param [out] bp1 - BoundaryPoint on EDGE with a lower index
1599 * \param [out] bp2 - BoundaryPoint on EDGE with a higher index
1600 * \return bool - true if the BoundaryPoint's found
1602 //================================================================================
1604 bool SMESH_MAT2d::Branch::getBoundaryPoints(double param,
1606 BoundaryPoint& bp2 ) const
1608 if ( param < _params[0] || param > _params.back() )
1611 // look for an index of a MA edge by param
1612 double ip = param * _params.size();
1613 size_t i = size_t( Min( int( _maEdges.size()-1), int( ip )));
1615 while ( param < _params[i ] ) --i;
1616 while ( param > _params[i+1] ) ++i;
1618 double r = ( param - _params[i] ) / ( _params[i+1] - _params[i] );
1620 return getBoundaryPoints( i, r, bp1, bp2 );
1623 //================================================================================
1625 * \brief Returns points on two EDGEs, equidistant from a given point of this Branch
1626 * \param [in] iMAEdge - index of a MA edge within this Branch
1627 * \param [in] maEdgeParam - [0;1] normalized param on the \a iMAEdge
1628 * \param [out] bp1 - BoundaryPoint on EDGE with a lower index
1629 * \param [out] bp2 - BoundaryPoint on EDGE with a higher index
1630 * \return bool - true if the BoundaryPoint's found
1632 //================================================================================
1634 bool SMESH_MAT2d::Branch::getBoundaryPoints(std::size_t iMAEdge,
1637 BoundaryPoint& bp2 ) const
1640 return _proxyPoint._branch->getBoundaryPoints( _proxyPoint, bp1, bp2 );
1642 if ( iMAEdge > _maEdges.size() )
1644 if ( iMAEdge == _maEdges.size() )
1645 iMAEdge = _maEdges.size() - 1;
1647 size_t iGeom1 = getGeomEdge( _maEdges[ iMAEdge ] );
1648 size_t iGeom2 = getGeomEdge( _maEdges[ iMAEdge ]->twin() );
1649 size_t iSeg1 = getBndSegment( _maEdges[ iMAEdge ] );
1650 size_t iSeg2 = getBndSegment( _maEdges[ iMAEdge ]->twin() );
1652 return ( _boundary->getPoint( iGeom1, iSeg1, maEdgeParam, bp1 ) &&
1653 _boundary->getPoint( iGeom2, iSeg2, maEdgeParam, bp2 ));
1656 //================================================================================
1658 * \brief Returns points on two EDGEs, equidistant from a given point of this Branch
1660 //================================================================================
1662 bool SMESH_MAT2d::Branch::getBoundaryPoints(const BranchPoint& p,
1664 BoundaryPoint& bp2 ) const
1666 return ( p._branch ? p._branch : this )->getBoundaryPoints( p._iEdge, p._edgeParam, bp1, bp2 );
1669 //================================================================================
1671 * \brief Return a parameter of a BranchPoint normalized within this Branch
1673 //================================================================================
1675 bool SMESH_MAT2d::Branch::getParameter(const BranchPoint & p, double & u ) const
1677 if ( this != p._branch && p._branch )
1678 return p._branch->getParameter( p, u );
1681 return _proxyPoint._branch->getParameter( _proxyPoint, u );
1683 if ( p._iEdge > _params.size()-1 )
1685 if ( p._iEdge == _params.size()-1 )
1688 u = ( _params[ p._iEdge ] * ( 1 - p._edgeParam ) +
1689 _params[ p._iEdge+1 ] * p._edgeParam );
1694 //================================================================================
1696 * \brief Check type of both ends
1698 //================================================================================
1700 bool SMESH_MAT2d::Branch::hasEndOfType(BranchEndType type) const
1702 return ( _endPoint1._type == type || _endPoint2._type == type );
1705 //================================================================================
1707 * \brief Returns MA points
1708 * \param [out] points - the 2d points
1709 * \param [in] scale - the scale that was used to scale the 2d space of MA
1711 //================================================================================
1713 void SMESH_MAT2d::Branch::getPoints( std::vector< gp_XY >& points,
1714 const double scale[2]) const
1716 points.resize( _maEdges.size() + 1 );
1718 points[0].SetCoord( _maEdges[0]->vertex1()->x() / scale[0], // CCW order! -> vertex1 not vertex0
1719 _maEdges[0]->vertex1()->y() / scale[1] );
1721 for ( size_t i = 0; i < _maEdges.size(); ++i )
1722 points[i+1].SetCoord( _maEdges[i]->vertex0()->x() / scale[0],
1723 _maEdges[i]->vertex0()->y() / scale[1] );
1726 //================================================================================
1728 * \brief Return indices of EDGEs equidistant from this branch
1730 //================================================================================
1732 void SMESH_MAT2d::Branch::getGeomEdges( std::vector< std::size_t >& edgeIDs1,
1733 std::vector< std::size_t >& edgeIDs2 ) const
1735 edgeIDs1.push_back( getGeomEdge( _maEdges[0] ));
1736 edgeIDs2.push_back( getGeomEdge( _maEdges[0]->twin() ));
1738 for ( size_t i = 1; i < _maEdges.size(); ++i )
1740 size_t ie1 = getGeomEdge( _maEdges[i] );
1741 size_t ie2 = getGeomEdge( _maEdges[i]->twin() );
1743 if ( edgeIDs1.back() != ie1 ) edgeIDs1.push_back( ie1 );
1744 if ( edgeIDs2.back() != ie2 ) edgeIDs2.push_back( ie2 );
1748 //================================================================================
1750 * \brief Looks for a BranchPoint position around a concave VERTEX
1752 //================================================================================
1754 bool SMESH_MAT2d::Branch::addDivPntForConcaVertex( std::vector< std::size_t >& edgeIDs1,
1755 std::vector< std::size_t >& edgeIDs2,
1756 std::vector< BranchPoint >& divPoints,
1757 const vector<const TVDEdge*>& maEdges,
1758 const vector<const TVDEdge*>& maEdgesTwin,
1761 // if there is a concave vertex between EDGEs
1762 // then position of a dividing BranchPoint is undefined, it is somewhere
1763 // on an arc-shaped part of the Branch around the concave vertex.
1764 // Chose this position by a VERTEX of the opposite EDGE, or put it in the middle
1765 // of the arc if there is no opposite VERTEX.
1766 // All null-length segments around a VERTEX belong to one of EDGEs.
1768 BranchPoint divisionPnt;
1769 divisionPnt._branch = this;
1771 BranchIterator iCur( maEdges, i );
1773 size_t ie1 = getGeomEdge( maEdges [i] );
1774 size_t ie2 = getGeomEdge( maEdgesTwin[i] );
1776 size_t iSeg1 = getBndSegment( iCur.edgePrev() );
1777 size_t iSeg2 = getBndSegment( iCur.edge() );
1778 bool isConcaPrev = _boundary->isConcaveSegment( edgeIDs1.back(), iSeg1 );
1779 bool isConcaNext = _boundary->isConcaveSegment( ie1, iSeg2 );
1780 if ( !isConcaNext && !isConcaPrev )
1783 bool isConcaveV = false;
1786 BranchIterator iPrev( maEdges, i ), iNext( maEdges, i );
1788 if ( isConcaNext ) // all null-length segments follow
1790 // look for a VERTEX of the opposite EDGE
1791 // iNext - next after all null-length segments
1792 while ( maE = ++iNext )
1794 iSeg2 = getBndSegment( maE );
1795 if ( !_boundary->isConcaveSegment( ie1, iSeg2 ))
1798 bool vertexFound = false;
1799 for ( ++iCur; iCur < iNext; ++iCur )
1801 ie2 = getGeomEdge( maEdgesTwin[ iCur.indexMod() ] );
1802 if ( ie2 != edgeIDs2.back() )
1804 // opposite VERTEX found
1805 divisionPnt._iEdge = iCur.indexMod();
1806 divisionPnt._edgeParam = 0;
1807 divPoints.push_back( divisionPnt );
1808 edgeIDs1.push_back( ie1 );
1809 edgeIDs2.push_back( ie2 );
1816 iPrev = iNext; // not to add a BP in the moddle
1817 i = iNext.indexMod();
1821 else if ( isConcaPrev )
1823 // all null-length segments passed, find their beginning
1824 while ( maE = iPrev.edgePrev() )
1826 iSeg1 = getBndSegment( maE );
1827 if ( _boundary->isConcaveSegment( edgeIDs1.back(), iSeg1 ))
1834 if ( iPrev.index() < i-1 || iNext.index() > i )
1836 // no VERTEX on the opposite EDGE, put the Branch Point in the middle
1837 divisionPnt._iEdge = iPrev.indexMod();
1839 double par1 = _params[ iPrev.indexMod() ], par2 = _params[ iNext.indexMod() ];
1840 double midPar = 0.5 * ( par1 + par2 );
1841 for ( ; _params[ iPrev.indexMod() ] < midPar; ++iPrev )
1842 divisionPnt._iEdge = iPrev.indexMod();
1843 divisionPnt._edgeParam =
1844 ( _params[ iPrev.indexMod() ] - midPar ) /
1845 ( _params[ iPrev.indexMod() ] - _params[ divisionPnt._iEdge ] );
1846 divPoints.push_back( divisionPnt );
1853 //================================================================================
1855 * \brief Return indices of opposite parts of EDGEs equidistant from this branch
1856 * \param [out] edgeIDs1 - EDGE index opposite to the edgeIDs2[i]-th EDGE
1857 * \param [out] edgeIDs2 - EDGE index opposite to the edgeIDs1[i]-th EDGE
1858 * \param [out] divPoints - BranchPoint's located between two successive unique
1859 * pairs of EDGE indices. A \a divPoints[i] can separate e.g. two following pairs
1860 * of EDGE indices < 0, 2 > and < 0, 1 >. Number of \a divPoints is one less
1861 * than number of \a edgeIDs
1863 //================================================================================
1865 void SMESH_MAT2d::Branch::getOppositeGeomEdges( std::vector< std::size_t >& edgeIDs1,
1866 std::vector< std::size_t >& edgeIDs2,
1867 std::vector< BranchPoint >& divPoints) const
1873 std::vector<const TVDEdge*> twins( _maEdges.size() );
1874 for ( size_t i = 0; i < _maEdges.size(); ++i )
1875 twins[i] = _maEdges[i]->twin();
1877 BranchIterator maIter ( _maEdges, 0 );
1878 BranchIterator twIter ( twins, 0 );
1879 // size_t lastConcaE1 = _boundary.nbEdges();
1880 // size_t lastConcaE2 = _boundary.nbEdges();
1882 // if ( maIter._closed ) // closed branch
1884 // edgeIDs1.push_back( getGeomEdge( _maEdges.back() ));
1885 // edgeIDs2.push_back( getGeomEdge( _maEdges.back()->twin() ));
1889 edgeIDs1.push_back( getGeomEdge( maIter.edge() ));
1890 edgeIDs2.push_back( getGeomEdge( twIter.edge() ));
1893 BranchPoint divisionPnt;
1894 divisionPnt._branch = this;
1896 for ( ++maIter, ++twIter; maIter.index() < _maEdges.size(); ++maIter, ++twIter )
1898 size_t ie1 = getGeomEdge( maIter.edge() );
1899 size_t ie2 = getGeomEdge( twIter.edge() );
1901 bool otherE1 = ( edgeIDs1.back() != ie1 );
1902 bool otherE2 = ( edgeIDs2.back() != ie2 );
1904 if ( !otherE1 && !otherE2 && maIter._closed )
1906 int iSegPrev1 = getBndSegment( maIter.edgePrev() );
1907 int iSegCur1 = getBndSegment( maIter.edge() );
1908 otherE1 = Abs( iSegPrev1 - iSegCur1 ) != 1;
1909 int iSegPrev2 = getBndSegment( twIter.edgePrev() );
1910 int iSegCur2 = getBndSegment( twIter.edge() );
1911 otherE2 = Abs( iSegPrev2 - iSegCur2 ) != 1;
1914 if ( otherE1 || otherE2 )
1916 bool isConcaveV = false;
1917 if ( otherE1 && !otherE2 )
1919 isConcaveV = addDivPntForConcaVertex( edgeIDs1, edgeIDs2, divPoints,
1920 _maEdges, twins, maIter._i );
1922 if ( !otherE1 && otherE2 )
1924 isConcaveV = addDivPntForConcaVertex( edgeIDs2, edgeIDs1, divPoints,
1925 twins, _maEdges, maIter._i );
1930 ie1 = getGeomEdge( maIter.edge() );
1931 ie2 = getGeomEdge( twIter.edge() );
1933 if ( !isConcaveV || otherE1 || otherE2 )
1935 edgeIDs1.push_back( ie1 );
1936 edgeIDs2.push_back( ie2 );
1938 if ( divPoints.size() < edgeIDs1.size() - 1 )
1940 divisionPnt._iEdge = maIter.index();
1941 divisionPnt._edgeParam = 0;
1942 divPoints.push_back( divisionPnt );
1945 } // if ( edgeIDs1.back() != ie1 || edgeIDs2.back() != ie2 )
1946 } // loop on _maEdges
1949 //================================================================================
1951 * \brief Store data of boundary segments in TVDEdge
1953 //================================================================================
1955 void SMESH_MAT2d::Branch::setGeomEdge( std::size_t geomIndex, const TVDEdge* maEdge )
1957 if ( maEdge ) maEdge->cell()->color( geomIndex );
1959 std::size_t SMESH_MAT2d::Branch::getGeomEdge( const TVDEdge* maEdge )
1961 return maEdge ? maEdge->cell()->color() : std::string::npos;
1963 void SMESH_MAT2d::Branch::setBndSegment( std::size_t segIndex, const TVDEdge* maEdge )
1965 if ( maEdge ) maEdge->color( segIndex );
1967 std::size_t SMESH_MAT2d::Branch::getBndSegment( const TVDEdge* maEdge )
1969 return maEdge ? maEdge->color() : std::string::npos;
1972 //================================================================================
1974 * \brief Returns a boundary point on a given EDGE
1975 * \param [in] iEdge - index of the EDGE within MedialAxis
1976 * \param [in] iSeg - index of a boundary segment within this Branch
1977 * \param [in] u - [0;1] normalized param within \a iSeg-th segment
1978 * \param [out] bp - the found BoundaryPoint
1979 * \return bool - true if the BoundaryPoint is found
1981 //================================================================================
1983 bool SMESH_MAT2d::Boundary::getPoint( std::size_t iEdge,
1986 BoundaryPoint& bp ) const
1988 if ( iEdge >= _pointsPerEdge.size() )
1990 if ( iSeg+1 >= _pointsPerEdge[ iEdge ]._params.size() )
1993 // This method is called by Branch that can have an opposite orientation,
1994 // hence u is inverted depending on orientation coded as a sign of _maEdge index
1995 bool isReverse = ( _pointsPerEdge[ iEdge ]._maEdges[ iSeg ].second < 0 );
1999 double p0 = _pointsPerEdge[ iEdge ]._params[ iSeg ];
2000 double p1 = _pointsPerEdge[ iEdge ]._params[ iSeg+1 ];
2002 bp._param = p0 * ( 1. - u ) + p1 * u;
2003 bp._edgeIndex = iEdge;