1 // Copyright (C) 2007-2016 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, or (at your option) any later version.
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
21 // File : BLSURFPlugin_Attractor.cxx
22 // Authors : Renaud Nédélec (OCC)
25 // The idea of the algorithm used to calculate the distance on a
26 // non-euclidian parametric surface has been found in the ref. below:
28 // Ref:"Accurate Anisotropic Fast Marching for Diffusion-Based Geodesic Tractography"
29 // S. Jbabdi, P. Bellec, R. Toro, Daunizeau, M. Pélégrini-Issac, and H. Benali1
32 #include "BLSURFPlugin_Attractor.hxx"
33 #include <utilities.h>
38 #include <ShapeAnalysis.hxx>
39 #include <ShapeConstruct_ProjectCurveOnSurface.hxx>
40 #include <Precision.hxx>
41 #include <GeomLib_IsPlanarSurface.hxx>
44 #include <Basics_OCCTVersion.hxx>
46 BLSURFPlugin_Attractor::BLSURFPlugin_Attractor ()
67 _isEmpty(true){ MESSAGE("construction of a void attractor"); }
69 BLSURFPlugin_Attractor::BLSURFPlugin_Attractor (const TopoDS_Face& Face, const TopoDS_Shape& Attractor, const std::string& attEntry)
93 _attractorShape = Attractor;
98 bool BLSURFPlugin_Attractor::init(){
103 Handle(Geom_Surface) aSurf = BRep_Tool::Surface(_face);
105 _distance = &BLSURFPlugin_Attractor::_distanceFromMap;
107 if ( GeomLib_IsPlanarSurface( aSurf ).IsPlanar() &&
108 _attractorShape.ShapeType() == TopAbs_VERTEX )
110 // a specific case, the map is not needed
111 gp_Pnt P = BRep_Tool::Pnt( TopoDS::Vertex( _attractorShape ));
112 GeomAPI_ProjectPointOnSurf projector( P, aSurf );
113 if ( projector.IsDone() && projector.NbPoints() == 1 )
115 projector.LowerDistanceParameters(u0,v0);
117 _attractorPnt = aSurf->Value( u0,v0 );
119 _distance = &BLSURFPlugin_Attractor::_distanceFromPoint;
126 // Calculation of the bounds of the face
127 ShapeAnalysis::GetFaceUVBounds(_face,_u1,_u2,_v1,_v2);
132 for (i=0; i<=_gridU; i++){
133 _vectU.push_back(_u1+i*(_u2-_u1)/_gridU) ;
135 for (j=0; j<=_gridV; j++){
136 _vectV.push_back(_v1+j*(_v2-_v1)/_gridV) ;
139 // Initialization of _DMap and _known
140 std::vector<double> temp(_gridV+1,std::numeric_limits<double>::infinity()); // Set distance of all "far" points to Infinity
141 for (i=0; i<=_gridU; i++){
142 _DMap.push_back(temp);
144 std::vector<bool> temp2(_gridV+1,false);
145 for (i=0; i<=_gridU; i++){
146 _known.push_back(temp2);
150 // Determination of the starting points
151 TopExp_Explorer anEdgeExp(_attractorShape, TopAbs_EDGE, TopAbs_FACE);
152 TopExp_Explorer aVertExp(_attractorShape, TopAbs_VERTEX, TopAbs_EDGE);
154 for(; anEdgeExp.More(); anEdgeExp.Next()){
155 const TopoDS_Edge& anEdge = TopoDS::Edge(anEdgeExp.Current());
156 edgeInit(aSurf, anEdge);
159 for(; aVertExp.More(); aVertExp.Next()){
160 const TopoDS_Vertex& aVertex = TopoDS::Vertex(aVertExp.Current());
162 gp_Pnt P = BRep_Tool::Pnt(aVertex);
163 GeomAPI_ProjectPointOnSurf projector( P, aSurf );
164 projector.LowerDistanceParameters(u0,v0);
165 i0 = floor ( (u0 - _u1) * _gridU / (_u2 - _u1) + 0.5 );
166 j0 = floor ( (v0 - _v1) * _gridV / (_v2 - _v1) + 0.5 );
167 TPnt[0]=0.; // Set the distance of the starting point to 0.
171 _trial.insert(TPnt); // Move starting point to _trial
177 void BLSURFPlugin_Attractor::edgeInit(Handle(Geom_Surface) theSurf, const TopoDS_Edge& anEdge){
183 Handle(Geom2d_Curve) aCurve2d;
184 Handle(Geom_Curve) aCurve3d = BRep_Tool::Curve (anEdge, first, last);
185 ShapeConstruct_ProjectCurveOnSurface curveProjector;
186 curveProjector.Init(theSurf, Precision::Confusion());
187 #if OCC_VERSION_LARGE > 0x07010000
188 curveProjector.Perform (aCurve3d, first, last, aCurve2d);
190 curveProjector.PerformAdvanced (aCurve3d, first, last, aCurve2d);
194 for (i=0; i<=N; i++){
195 P2 = aCurve2d->Value(first + i * (last-first) / N);
196 i0 = floor( (P2.X() - _u1) * _gridU / (_u2 - _u1) + 0.5 );
197 j0 = floor( (P2.Y() - _v1) * _gridV / (_v2 - _v1) + 0.5 );
207 void BLSURFPlugin_Attractor::SetParameters(double Start_Size, double End_Size, double Action_Radius, double Constant_Radius){
208 _startSize = Start_Size;
210 _actionRadius = Action_Radius;
211 _constantRadius = Constant_Radius;
214 double BLSURFPlugin_Attractor::_distanceFromPoint(double u, double v)
216 return _attractorPnt.Distance( _plane->Value( u, v ));
219 double BLSURFPlugin_Attractor::_distanceFromMap(double u, double v){
221 // MG-CADSurf seems to perform a linear interpolation so it's sufficient to give it a non-continuous distance map
222 int i = floor ( (u - _u1) * _gridU / (_u2 - _u1) + 0.5 );
223 int j = floor ( (v - _v1) * _gridV / (_v2 - _v1) + 0.5 );
225 // avoid out of bounds of _DMap
226 if (i > _DMap.size())
232 if (j > _DMap[i].size())
233 j = _DMap[i].size()-1;
241 double BLSURFPlugin_Attractor::GetSize(double u, double v)
243 const double attrDist = (this->*_distance)(u,v);
244 const double myDist = 0.5 * (attrDist - _constantRadius + fabs(attrDist - _constantRadius));
248 if (fabs(_actionRadius) <= std::numeric_limits<double>::epsilon()){
249 if (myDist <= std::numeric_limits<double>::epsilon()){
257 return _endSize - (_endSize - _startSize) * exp(- myDist * myDist / (_actionRadius * _actionRadius) );
261 return _startSize + ( 0.5 * (attrDist - _constantRadius + fabs(attrDist - _constantRadius)) ) ;
268 void BLSURFPlugin_Attractor::BuildMap() {
270 MESSAGE("building the map");
277 double Guu, Gvv, Guv; // Components of the local metric tensor
282 IJ_Pnt Current_Pnt(2,0);
284 TTrialSet::iterator min;
285 TTrialSet::iterator found;
286 Handle(Geom_Surface) aSurf = BRep_Tool::Surface(_face);
288 // While there are points in "Trial" (representing a kind of advancing front), loop on them -----------------------------------------------------------
289 while (_trial.size() > 0 ) {
290 min = _trial.begin(); // Get trial point with min distance from start
293 _known[i0][j0] = true; // Move it to "Known"
294 _trial.erase(min); // Remove it from "Trial"
296 // Loop on neighbours of the trial min --------------------------------------------------------------------------------------------------------------
297 for (i=i0 - 1 ; i <= i0 + 1 ; i++){
298 if (!aSurf->IsUPeriodic()){ // Periodic conditions in U
304 ip = (i + _gridU + 1) % (_gridU+1); // We get a periodic index :
305 for (j=j0 - 1 ; j <= j0 + 1 ; j++){ // ip=modulo(i,N+2) so that i=-1->ip=N; i=0 -> ip=0 ; ... ; i=N+1 -> ip=0;
306 if (!aSurf->IsVPeriodic()){ // Periodic conditions in V .
313 jp = (j + _gridV + 1) % (_gridV+1);
315 if (!_known[ip][jp]){ // If the distance is not known yet
316 aSurf->D1(_vectU[ip],_vectV[jp],P,D1U,D1V); // Calculate the metric tensor at (i,j)
317 // G(i,j) = | ||dS/du||**2 * |
318 // | <dS/du,dS/dv> ||dS/dv||**2 |
319 Guu = D1U.X()*D1U.X() + D1U.Y()*D1U.Y() + D1U.Z()*D1U.Z(); // Guu = ||dS/du||**2
320 Gvv = D1V.X()*D1V.X() + D1V.Y()*D1V.Y() + D1V.Z()*D1V.Z(); // Gvv = ||dS/dv||**2
321 Guv = D1U.X()*D1V.X() + D1U.Y()*D1V.Y() + D1U.Z()*D1V.Z(); // Guv = Gvu = < dS/du,dS/dv >
322 D_Ref = _DMap[ip][jp]; // Set a ref. distance of the point to its value in _DMap
323 TPnt[0] = D_Ref; // (may be infinite or uncertain)
326 Dist_changed = false;
328 // Loop on neighbours to calculate the min distance from them ---------------------------------------------------------------------------------
329 for (k=i - 1 ; k <= i + 1 ; k++){
330 if (!aSurf->IsUPeriodic()){ // Periodic conditions in U
337 kp = (k + _gridU + 1) % (_gridU+1); // periodic index
338 for (n=j - 1 ; n <= j + 1 ; n++){
339 if (!aSurf->IsVPeriodic()){ // Periodic conditions in V
346 np = (n + _gridV + 1) % (_gridV+1);
347 if (_known[kp][np]){ // If the distance of the neighbour is known
348 // Calculate the distance from (k,n)
349 du = (k-i) * (_u2 - _u1) / _gridU;
350 dv = (n-j) * (_v2 - _v1) / _gridV;
351 Dist = _DMap[kp][np] + sqrt( Guu * du*du + 2*Guv * du*dv + Gvv * dv*dv ); // ds**2 = du'Gdu + 2*du'Gdv + dv'Gdv (G is always symetrical)
352 if (Dist < D_Ref) { // If smaller than ref. distance -> update ref. distance
358 } // End of the loop on neighbours --------------------------------------------------------------------------------------------------------------
360 if (Dist_changed) { // If distance has been updated, update _trial
361 found=_trial.find(TPnt);
362 if (found != _trial.end()){
363 _trial.erase(found); // Erase the point if it was already in _trial
368 _DMap[ip][jp] = D_Ref; // Set it distance to the minimum distance found during the loop above
369 _trial.insert(TPnt); // Insert it (or reinsert it) in _trial
371 } // end if (!_known[ip][jp])
378 } // end of BuildMap()