1 // Created by: Ekaterina SMIRNOVA
2 // Copyright (c) 2008-2014 OPEN CASCADE SAS
4 // This file is part of Open CASCADE Technology software library.
6 // This library is free software; you can redistribute it and/or modify it under
7 // the terms of the GNU Lesser General Public License version 2.1 as published
8 // by the Free Software Foundation, with special exception defined in the file
9 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
10 // distribution for complete text of the license and disclaimer of any warranty.
12 // Alternatively, this file may be used under the terms of Open CASCADE
13 // commercial license or contractual agreement.
15 #include <BRepMesh_FastDiscretFace.hxx>
17 #include <BRepMesh_PairOfPolygon.hxx>
18 #include <BRepMesh_ShapeTool.hxx>
19 #include <Poly_PolygonOnTriangulation.hxx>
20 #include <Poly_Triangulation.hxx>
22 #include <BRepAdaptor_Surface.hxx>
23 #include <BRepAdaptor_HSurface.hxx>
24 #include <BRepAdaptor_Curve.hxx>
25 #include <Adaptor3d_IsoCurve.hxx>
27 #include <BRep_ListIteratorOfListOfPointRepresentation.hxx>
28 #include <BRep_PointRepresentation.hxx>
29 #include <BRep_TVertex.hxx>
30 #include <BRep_Tool.hxx>
32 #include <GeomLib.hxx>
33 #include <Geom_Surface.hxx>
34 #include <Geom_BSplineSurface.hxx>
35 #include <GCPnts_TangentialDeflection.hxx>
36 #include <GCPnts_AbscissaPoint.hxx>
38 #include <Standard_ErrorHandler.hxx>
39 #include <Standard_Failure.hxx>
40 #include <SortTools_ShellSortOfReal.hxx>
41 #include <TCollection_CompareOfReal.hxx>
42 #include <TColStd_Array1OfReal.hxx>
43 #include <TColStd_ListOfInteger.hxx>
44 #include <TColStd_SequenceOfReal.hxx>
45 #include <TColStd_Array1OfInteger.hxx>
46 #include <TColStd_HArray1OfReal.hxx>
47 #include <TColgp_Array1OfPnt2d.hxx>
48 #include <TopTools_DataMapOfShapeReal.hxx>
50 #include <TopExp_Explorer.hxx>
52 #include <TopoDS_Vertex.hxx>
55 #include <NCollection_Map.hxx>
56 #include <Bnd_Box2d.hxx>
60 IMPLEMENT_STANDARD_HANDLE (BRepMesh_FastDiscretFace, Standard_Transient)
61 IMPLEMENT_STANDARD_RTTIEXT(BRepMesh_FastDiscretFace, Standard_Transient)
63 static Standard_Real FUN_CalcAverageDUV(TColStd_Array1OfReal& P, const Standard_Integer PLen)
65 Standard_Integer i, j, n = 0;
66 Standard_Real p, result = 0.;
68 for(i = 1; i <= PLen; i++)
71 for(j = i + 1; j <= PLen; j++)
83 p = Abs(P(i) - P(i-1));
91 return (n? (result / (Standard_Real) n) : -1.);
97 //! Auxiliary class used to extract geometrical parameters of fixed TopoDS_Vertex.
102 DEFINE_STANDARD_ALLOC
104 FixedVExplorer(const TopoDS_Vertex& theVertex)
105 : myVertex(theVertex)
109 const TopoDS_Vertex& Vertex() const
114 Standard_Boolean IsSameUV() const
116 return Standard_False;
119 TopoDS_Vertex SameVertex() const
121 return TopoDS_Vertex();
126 return BRep_Tool::Pnt(myVertex);
131 void operator =(const FixedVExplorer& /*theOther*/)
136 const TopoDS_Vertex& myVertex;
141 //=======================================================================
142 //function : BRepMesh_FastDiscretFace
144 //=======================================================================
145 BRepMesh_FastDiscretFace::BRepMesh_FastDiscretFace(
146 const Standard_Real theAngle,
147 const Standard_Real theMinSize,
148 const Standard_Boolean isInternalVerticesMode)
150 myInternalVerticesMode(isInternalVerticesMode),
151 myMinSize(theMinSize)
155 //=======================================================================
158 //=======================================================================
159 void BRepMesh_FastDiscretFace::Perform(const Handle(BRepMesh_FaceAttribute)& theAttribute)
162 commitSurfaceTriangulation();
165 //=======================================================================
166 //function : initDataStructure
168 //=======================================================================
169 void BRepMesh_FastDiscretFace::initDataStructure()
171 const Standard_Real aTolU = myAttribute->ToleranceU();
172 const Standard_Real aTolV = myAttribute->ToleranceV();
173 const Standard_Real uCellSize = 14.0 * aTolU;
174 const Standard_Real vCellSize = 14.0 * aTolV;
176 const Standard_Real deltaX = myAttribute->GetDeltaX();
177 const Standard_Real deltaY = myAttribute->GetDeltaY();
179 Handle(NCollection_IncAllocator) aAllocator =
180 new NCollection_IncAllocator(BRepMesh::MEMORY_BLOCK_SIZE_HUGE);
181 myStructure = new BRepMesh_DataStructureOfDelaun(aAllocator);
182 myStructure->Data()->SetCellSize ( uCellSize / deltaX, vCellSize / deltaY);
183 myStructure->Data()->SetTolerance( aTolU / deltaX, aTolV / deltaY);
185 myAttribute->ChangeStructure() = myStructure;
186 myAttribute->ChangeSurfacePoints() = new BRepMesh::DMapOfIntegerPnt;
187 myAttribute->ChangeSurfaceVertices()= new BRepMesh::DMapOfVertexInteger;
189 // Check the necessity to fill the map of parameters
190 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
191 GeomAbs_SurfaceType thetype = gFace->GetType();
192 const Standard_Boolean isBSpline = (thetype == GeomAbs_BezierSurface ||
193 thetype == GeomAbs_BSplineSurface);
194 const Standard_Boolean useUVParam = (thetype == GeomAbs_Torus ||isBSpline);
199 // essai de determination de la longueur vraie:
200 // akm (bug OCC16) : We must calculate these measures in non-singular
201 // parts of face. Let`s try to compute average value of three
202 // (umin, (umin+umax)/2, umax), and respectively for v.
204 //Standard_Real longu = 0.0, longv = 0.0; //, last , first;
205 //gp_Pnt P11, P12, P21, P22, P31, P32;
206 BRepMesh::HVectorOfVertex& aBoundaryNodes = myAttribute->ChangeMeshNodes();
207 BRepMesh::VectorOfVertex::Iterator aNodesIt(*aBoundaryNodes);
208 for (; aNodesIt.More(); aNodesIt.Next())
210 BRepMesh_Vertex& aNode = aNodesIt.ChangeValue();
211 gp_XY aPnt2d = aNode.Coord();
215 myUParam.Add(aPnt2d.X());
216 myVParam.Add(aPnt2d.Y());
219 aNode.ChangeCoord() = myAttribute->Scale(aPnt2d, Standard_True);
220 myStructure->AddNode(aNode, Standard_True);
222 aBoundaryNodes.Nullify();
226 const Standard_Real aRange[2][2] = {
227 {myAttribute->GetUMin(), myAttribute->GetUMax()},
228 {myAttribute->GetVMin(), myAttribute->GetVMax()}
231 const GeomAbs_Shape aContinuity = GeomAbs_CN;
232 for (Standard_Integer i = 0; i < 2; ++i)
234 const Standard_Boolean isU = (i == 0);
235 const Standard_Integer aIntervalsNb = isU ?
236 gFace->NbUIntervals(aContinuity) :
237 gFace->NbVIntervals(aContinuity);
239 BRepMesh::IMapOfReal& aParams = isU ? myUParam : myVParam;
240 if (aIntervalsNb < aParams.Size())
243 TColStd_Array1OfReal aIntervals(1, aIntervalsNb + 1);
245 gFace->UIntervals(aIntervals, aContinuity);
247 gFace->VIntervals(aIntervals, aContinuity);
249 for (Standard_Integer j = 1; j <= aIntervals.Upper(); ++j)
251 const Standard_Real aParam = aIntervals(j);
252 if (aParam > aRange[i][0] && aParam < aRange[i][1])
258 ////////////////////////////////////////////////////////////
259 //add internal vertices after self-intersection check
260 if ( myInternalVerticesMode )
262 TopExp_Explorer anExplorer(myAttribute->Face(), TopAbs_VERTEX, TopAbs_EDGE);
263 for ( ; anExplorer.More(); anExplorer.Next() )
264 add(TopoDS::Vertex(anExplorer.Current()));
267 const BRepMesh::HDMapOfShapePairOfPolygon& aEdges = myAttribute->ChangeInternalEdges();
268 TopExp_Explorer aWireIt(myAttribute->Face(), TopAbs_WIRE);
269 for (; aWireIt.More(); aWireIt.Next())
271 TopExp_Explorer aEdgeIt(aWireIt.Current(), TopAbs_EDGE);
272 for (; aEdgeIt.More(); aEdgeIt.Next())
274 const TopoDS_Edge& aEdge = TopoDS::Edge(aEdgeIt.Current());
275 BRepMesh_PairOfPolygon aPair;
276 if (!aEdges->Find(aEdge, aPair))
279 TopAbs_Orientation aOri = aEdge.Orientation();
280 const Handle(Poly_PolygonOnTriangulation)& aPolygon =
281 aOri == TopAbs_REVERSED ? aPair.Last() : aPair.First();
283 const TColStd_Array1OfInteger& aIndices = aPolygon->Nodes();
284 const Standard_Integer aNodesNb = aPolygon->NbNodes();
286 Standard_Integer aPrevId = aIndices(1);
287 for (Standard_Integer i = 2; i <= aNodesNb; ++i)
289 const Standard_Integer aCurId = aIndices(i);
290 addLinkToMesh(aPrevId, aCurId, aOri);
297 //=======================================================================
298 //function : addLinkToMesh
300 //=======================================================================
301 void BRepMesh_FastDiscretFace::addLinkToMesh(
302 const Standard_Integer theFirstNodeId,
303 const Standard_Integer theLastNodeId,
304 const TopAbs_Orientation theOrientation)
306 if (theOrientation == TopAbs_FORWARD)
307 myStructure->AddLink(BRepMesh_Edge(theFirstNodeId, theLastNodeId, BRepMesh_Frontier));
308 else if (theOrientation == TopAbs_REVERSED)
309 myStructure->AddLink(BRepMesh_Edge(theLastNodeId, theFirstNodeId, BRepMesh_Frontier));
310 else if (theOrientation == TopAbs_INTERNAL)
311 myStructure->AddLink(BRepMesh_Edge(theFirstNodeId, theLastNodeId, BRepMesh_Fixed));
314 //=======================================================================
317 //=======================================================================
318 void BRepMesh_FastDiscretFace::add(const Handle(BRepMesh_FaceAttribute)& theAttribute)
320 if (!theAttribute->IsValid() || theAttribute->ChangeMeshNodes()->IsEmpty())
323 myAttribute = theAttribute;
326 BRepMesh::HIMapOfInteger& aVertexEdgeMap = myAttribute->ChangeVertexEdgeMap();
327 Standard_Integer nbVertices = aVertexEdgeMap->Extent();
328 BRepMesh::Array1OfInteger tabvert_corr(1, nbVertices);
329 for ( Standard_Integer i = 1; i <= nbVertices; ++i )
332 BRepMesh_Delaun trigu(myStructure, tabvert_corr);
334 //removed all free edges from triangulation
335 const Standard_Integer nbLinks = myStructure->NbLinks();
336 for( Standard_Integer i = 1; i <= nbLinks; i++ )
338 if( myStructure->ElementsConnectedTo(i).Extent() < 1 )
340 BRepMesh_Edge& anEdge = (BRepMesh_Edge&)trigu.GetEdge(i);
341 if ( anEdge.Movability() == BRepMesh_Deleted )
344 anEdge.SetMovability(BRepMesh_Free);
345 myStructure->RemoveLink(i);
349 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
350 GeomAbs_SurfaceType thetype = gFace->GetType();
352 Standard_Boolean rajout =
353 (thetype == GeomAbs_Sphere || thetype == GeomAbs_Torus);
355 // Check the necessity to fill the map of parameters
356 const Standard_Boolean useUVParam = (thetype == GeomAbs_Torus ||
357 thetype == GeomAbs_BezierSurface ||
358 thetype == GeomAbs_BSplineSurface);
360 const Standard_Real umax = myAttribute->GetUMax();
361 const Standard_Real umin = myAttribute->GetUMin();
362 const Standard_Real vmax = myAttribute->GetVMax();
363 const Standard_Real vmin = myAttribute->GetVMin();
365 Standard_Boolean isaline =
366 ((umax - umin) < Precision::PConfusion() ||
367 (vmax - vmin) < Precision::PConfusion());
369 Standard_Real aDef = -1;
370 if ( !isaline && myStructure->ElementsOfDomain().Extent() > 0 )
372 BRepMesh::ListOfVertex aNewVertices;
375 aDef = control(aNewVertices, trigu, Standard_True);
376 rajout = (aDef > myAttribute->GetDefFace() || aDef < 0.);
379 if (!rajout && useUVParam)
381 rajout = (myVParam.Extent() > 2 &&
382 (gFace->IsUClosed() || gFace->IsVClosed()));
387 insertInternalVertices(aNewVertices, trigu);
389 //control internal points
390 aDef = control(aNewVertices, trigu, Standard_False);
394 //modify myStructure back
395 BRepMesh::HVectorOfVertex& aMeshNodes = myStructure->Data()->ChangeVertices();
396 for ( Standard_Integer i = 1; i <= myStructure->NbNodes(); ++i )
398 BRepMesh_Vertex& aNode = aMeshNodes->ChangeValue(i - 1);
399 aNode.ChangeCoord() = myAttribute->Scale(aNode.Coord(), Standard_False);
401 const BRepMesh::ListOfInteger& alist = myStructure->LinksConnectedTo(i);
402 // Register internal nodes used in triangulation
403 if (!alist.IsEmpty() && aVertexEdgeMap->FindIndex(i) == 0)
404 aVertexEdgeMap->Add(i);
408 myAttribute->SetDefFace(aDef);
411 //=======================================================================
412 //function : addVerticesToMesh
414 //=======================================================================
415 Standard_Boolean BRepMesh_FastDiscretFace::addVerticesToMesh(
416 const BRepMesh::ListOfVertex& theVertices,
417 BRepMesh_Delaun& theMeshBuilder)
419 if (theVertices.IsEmpty())
420 return Standard_False;
422 BRepMesh::Array1OfVertexOfDelaun aArrayOfNewVertices(1, theVertices.Extent());
423 BRepMesh::ListOfVertex::Iterator aVertexIt(theVertices);
424 for (Standard_Integer aVertexId = 0; aVertexIt.More(); aVertexIt.Next())
425 aArrayOfNewVertices(++aVertexId) = aVertexIt.Value();
427 theMeshBuilder.AddVertices(aArrayOfNewVertices);
428 return Standard_True;
431 //=======================================================================
432 //function : insertInternalVertices
434 //=======================================================================
435 static void filterParameters(const BRepMesh::IMapOfReal& theParams,
436 const Standard_Real theMinDist,
437 const Standard_Real theFilterDist,
438 BRepMesh::SequenceOfReal& theResult)
440 // Sort sequence of parameters
441 BRepMesh::SequenceOfReal aParamTmp;
442 Standard_Integer aParamLength = 1;
443 const Standard_Integer anInitLen = theParams.Extent();
445 TColStd_Array1OfReal aParamArray(1, anInitLen);
447 for (j = 1; j <= anInitLen; j++)
448 aParamArray(j) = theParams(j);
450 TCollection_CompareOfReal aCompare;
451 SortTools_ShellSortOfReal::Sort(aParamArray, aCompare);
453 // mandadory pre-filtering using the first (minimal) filter value
454 Standard_Real aP1, aP2;
455 aP1 = aParamArray(1);
456 aParamTmp.Append(aP1);
457 for (j = 2; j <= anInitLen; j++)
459 aP2 = aParamArray(j);
460 if ((aP2-aP1) > theMinDist)
462 aParamTmp.Append(aP2);
468 //add last point if required
469 if(aParamArray(anInitLen)-theParams(aParamLength) > theMinDist)
471 aParamTmp.Append(aParamArray(anInitLen));
475 //perform filtering on series
476 Standard_Real aLastAdded, aLastCandidate;
477 Standard_Boolean isCandidateDefined = Standard_False;
478 aLastAdded = aParamTmp.First();
479 aLastCandidate = aLastAdded;
480 theResult.Append(aParamTmp.First());
482 for(j=2;j<aParamTmp.Length();j++)
484 Standard_Real aVal = aParamTmp.Value(j);
485 if(aVal-aLastAdded > theFilterDist)
488 if(isCandidateDefined) {
489 aLastAdded = aLastCandidate;
490 isCandidateDefined = Standard_False;
497 theResult.Append(aLastAdded);
501 aLastCandidate = aVal;
502 isCandidateDefined = Standard_True;
504 theResult.Append(aParamTmp.Last());
506 if( theResult.Length() == 2 )
508 Standard_Real dist = theResult.Last() - theResult.First();
509 Standard_Integer nbint = (Standard_Integer)((dist / theFilterDist) + 0.5);
513 //Five points more is maximum
520 Standard_Real dU = dist / nbint;
521 for( i = 1; i < nbint; i++ )
523 theResult.InsertAfter(i, theResult.First()+i*dU);
529 void BRepMesh_FastDiscretFace::insertInternalVertices(
530 BRepMesh::ListOfVertex& theNewVertices,
531 BRepMesh_Delaun& theMeshBuilder)
533 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
534 switch (gFace->GetType())
537 insertInternalVerticesSphere(theNewVertices);
540 case GeomAbs_Cylinder:
541 insertInternalVerticesCylinder(theNewVertices);
545 insertInternalVerticesCone(theNewVertices);
549 insertInternalVerticesTorus(theNewVertices);
552 case GeomAbs_BezierSurface:
553 case GeomAbs_BSplineSurface:
554 insertInternalVerticesBSpline(theNewVertices);
558 insertInternalVerticesOther(theNewVertices);
562 addVerticesToMesh(theNewVertices, theMeshBuilder);
565 //=======================================================================
566 //function : insertInternalVerticesSphere
568 //=======================================================================
569 void BRepMesh_FastDiscretFace::insertInternalVerticesSphere(
570 BRepMesh::ListOfVertex& theNewVertices)
572 Standard_Real aRange[] = {
573 myAttribute->GetVMin(), myAttribute->GetVMax(),
574 myAttribute->GetUMin(), myAttribute->GetUMax()
577 gp_Sphere aSphere = myAttribute->Surface()->Sphere();
579 // Calculate parameters for iteration in V direction
580 Standard_Real aStep = 0.7 * GCPnts_TangentialDeflection::ArcAngularStep(
581 aSphere.Radius(), myAttribute->GetDefFace(), myAngle, myMinSize);
583 Standard_Real aDd[2] = {aStep, aStep};
584 Standard_Real aPasMax[2] = {0., 0.};
585 for (Standard_Integer i = 0; i < 2; ++i)
587 const Standard_Real aMax = aRange[2 * i + 1];
588 const Standard_Real aDiff = aMax - aRange[2 * i + 0];
589 aDd[i] = aDiff / ((Standard_Integer)(aDiff / aDd[i]) + 1);
590 aPasMax[i] = aMax - Precision::PConfusion();
593 const Standard_Real aHalfDu = aDd[1] * 0.5;
594 Standard_Boolean Shift = Standard_False;
595 Standard_Real aPasV = aRange[0] + aDd[0];
596 for (; aPasV < aPasMax[0]; aPasV += aDd[0])
599 const Standard_Real d = (Shift) ? aHalfDu : 0.;
600 Standard_Real aPasU = aRange[2] + d;
601 for (; aPasU < aPasMax[1]; aPasU += aDd[1])
603 tryToInsertAnalyticVertex(gp_Pnt2d(aPasU, aPasV), aSphere, theNewVertices);
608 //=======================================================================
609 //function : insertInternalVerticesCylinder
611 //=======================================================================
612 void BRepMesh_FastDiscretFace::insertInternalVerticesCylinder(
613 BRepMesh::ListOfVertex& theNewVertices)
615 const Standard_Real umax = myAttribute->GetUMax();
616 const Standard_Real umin = myAttribute->GetUMin();
617 const Standard_Real vmax = myAttribute->GetVMax();
618 const Standard_Real vmin = myAttribute->GetVMin();
620 gp_Cylinder aCylinder = myAttribute->Surface()->Cylinder();
621 const Standard_Real aRadius = aCylinder.Radius();
623 // Calculate parameters for iteration in U direction
624 Standard_Real Du = GCPnts_TangentialDeflection::ArcAngularStep(
625 aRadius, myAttribute->GetDefFace(), myAngle, myMinSize);
627 const Standard_Real su = umax - umin;
628 const Standard_Integer nbU = (Standard_Integer)(su / Du);
631 // Calculate parameters for iteration in V direction
632 const Standard_Real sv = vmax - vmin;
633 Standard_Integer nbV = (Standard_Integer)(nbU*sv / (su*aRadius));
634 nbV = Min(nbV, 100 * nbU);
635 Standard_Real Dv = sv / (nbV + 1);
637 Standard_Real pasu, pasv, pasvmax = vmax - Dv*0.5, pasumax = umax - Du*0.5;
638 for (pasv = vmin + Dv; pasv < pasvmax; pasv += Dv)
640 for (pasu = umin + Du; pasu < pasumax; pasu += Du)
642 tryToInsertAnalyticVertex(gp_Pnt2d(pasu, pasv), aCylinder, theNewVertices);
647 //=======================================================================
648 //function : insertInternalVerticesCone
650 //=======================================================================
651 void BRepMesh_FastDiscretFace::insertInternalVerticesCone(
652 BRepMesh::ListOfVertex& theNewVertices)
654 const Standard_Real umax = myAttribute->GetUMax();
655 const Standard_Real umin = myAttribute->GetUMin();
656 const Standard_Real vmax = myAttribute->GetVMax();
657 const Standard_Real vmin = myAttribute->GetVMin();
659 gp_Cone aCone = myAttribute->Surface()->Cone();
660 Standard_Real RefR = aCone.RefRadius();
661 Standard_Real SAng = aCone.SemiAngle();
662 Standard_Real aRadius = Max(Abs(RefR + vmin*Sin(SAng)), Abs(RefR + vmax*Sin(SAng)));
664 Standard_Real Du = GCPnts_TangentialDeflection::ArcAngularStep(
665 aRadius, myAttribute->GetDefFace(), myAngle, myMinSize);
667 Standard_Real Dv, pasu, pasv;
668 Standard_Integer nbU = (Standard_Integer)((umax - umin) / Du);
669 Standard_Integer nbV = (Standard_Integer)(nbU*(vmax - vmin) / ((umax - umin)*aRadius));
670 Du = (umax - umin) / (nbU + 1);
671 Dv = (vmax - vmin) / (nbV + 1);
673 Standard_Real pasvmax = vmax - Dv*0.5, pasumax = umax - Du*0.5;
674 for (pasv = vmin + Dv; pasv < pasvmax; pasv += Dv)
676 for (pasu = umin + Du; pasu < pasumax; pasu += Du)
678 tryToInsertAnalyticVertex(gp_Pnt2d(pasu, pasv), aCone, theNewVertices);
683 //=======================================================================
684 //function : insertInternalVerticesTorus
686 //=======================================================================
687 void BRepMesh_FastDiscretFace::insertInternalVerticesTorus(
688 BRepMesh::ListOfVertex& theNewVertices)
690 const Standard_Real umax = myAttribute->GetUMax();
691 const Standard_Real umin = myAttribute->GetUMin();
692 const Standard_Real vmax = myAttribute->GetVMax();
693 const Standard_Real vmin = myAttribute->GetVMin();
694 const Standard_Real deltaX = myAttribute->GetDeltaX();
695 const Standard_Real deltaY = myAttribute->GetDeltaY();
696 const Standard_Real aDefFace = myAttribute->GetDefFace();
698 gp_Torus T = myAttribute->Surface()->Torus();
700 Standard_Boolean insert;
701 Standard_Integer i, j, ParamULength, ParamVLength;
702 Standard_Real pp, pasu, pasv;
703 Standard_Real r = T.MinorRadius(), R = T.MajorRadius();
705 BRepMesh::SequenceOfReal ParamU, ParamV;
707 Standard_Real oldDv = GCPnts_TangentialDeflection::ArcAngularStep(
708 r, aDefFace, myAngle, myMinSize);
710 Standard_Real Dv = 0.9*oldDv; //TWOTHIRD * oldDv;
714 Standard_Integer nbV = Max((Standard_Integer)((vmax - vmin) / Dv), 2);
715 Dv = (vmax - vmin) / (nbV + 1);
716 Standard_Real ru = R + r;
719 Du = GCPnts_TangentialDeflection::ArcAngularStep(
720 ru, aDefFace, myAngle, myMinSize);
722 Standard_Real aa = sqrt(Du*Du + oldDv*oldDv);
723 if (aa < gp::Resolution())
725 Du *= Min(oldDv, Du) / aa;
729 Standard_Integer nbU = Max((Standard_Integer)((umax - umin) / Du), 2);
730 nbU = Max(nbU, (int)(nbV*(umax - umin)*R / ((vmax - vmin)*r) / 5.));
731 Du = (umax - umin) / (nbU + 1);
735 // As the points of edges are returned.
736 // in this case, the points are not representative.
738 //-- Choose DeltaX and DeltaY so that to avoid skipping points on the grid
739 for (i = 0; i <= nbU; i++) ParamU.Append(umin + i* Du);
744 // Number of mapped U parameters
745 const Standard_Integer LenU = myUParam.Extent();
746 // Fill array of U parameters
747 TColStd_Array1OfReal Up(1, LenU);
748 for (j = 1; j <= LenU; j++) Up(j) = myUParam(j);
750 // Calculate DU, leave array of parameters
751 Standard_Real aDU = FUN_CalcAverageDUV(Up, LenU);
752 aDU = Max(aDU, Abs(umax - umin) / (Standard_Real)nbU / 2.);
753 Standard_Real dUstd = Abs(umax - umin) / (Standard_Real)LenU;
754 if (aDU > dUstd) dUstd = aDU;
756 for (j = 1; j <= LenU; j++)
759 insert = Standard_True;
760 ParamULength = ParamU.Length();
761 for (i = 1; i <= ParamULength && insert; i++)
763 insert = (Abs(ParamU.Value(i) - pp) > (0.5*dUstd));
765 if (insert) ParamU.Append(pp);
770 // Number of mapped V parameters
771 const Standard_Integer LenV = myVParam.Extent();
772 // Fill array of V parameters
773 TColStd_Array1OfReal Vp(1, LenV);
774 for (j = 1; j <= LenV; j++) Vp(j) = myVParam(j);
775 // Calculate DV, sort array of parameters
776 Standard_Real aDV = FUN_CalcAverageDUV(Vp, LenV);
777 aDV = Max(aDV, Abs(vmax - vmin) / (Standard_Real)nbV / 2.);
779 Standard_Real dVstd = Abs(vmax - vmin) / (Standard_Real)LenV;
780 if (aDV > dVstd) dVstd = aDV;
782 for (j = 1; j <= LenV; j++)
786 insert = Standard_True;
787 ParamVLength = ParamV.Length();
788 for (i = 1; i <= ParamVLength && insert; i++)
790 insert = (Abs(ParamV.Value(i) - pp) > (dVstd*2. / 3.));
792 if (insert) ParamV.Append(pp);
795 Standard_Integer Lu = ParamU.Length(), Lv = ParamV.Length();
796 Standard_Real uminnew = umin + deltaY*0.1;
797 Standard_Real vminnew = vmin + deltaX*0.1;
798 Standard_Real umaxnew = umax - deltaY*0.1;
799 Standard_Real vmaxnew = vmax - deltaX*0.1;
801 for (i = 1; i <= Lu; i++)
803 pasu = ParamU.Value(i);
804 if (pasu >= uminnew && pasu < umaxnew)
806 for (j = 1; j <= Lv; j++)
808 pasv = ParamV.Value(j);
809 if (pasv >= vminnew && pasv < vmaxnew)
811 tryToInsertAnalyticVertex(gp_Pnt2d(pasu, pasv), T, theNewVertices);
818 //=======================================================================
819 //function : insertInternalVerticesBSpline
821 //=======================================================================
822 void BRepMesh_FastDiscretFace::insertInternalVerticesBSpline(
823 BRepMesh::ListOfVertex& theNewVertices)
825 const Standard_Real aRange[2][2] = {
826 { myAttribute->GetUMax(), myAttribute->GetUMin() },
827 { myAttribute->GetVMax(), myAttribute->GetVMin() }
830 const Standard_Real aDelta[2] = {
831 myAttribute->GetDeltaX(),
832 myAttribute->GetDeltaY()
835 const Standard_Real aDefFace = myAttribute->GetDefFace();
836 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
838 BRepMesh::SequenceOfReal aParams[2];
839 for (Standard_Integer i = 0; i < 2; ++i)
841 Standard_Boolean isU = (i == 0);
842 Standard_Real aRes = isU ?
843 gFace->UResolution(aDefFace) :
844 gFace->VResolution(aDefFace);
846 // Sort and filter sequence of parameters
847 Standard_Real aMinDiff = Precision::PConfusion();
849 aMinDiff /= aDelta[i];
851 aMinDiff = Max(myMinSize, aMinDiff);
853 Standard_Real aRangeDiff = aRange[i][0] - aRange[i][1];
854 Standard_Real aDiffMaxLim = 0.1 * aRangeDiff;
855 Standard_Real aDiffMinLim = Max(0.005 * aRangeDiff, 2. * aRes);
856 Standard_Real aDiff = Max(myMinSize, Min(aDiffMaxLim, aDiffMinLim));
857 filterParameters(isU ? myUParam : myVParam, aMinDiff, aDiff, aParams[i]);
860 // check intermediate isolines
861 Handle(Geom_Surface) aBSpline;
862 GeomAbs_SurfaceType aSurfType = gFace->GetType();
863 if (aSurfType == GeomAbs_BezierSurface)
864 aBSpline = gFace->Bezier();
865 else if (aSurfType == GeomAbs_BSplineSurface)
866 aBSpline = gFace->BSpline();
868 const BRepMesh::HClassifier& aClassifier = myAttribute->ChangeClassifier();
870 // precision for compare square distances
871 const Standard_Real aPrecision = Precision::Confusion();
872 const Standard_Real aSqPrecision = aPrecision * aPrecision;
873 for (Standard_Integer k = 0; k < 2; ++k)
875 BRepMesh::SequenceOfReal& aParams1 = aParams[k];
876 BRepMesh::SequenceOfReal& aParams2 = aParams[(k + 1) % 2];
877 const Standard_Boolean isU = (k == 0);
878 Standard_Integer aStartIndex, aEndIndex;
882 aEndIndex = aParams1.Length();
887 aEndIndex = aParams1.Length() - 1;
890 for (Standard_Integer i = aStartIndex; i <= aEndIndex; ++i)
892 const Standard_Real aParam1 = aParams1(i);
893 GeomAdaptor_Curve aIso(isU ?
894 aBSpline->UIso(aParam1) : aBSpline->VIso(aParam1));
896 Standard_Real aPrevParam2 = aParams2(1);
897 gp_Pnt aPrevPnt2 = aIso.Value(aPrevParam2);
898 for (Standard_Integer j = 2; j <= aParams2.Length();)
900 Standard_Real aParam2 = aParams2(j);
901 gp_Pnt aPnt2 = aIso.Value(aParam2);
902 Standard_Real aMidParam = 0.5 * (aPrevParam2 + aParam2);
903 gp_Pnt aMidPnt = aIso.Value(aMidParam);
905 // 23.03.2010 skl for OCC21645 - change precision for comparison
907 if (aPrevPnt2.SquareDistance(aPnt2) > aSqPrecision)
909 gp_Lin aLin(aPrevPnt2, gp_Dir(gp_Vec(aPrevPnt2, aPnt2)));
910 aDist = aLin.Distance(aMidPnt);
913 aDist = aPrevPnt2.Distance(aMidPnt);
915 if (aDist > aDefFace && aDist > myMinSize)
918 aParams2.InsertBefore(j, aMidParam);
922 //put regular grig for normals
923 gp_Pnt2d aStPnt1, aStPnt2;
926 aStPnt1 = gp_Pnt2d(aParam1, aPrevParam2);
927 aStPnt2 = gp_Pnt2d(aParam1, aMidParam);
931 aStPnt1 = gp_Pnt2d(aPrevParam2, aParam1);
932 aStPnt2 = gp_Pnt2d(aMidParam, aParam1);
935 gp_Dir N1(0, 0, 1), N2(0, 0, 1);
936 Standard_Boolean aSt1 = GeomLib::NormEstim(aBSpline, aStPnt1, aPrecision, N1);
937 Standard_Boolean aSt2 = GeomLib::NormEstim(aBSpline, aStPnt2, aPrecision, N2);
939 Standard_Real aAngle = N2.Angle(N1);
940 if (aSt1 < 1 && aSt2 < 1 && aAngle > myAngle)
942 Standard_Real aLen = GCPnts_AbscissaPoint::Length(aIso,
943 aPrevParam2, aMidParam, aDefFace);
945 if (aLen > myMinSize)
948 aParams2.InsertBefore(j, aMidParam);
953 aPrevParam2 = aParam2;
956 if (!isU && j < aParams2.Length())
958 // Update point parameter.
959 aStPnt1.SetX(aPrevParam2);
966 // insert nodes of the regular grid
967 for (Standard_Integer i = 1; i <= aParams[0].Length(); ++i)
969 const Standard_Real aParam1 = aParams[0].Value(i);
970 for (Standard_Integer j = 1; j <= aParams[1].Length(); ++j)
972 gp_Pnt2d aPnt2d(aParam1, aParams[1].Value(j));
974 // Classify intersection point
975 if (aClassifier->Perform(aPnt2d) == TopAbs_IN)
978 gFace->D0(aPnt2d.X(), aPnt2d.Y(), aPnt);
979 insertVertex(aPnt, aPnt2d.Coord(), theNewVertices);
985 //=======================================================================
986 //function : insertInternalVerticesOther
988 //=======================================================================
989 void BRepMesh_FastDiscretFace::insertInternalVerticesOther(
990 BRepMesh::ListOfVertex& theNewVertices)
992 const Standard_Real aAngle = myAngle;//0.35;
993 const Standard_Real aRange[2][2] = {
994 { myAttribute->GetUMax(), myAttribute->GetUMin() },
995 { myAttribute->GetVMax(), myAttribute->GetVMin() }
998 const Standard_Real aDefFace = myAttribute->GetDefFace();
999 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
1001 BRepMesh::SequenceOfReal aParams[2];
1002 const Standard_Integer aIsoPointsNb = 11;
1003 for (Standard_Integer k = 0; k < 2; ++k)
1005 const Standard_Boolean isU = (k == 0);
1006 const GeomAbs_IsoType aIsoType = isU ? GeomAbs_IsoU : GeomAbs_IsoV;
1007 const Standard_Integer aOtherParamsIndex = (k + 1) % 2;
1008 const Standard_Real (&aRange1)[2] = aRange[k];
1009 const Standard_Real (&aRange2)[2] = aRange[aOtherParamsIndex];
1011 GCPnts_TangentialDeflection aDiscretIso[aIsoPointsNb];
1012 const Standard_Real aStepWidth = (aRange1[0] - aRange1[1]) / aIsoPointsNb;
1014 // Find the most curved Iso.
1015 Standard_Integer aMaxIndex = 1, aMaxPointsNb = 0;
1016 for (Standard_Integer aIsoIt = 0; aIsoIt < aIsoPointsNb; ++aIsoIt)
1018 Standard_Real aParam = aRange1[1] + aIsoIt * aStepWidth;
1019 Adaptor3d_IsoCurve aIso(gFace, aIsoType, aParam);
1021 Standard_Real aFirstParam = Max(aRange2[1], aIso.FirstParameter());
1022 Standard_Real aLastParam = Min(aRange2[0], aIso.LastParameter());
1024 aDiscretIso[aIsoIt].Initialize(aIso, aFirstParam, aLastParam,
1025 aAngle, 0.7 * aDefFace, 2, Precision::PConfusion(), myMinSize);
1027 const Standard_Integer aPointsNb = aDiscretIso[aIsoIt].NbPoints();
1028 if (aPointsNb > aMaxPointsNb)
1030 aMaxPointsNb = aPointsNb;
1035 BRepMesh::SequenceOfReal& aParams2 = aParams[aOtherParamsIndex];
1036 GCPnts_TangentialDeflection& aDIso = aDiscretIso[aMaxIndex];
1037 for (Standard_Integer i = 1; i <= aMaxPointsNb; ++i)
1038 aParams2.Append(aDIso.Parameter(i));
1040 if (aParams2.Length() == 2)
1041 aParams2.InsertAfter(1, 0.5 * (aRange2[1] + aRange2[0]));
1044 Adaptor3d_IsoCurve aIsoV;
1047 const BRepMesh::HClassifier& aClassifier = myAttribute->ChangeClassifier();
1048 const Standard_Integer aUPointsNb = aParams[0].Length();
1049 const Standard_Integer aVPointsNb = aParams[1].Length();
1050 for (Standard_Integer i = 2; i < aVPointsNb; ++i)
1052 const Standard_Real aV = aParams[1].Value(i);
1053 aIsoV.Load(GeomAbs_IsoV, aV);
1055 for (Standard_Integer j = 2; j < aUPointsNb; ++j)
1057 const Standard_Real aU = aParams[0].Value(j);
1059 const gp_Pnt2d aNewPoint(aU, aV);
1060 if (aClassifier->Perform(aNewPoint) == TopAbs_IN)
1061 insertVertex(aIsoV.Value(aU), aNewPoint.Coord(), theNewVertices);
1066 //=======================================================================
1067 //function : checkDeflectionAndInsert
1069 //=======================================================================
1070 Standard_Boolean BRepMesh_FastDiscretFace::checkDeflectionAndInsert(
1071 const gp_Pnt& thePnt3d,
1073 const Standard_Boolean isDeflectionCheckOnly,
1074 const Standard_Real theTriangleDeflection,
1075 const Standard_Real theFaceDeflection,
1076 const BRepMesh_CircleTool& theCircleTool,
1077 BRepMesh::ListOfVertex& theVertices,
1078 Standard_Real& theMaxTriangleDeflection)
1080 if (theTriangleDeflection > theMaxTriangleDeflection)
1081 theMaxTriangleDeflection = theTriangleDeflection;
1083 if (theTriangleDeflection < theFaceDeflection)
1084 return Standard_True;
1086 if (myMinSize > Precision::Confusion())
1088 // Iterator in the list of indexes of circles containing the node
1089 BRepMesh::ListOfInteger& aCirclesList =
1090 const_cast<BRepMesh_CircleTool&>(theCircleTool).Select(
1091 myAttribute->Scale(theUV, Standard_True));
1093 Handle(NCollection_IncAllocator) aAllocator =
1094 new NCollection_IncAllocator(BRepMesh::MEMORY_BLOCK_SIZE_HUGE);
1095 BRepMesh::MapOfInteger aUsedNodes(10, aAllocator);
1096 BRepMesh::ListOfInteger::Iterator aCircleIt(aCirclesList);
1097 for (; aCircleIt.More(); aCircleIt.Next())
1099 const BRepMesh_Triangle& aTriangle =
1100 myStructure->GetElement(aCircleIt.Value());
1102 Standard_Integer aNodes[3];
1103 myStructure->ElementNodes(aTriangle, aNodes);
1105 for (Standard_Integer i = 0; i < 3; ++i)
1107 const Standard_Integer aNodeId = aNodes[i];
1108 if (aUsedNodes.Contains(aNodeId))
1111 aUsedNodes.Add(aNodeId);
1112 const BRepMesh_Vertex& aNode = myStructure->GetNode(aNodeId);
1113 const gp_Pnt& aPoint = myAttribute->GetPoint(aNode);
1115 if (thePnt3d.SquareDistance(aPoint) < myMinSize * myMinSize)
1116 return Standard_True;
1121 if (isDeflectionCheckOnly)
1122 return Standard_False;
1124 insertVertex(thePnt3d, theUV, theVertices);
1125 return Standard_True;
1128 //=======================================================================
1129 //function : control
1131 //=======================================================================
1132 Standard_Real BRepMesh_FastDiscretFace::control(
1133 BRepMesh::ListOfVertex& theNewVertices,
1134 BRepMesh_Delaun& theTrigu,
1135 const Standard_Boolean theIsFirst)
1137 Standard_Integer aTrianglesNb = myStructure->ElementsOfDomain().Extent();
1138 if (aTrianglesNb < 1)
1141 //IMPORTANT: Constants used in calculations
1142 const Standard_Real MinimalArea2d = 1.e-9;
1143 const Standard_Real MinimalSqLength3d = 1.e-12;
1144 const Standard_Real aSqDefFace = myAttribute->GetDefFace() * myAttribute->GetDefFace();
1146 const Handle(BRepAdaptor_HSurface)& gFace = myAttribute->Surface();
1148 Handle(Geom_Surface) aBSpline;
1149 GeomAbs_SurfaceType aSurfType = gFace->GetType();
1150 if (aSurfType == GeomAbs_BezierSurface)
1151 aBSpline = gFace->Bezier();
1152 else if (aSurfType == GeomAbs_BSplineSurface)
1153 aBSpline = gFace->BSpline();
1155 NCollection_DataMap<Standard_Integer, gp_Dir> aNorMap;
1156 BRepMesh::MapOfIntegerInteger aStatMap;
1157 NCollection_Map<BRepMesh_OrientedEdge> aCouples(3 * aTrianglesNb);
1158 const BRepMesh_CircleTool& aCircles = theTrigu.Circles();
1160 // Perform refinement passes
1161 // Define the number of iterations
1162 Standard_Integer aIterationsNb = 11;
1163 const Standard_Integer aPassesNb = (theIsFirst ? 1 : aIterationsNb);
1164 // Initialize stop condition
1165 Standard_Real aMaxSqDef = -1.;
1166 Standard_Integer aPass = 1, aInsertedNb = 1;
1167 Standard_Boolean isAllDegenerated = Standard_False;
1168 for (; aPass <= aPassesNb && aInsertedNb && !isAllDegenerated; ++aPass)
1170 theNewVertices.Clear();
1172 // Reset stop condition
1175 isAllDegenerated = Standard_True;
1177 aTrianglesNb = myStructure->ElementsOfDomain().Extent();
1178 if (aTrianglesNb < 1)
1181 // Iterate on current triangles
1182 const BRepMesh::MapOfInteger& aTriangles = myStructure->ElementsOfDomain();
1183 BRepMesh::MapOfInteger::Iterator aTriangleIt(aTriangles);
1184 for (; aTriangleIt.More(); aTriangleIt.Next())
1186 const Standard_Integer aTriangleId = aTriangleIt.Key();
1187 const BRepMesh_Triangle& aCurrentTriangle = myStructure->GetElement(aTriangleId);
1189 if (aCurrentTriangle.Movability() == BRepMesh_Deleted)
1192 Standard_Integer v[3];
1193 myStructure->ElementNodes(aCurrentTriangle, v);
1195 Standard_Integer e[3];
1196 Standard_Boolean o[3];
1197 aCurrentTriangle.Edges(e, o);
1201 Standard_Boolean m[3];
1202 for (Standard_Integer i = 0; i < 3; ++i)
1204 m[i] = (myStructure->GetLink(e[i]).Movability() == BRepMesh_Frontier);
1206 const BRepMesh_Vertex& aVertex = myStructure->GetNode(v[i]);
1207 xy[i] = myAttribute->Scale(aVertex.Coord(), Standard_False);
1208 p [i] = myAttribute->GetPoint(aVertex).Coord();
1212 Standard_Boolean isDegeneratedTri = Standard_False;
1213 for (Standard_Integer i = 0; i < 3 && !isDegeneratedTri; ++i)
1215 aLinkVec[i] = p[(i + 1) % 3] - p[i];
1216 isDegeneratedTri = (aLinkVec[i].SquareModulus() < MinimalSqLength3d);
1219 if (isDegeneratedTri)
1222 isAllDegenerated = Standard_False;
1224 // Check triangle area in 2d
1225 if (Abs((xy[1]-xy[0])^(xy[2]-xy[1])) < MinimalArea2d)
1228 // Check triangle normal
1230 Standard_Real aSqDef = -1.;
1231 Standard_Boolean isSkipped = Standard_False;
1232 gp_XYZ normal(aLinkVec[0] ^ aLinkVec[1]);
1239 // Check deflection on triangle
1240 gp_XY mi2d = (xy[0] + xy[1] + xy[2]) / 3.0;
1241 gFace->D0(mi2d.X(), mi2d.Y(), pDef);
1242 aSqDef = Abs(normal * (pDef.XYZ() - p[0]));
1245 isSkipped = !checkDeflectionAndInsert(pDef, mi2d, theIsFirst,
1246 aSqDef, aSqDefFace, aCircles, theNewVertices, aMaxSqDef);
1251 catch (Standard_Failure)
1256 for (Standard_Integer i = 0; i < 3 && !isSkipped; ++i)
1258 if (m[i]) // is a boundary
1261 Standard_Integer j = (i + 1) % 3;
1262 // Check if this link was already processed
1263 Standard_Integer aFirstVertex, aLastVertex;
1266 aFirstVertex = v[i];
1271 aFirstVertex = v[j];
1275 if (aCouples.Add(BRepMesh_OrientedEdge(aFirstVertex, aLastVertex)))
1277 // Check deflection on edge 1
1278 gp_XY mi2d = (xy[i] + xy[j]) * 0.5;
1279 gFace->D0(mi2d.X(), mi2d.Y(), pDef);
1280 gp_Lin aLin(p[i], gp_Vec(p[i], p[j]));
1281 aSqDef = aLin.SquareDistance(pDef);
1283 isSkipped = !checkDeflectionAndInsert(pDef, mi2d, theIsFirst,
1284 aSqDef, aSqDefFace, aCircles, theNewVertices, aMaxSqDef);
1291 //check normal on bsplines
1292 if (theIsFirst && !aBSpline.IsNull())
1294 gp_Dir N[3] = { gp::DZ(), gp::DZ(), gp::DZ() };
1295 Standard_Integer aSt[3];
1297 for (Standard_Integer i = 0; i < 3; ++i)
1299 if (aNorMap.IsBound(v[i]))
1301 aSt[i] = aStatMap.Find(v[i]);
1302 N[i] = aNorMap.Find(v[i]);
1306 aSt[i] = GeomLib::NormEstim(aBSpline, gp_Pnt2d(xy[i]), Precision::Confusion(), N[i]);
1307 aStatMap.Bind(v[i], aSt[i]);
1308 aNorMap.Bind(v[i], N[i]);
1312 Standard_Real aAngle[3];
1313 for (Standard_Integer i = 0; i < 3; ++i)
1314 aAngle[i] = N[(i + 1) % 3].Angle(N[i]);
1316 if (aSt[0] < 1 && aSt[1] < 1 && aSt[2] < 1)
1318 if (aAngle[0] > myAngle || aAngle[1] > myAngle || aAngle[2] > myAngle)
1330 if (addVerticesToMesh(theNewVertices, theTrigu))
1334 return (aMaxSqDef < 0) ? aMaxSqDef : Sqrt(aMaxSqDef);
1337 //=======================================================================
1340 //=======================================================================
1341 void BRepMesh_FastDiscretFace::add(const TopoDS_Vertex& theVertex)
1343 if (theVertex.Orientation() != TopAbs_INTERNAL)
1350 gp_Pnt2d aPnt2d = BRep_Tool::Parameters(theVertex, myAttribute->Face());
1351 // check UV values for internal vertices
1352 if (myAttribute->ChangeClassifier()->Perform(aPnt2d) != TopAbs_IN)
1355 NCollection_Handle<FixedVExplorer> aFixedVExplorer = new FixedVExplorer(theVertex);
1356 Standard_Integer aIndex = myAttribute->GetVertexIndex(aFixedVExplorer);
1357 gp_XY anUV = BRepMesh_ShapeTool::FindUV(aIndex, aPnt2d,
1358 theVertex, BRep_Tool::Tolerance(theVertex), myAttribute);
1360 Standard_Integer aTmpId1, aTmpId2;
1361 anUV = myAttribute->Scale(anUV, Standard_True);
1362 myAttribute->AddNode(aIndex, anUV, BRepMesh_Fixed, aTmpId1, aTmpId2);
1364 catch (Standard_Failure)
1369 //=======================================================================
1370 //function : insertVertex
1372 //=======================================================================
1373 void BRepMesh_FastDiscretFace::insertVertex(
1374 const gp_Pnt& thePnt3d,
1376 BRepMesh::ListOfVertex& theVertices)
1378 Standard_Integer aNbLocat = myAttribute->LastPointId();
1379 myAttribute->ChangeSurfacePoints()->Bind(++aNbLocat, thePnt3d);
1381 gp_XY aPnt2d = myAttribute->Scale(theUV, Standard_True);
1382 BRepMesh_Vertex aVertex(aPnt2d, aNbLocat, BRepMesh_Free);
1383 theVertices.Append(aVertex);
1386 //=======================================================================
1387 //function : commitSurfaceTriangulation
1389 //=======================================================================
1390 void BRepMesh_FastDiscretFace::commitSurfaceTriangulation()
1392 if (myAttribute.IsNull() || !myAttribute->IsValid())
1395 const TopoDS_Face& aFace = myAttribute->Face();
1396 BRepMesh_ShapeTool::NullifyFace(aFace);
1398 Handle(BRepMesh_DataStructureOfDelaun)& aStructure = myAttribute->ChangeStructure();
1399 const BRepMesh::MapOfInteger& aTriangles = aStructure->ElementsOfDomain();
1401 if (aTriangles.IsEmpty())
1403 myAttribute->SetStatus(BRepMesh_Failure);
1407 BRepMesh::HIMapOfInteger& aVetrexEdgeMap = myAttribute->ChangeVertexEdgeMap();
1410 Standard_Integer aVerticesNb = aVetrexEdgeMap->Extent();
1411 Standard_Integer aTrianglesNb = aTriangles.Extent();
1412 Handle(Poly_Triangulation) aNewTriangulation =
1413 new Poly_Triangulation(aVerticesNb, aTrianglesNb, Standard_True);
1415 Poly_Array1OfTriangle& aPolyTrianges = aNewTriangulation->ChangeTriangles();
1417 Standard_Integer aTriangeId = 1;
1418 BRepMesh::MapOfInteger::Iterator aTriIt(aTriangles);
1419 for (; aTriIt.More(); aTriIt.Next())
1421 const BRepMesh_Triangle& aCurElem = aStructure->GetElement(aTriIt.Key());
1423 Standard_Integer aNode[3];
1424 aStructure->ElementNodes(aCurElem, aNode);
1426 Standard_Integer aNodeId[3];
1427 for (Standard_Integer i = 0; i < 3; ++i)
1428 aNodeId[i] = aVetrexEdgeMap->FindIndex(aNode[i]);
1430 aPolyTrianges(aTriangeId++).Set(aNodeId[0], aNodeId[1], aNodeId[2]);
1434 TColgp_Array1OfPnt& aNodes = aNewTriangulation->ChangeNodes();
1435 TColgp_Array1OfPnt2d& aNodes2d = aNewTriangulation->ChangeUVNodes();
1437 for (Standard_Integer i = 1; i <= aVerticesNb; ++i)
1439 Standard_Integer aVertexId = aVetrexEdgeMap->FindKey(i);
1440 const BRepMesh_Vertex& aVertex = aStructure->GetNode(aVertexId);
1441 const gp_Pnt& aPoint = myAttribute->GetPoint(aVertex);
1444 aNodes2d(i) = aVertex.Coord();
1447 aNewTriangulation->Deflection(myAttribute->GetDefFace());
1448 BRepMesh_ShapeTool::AddInFace(aFace, aNewTriangulation);
1450 // Delete unused data
1451 myAttribute->ChangeStructure().Nullify();
1452 myAttribute->ChangeSurfacePoints().Nullify();
1453 myAttribute->ChangeSurfaceVertices().Nullify();
1455 myAttribute->ChangeClassifier().Nullify();
1456 myAttribute->ChangeLocation2D().Nullify();
1457 myAttribute->ChangeVertexEdgeMap().Nullify();