// Reconstruction - A tool for building cad models from meshes // Copyright (C) 2010-2026 Eric Bechet, Borhen Louhichi // // See the LICENSE file for license information and contributions. // Please report all bugs and problems to . #include "Convert_GridPolynomes_ToPoles.h" Convert_GridPolynomes_ToPoles:: Convert_GridPolynomes_ToPoles( const Standard_Integer MaxUDegree, const Standard_Integer MaxVDegree, const Handle(TColStd_HArray1OfInteger) & NumCoeffPerSurface, const Handle(TColStd_HArray1OfReal) & Coefficients, const Handle(TColStd_HArray1OfReal) & PolynomialUIntervals, const Handle(TColStd_HArray1OfReal) & PolynomialVIntervals) : myDone(Standard_False) { // Les Controles if ((NumCoeffPerSurface->Lower() !=1) || (NumCoeffPerSurface->Upper() != 2)) { Standard_DomainError::Raise("Convert : Wrong Coefficients"); } if ((Coefficients->Lower() !=1) || (Coefficients->Upper() != 3* (MaxUDegree+1) * (MaxVDegree+1))) { Standard_DomainError::Raise("Convert : Wrong Coefficients"); } // Les Degres myUDegree = NumCoeffPerSurface->Value(1)-1; myVDegree = NumCoeffPerSurface->Value(2)-1; if (myUDegree > MaxUDegree) Standard_DomainError::Raise ("Convert : Incoherence beetween NumCoeffPerSurface and MaxUDegree"); if (myVDegree > MaxVDegree) Standard_DomainError::Raise ("Convert : Incoherence beetween NumCoeffPerSurface and MaxVDegree"); Handle(TColStd_HArray2OfInteger) NumCoeff = new(TColStd_HArray2OfInteger)(1, 1, 1, 2); NumCoeff->SetValue(1, 1, NumCoeffPerSurface->Value(1)); NumCoeff->SetValue(1, 2, NumCoeffPerSurface->Value(2)); Perform(0, 0, MaxUDegree, MaxVDegree, NumCoeff, Coefficients, PolynomialUIntervals, PolynomialVIntervals, PolynomialUIntervals, PolynomialVIntervals); } Convert_GridPolynomes_ToPoles:: Convert_GridPolynomes_ToPoles( const Standard_Integer NbUSurfaces, const Standard_Integer NbVSurfaces, const Standard_Integer UContinuity, const Standard_Integer VContinuity, const Standard_Integer MaxUDegree, const Standard_Integer MaxVDegree, const Handle(TColStd_HArray2OfInteger) & NumCoeffPerSurface, const Handle(TColStd_HArray1OfReal) & Coefficients, const Handle(TColStd_HArray1OfReal) & PolynomialUIntervals, const Handle(TColStd_HArray1OfReal) & PolynomialVIntervals, const Handle(TColStd_HArray1OfReal) & TrueUIntervals, const Handle(TColStd_HArray1OfReal) & TrueVIntervals) : myDone(Standard_False) { Standard_Integer ii; Standard_Integer RealUDegree = Max(MaxUDegree, 2*UContinuity + 1); Standard_Integer RealVDegree = Max(MaxVDegree, 2*VContinuity + 1); myUDegree = 0; myVDegree = 0; ///********** B le 01/10/2010 std::cout<<" RealUDegree : "<< RealUDegree <LowerRow() !=1) || (NumCoeffPerSurface->UpperRow() !=NbUSurfaces*NbVSurfaces) || (NumCoeffPerSurface->LowerCol() !=1) || (NumCoeffPerSurface->UpperCol() !=2)) { Standard_DomainError::Raise("Convert : Wrong NumCoeffPerSurface"); } if ((Coefficients->Lower() !=1) || (Coefficients->Upper() != 3*NbUSurfaces*NbVSurfaces* (RealUDegree + 1) * (RealVDegree + 1))) { Standard_DomainError::Raise("Convert : Wrong Coefficients"); } // Calcul des degree for (ii=1; ii<=NbUSurfaces*NbVSurfaces; ii++) { if (NumCoeffPerSurface->Value(ii,1) > myUDegree+1) myUDegree = NumCoeffPerSurface->Value(ii,1)-1; if (NumCoeffPerSurface->Value(ii,2) > myVDegree+1) myVDegree = NumCoeffPerSurface->Value(ii,2)-1; } if (myUDegree > RealUDegree) Standard_DomainError::Raise ("Convert : Incoherence beetween NumCoeffPerSurface and MaxUDegree"); if (myVDegree > RealVDegree) Standard_DomainError::Raise ("Convert : Incoherence beetween NumCoeffPerSurface and MaxVDegree"); Perform(UContinuity, VContinuity, RealUDegree, RealVDegree, NumCoeffPerSurface, Coefficients, PolynomialUIntervals, PolynomialVIntervals, TrueUIntervals, TrueVIntervals); } void Convert_GridPolynomes_ToPoles::Perform(const Standard_Integer UContinuity, const Standard_Integer VContinuity, const Standard_Integer MaxUDegree, const Standard_Integer MaxVDegree, const Handle(TColStd_HArray2OfInteger) & NumCoeffPerSurface, const Handle(TColStd_HArray1OfReal) & Coefficients, const Handle(TColStd_HArray1OfReal) & PolynomialUIntervals, const Handle(TColStd_HArray1OfReal) & PolynomialVIntervals, const Handle(TColStd_HArray1OfReal) & TrueUIntervals, const Handle(TColStd_HArray1OfReal) & TrueVIntervals) { // (1) Construction des Tables monodimensionnelles ---------------------------- Handle(TColStd_HArray1OfReal) UParameters, VParameters; myUKnots = new(TColStd_HArray1OfReal)(1, TrueUIntervals->Length()); myUKnots->ChangeArray1() = TrueUIntervals->Array1(); myVKnots = new(TColStd_HArray1OfReal)(1, TrueVIntervals->Length()); myVKnots->ChangeArray1() = TrueVIntervals->Array1(); BuildArray(myUDegree, myUKnots, UContinuity, myUFlatKnots, myUMults, UParameters); BuildArray(myVDegree, myVKnots, VContinuity, myVFlatKnots, myVMults, VParameters); // (2) Digitalisation ------------------------------------------------------- Standard_Integer ii, jj, Uindex=0, Vindex=0; Standard_Integer Patch_Indice=0; Standard_Real NValue, UValue, VValue; Standard_Integer dimension = 3* (myVDegree+1); Standard_Integer SizPatch = 3 * (MaxUDegree+1) * (MaxVDegree+1); myPoles = new(TColgp_HArray2OfPnt)(1, UParameters->Length(), 1, VParameters->Length()); TColStd_Array1OfReal Patch(1, (myUDegree+1) *dimension); TColStd_Array1OfReal Point(1, 3); Standard_Real * Coeffs = (Standard_Real *) &Patch.ChangeValue(1); Standard_Real * Digit = (Standard_Real *) &Point.ChangeValue(1); for (ii=1, Uindex=1; ii<=UParameters->Length(); ii++) { while (UParameters->Value(ii) > TrueUIntervals->Value(Uindex+1) && Uindex < myUKnots->Length()-1) { Uindex++; } NValue = (UParameters->Value(ii) - TrueUIntervals->Value(Uindex)) / (TrueUIntervals->Value(Uindex+1) - TrueUIntervals->Value(Uindex)); UValue = (1-NValue) * PolynomialUIntervals->Value(1) + NValue * PolynomialUIntervals->Value(2) ; for (jj=1, Vindex=1; jj<=VParameters->Length(); jj++) { while (VParameters->Value(jj) > TrueVIntervals->Value(Vindex+1) && Vindex < myVKnots->Length()-1) { Vindex++; } NValue = (VParameters->Value(jj) - TrueVIntervals->Value(Vindex)) / (TrueVIntervals->Value(Vindex+1) - TrueVIntervals->Value(Vindex)); VValue = (1-NValue) * PolynomialVIntervals->Value(1) + NValue * PolynomialVIntervals->Value(2) ; // (2.1) Extraction du bon Patch if (Patch_Indice != Uindex + (myUKnots->Length()-1) * (Vindex-1)) { Standard_Integer k1, k2, pos, ll=1; Patch_Indice = Uindex + (myUKnots->Length()-1) * (Vindex-1); for (k1 = 1; k1 <= NumCoeffPerSurface->Value(Patch_Indice, 1); k1++) { pos = SizPatch* (Patch_Indice-1) +3* (MaxVDegree+1) * (k1-1) +1; for (k2 = 1; k2 <= NumCoeffPerSurface->Value(Patch_Indice, 2); k2++, pos+=3) { Patch(ll) = Coefficients->Value(pos); Patch(ll+1) = Coefficients->Value(pos+1); Patch(ll+2) = Coefficients->Value(pos+2); ll += 3; } } } // (2.2) Positionnement en UValue,VValue PLib::EvalPoly2Var(UValue,VValue,0,0, NumCoeffPerSurface->Value(Patch_Indice,1)-1, NumCoeffPerSurface->Value(Patch_Indice,2)-1, 3, Coeffs[0], Digit[0]); myPoles->SetValue(ii, jj, gp_Pnt(Digit[0], Digit[1], Digit[2])); } } // (3)Interpolation -------------------------------------------------------------- Standard_Integer InversionProblem; BSplSLib::Interpolate(myUDegree, myVDegree, myUFlatKnots->Array1(), myVFlatKnots->Array1(), UParameters->Array1(), VParameters->Array1(), myPoles->ChangeArray2(), InversionProblem); myDone = (InversionProblem == 0); } void Convert_GridPolynomes_ToPoles::BuildArray(const Standard_Integer Degree, const Handle(TColStd_HArray1OfReal) & Knots, const Standard_Integer Continuity, Handle(TColStd_HArray1OfReal) & FlatKnots, Handle(TColStd_HArray1OfInteger) & Mults, Handle(TColStd_HArray1OfReal) & Parameters) const { Standard_Integer NumCurves = Knots->Length()-1; // Calcul des Multiplicites Standard_Integer ii; Standard_Integer multiplicities = Degree - Continuity; Mults = new(TColStd_HArray1OfInteger)(1, Knots->Length()); for (ii = 2 ; ii < Knots->Length() ; ii++) { Mults ->SetValue(ii,multiplicities) ; } Mults ->SetValue(1, Degree + 1) ; Mults ->SetValue(NumCurves + 1, Degree + 1) ; // Calcul des Noeuds Plats Standard_Integer num_flat_knots = multiplicities * (NumCurves - 1) + 2 * Degree + 2; FlatKnots = new TColStd_HArray1OfReal(1,num_flat_knots) ; BSplCLib::KnotSequence(Knots->Array1(), Mults->Array1(), Degree, Standard_False, FlatKnots->ChangeArray1()); // Calcul du nombre de Poles Standard_Integer num_poles = num_flat_knots - Degree - 1; // Cacul des parametres d'interpolation Parameters = new(TColStd_HArray1OfReal)(1,num_poles); BSplCLib::BuildSchoenbergPoints(Degree, FlatKnots->Array1(), Parameters->ChangeArray1()); } Standard_Integer Convert_GridPolynomes_ToPoles::NbUPoles() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myPoles->ColLength(); } Standard_Integer Convert_GridPolynomes_ToPoles::NbVPoles() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myPoles->RowLength(); } const Handle(TColgp_HArray2OfPnt) & Convert_GridPolynomes_ToPoles::Poles() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myPoles; } Standard_Integer Convert_GridPolynomes_ToPoles::UDegree() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myUDegree; } Standard_Integer Convert_GridPolynomes_ToPoles::VDegree() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myVDegree; } Standard_Integer Convert_GridPolynomes_ToPoles::NbUKnots() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myUKnots->Length(); } Standard_Integer Convert_GridPolynomes_ToPoles::NbVKnots() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myVKnots->Length(); } const Handle(TColStd_HArray1OfReal) & Convert_GridPolynomes_ToPoles::UKnots() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myUKnots; } const Handle(TColStd_HArray1OfReal) & Convert_GridPolynomes_ToPoles::VKnots() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myVKnots; } const Handle(TColStd_HArray1OfInteger) & Convert_GridPolynomes_ToPoles::UMultiplicities() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myUMults; } const Handle(TColStd_HArray1OfInteger) & Convert_GridPolynomes_ToPoles::VMultiplicities() const { StdFail_NotDone_Raise_if(!myDone, "GridPolynomialToPoles"); return myVMults; } Standard_Boolean Convert_GridPolynomes_ToPoles::IsDone() const { return myDone; }