1 // Created on: 1991-08-26
3 // Copyright (c) 1991-1999 Matra Datavision
4 // Copyright (c) 1999-2014 OPEN CASCADE SAS
6 // This file is part of Open CASCADE Technology software library.
8 // This library is free software; you can redistribute it and/or modify it under
9 // the terms of the GNU Lesser General Public License version 2.1 as published
10 // by the Free Software Foundation, with special exception defined in the file
11 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12 // distribution for complete text of the license and disclaimer of any warranty.
14 // Alternatively, this file may be used under the terms of Open CASCADE
15 // commercial license or contractual agreement.
17 #ifndef _BSplSLib_HeaderFile
18 #define _BSplSLib_HeaderFile
20 #include <BSplSLib_EvaluatorFunction.hxx>
21 #include <Standard.hxx>
22 #include <Standard_DefineAlloc.hxx>
23 #include <TColgp_Array1OfPnt.hxx>
24 #include <TColgp_Array2OfPnt.hxx>
25 #include <TColStd_Array1OfInteger.hxx>
26 #include <TColStd_Array1OfReal.hxx>
27 #include <TColStd_Array2OfReal.hxx>
32 //! BSplSLib B-spline surface Library
33 //! This package provides an implementation of geometric
34 //! functions for rational and non rational, periodic and non
35 //! periodic B-spline surface computation.
37 //! this package uses the multi-dimensions splines methods
38 //! provided in the package BSplCLib.
40 //! In this package the B-spline surface is defined with :
41 //! . its control points : Array2OfPnt Poles
42 //! . its weights : Array2OfReal Weights
43 //! . its knots and their multiplicity in the two parametric
44 //! direction U and V : Array1OfReal UKnots, VKnots and
45 //! Array1OfInteger UMults, VMults.
46 //! . the degree of the normalized Spline functions :
49 //! . the Booleans URational, VRational to know if the weights
50 //! are constant in the U or V direction.
52 //! . the Booleans UPeriodic, VRational to know if the the
53 //! surface is periodic in the U or V direction.
55 //! Warnings : The bounds of UKnots and UMults should be the
56 //! same, the bounds of VKnots and VMults should be the same,
57 //! the bounds of Poles and Weights should be the same.
59 //! The Control points representation is :
60 //! Poles(Uorigin,Vorigin) ...................Poles(Uorigin,Vend)
63 //! Poles(Uend, Vorigin) .....................Poles(Uend, Vend)
65 //! For the double array the row indice corresponds to the
66 //! parametric U direction and the columns indice corresponds
67 //! to the parametric V direction.
69 //! Note: weight and multiplicity arrays can be passed by pointer for
70 //! some functions so that NULL pointer is valid.
71 //! That means no weights/no multiplicities passed.
74 //! B-spline surface, Functions, Library
77 //! . A survey of curve and surface methods in CADG Wolfgang BOHM
79 //! . On de Boor-like algorithms and blossoming Wolfgang BOEHM
81 //! . Blossoming and knot insertion algorithms for B-spline curves
83 //! . Modelisation des surfaces en CAO, Henri GIAUME Peugeot SA
84 //! . Curves and Surfaces for Computer Aided Geometric Design,
85 //! a practical guide Gerald Farin
94 //! this is a one dimensional function
95 //! typedef void (*EvaluatorFunction) (
96 //! Standard_Integer // Derivative Request
97 //! Standard_Real * // StartEnd[2][2]
102 //! Standard_Real // UParameter
103 //! Standard_Real // VParamerer
104 //! Standard_Real & // Result
105 //! Standard_Integer &) ;// Error Code
106 //! serves to multiply a given vectorial BSpline by a function
107 //! Computes the derivatives of a ratio of
108 //! two-variables functions x(u,v) / w(u,v) at orders
109 //! <N,M>, x(u,v) is a vector in dimension
112 //! <Ders> is an array containing the values of the
113 //! input derivatives from 0 to Min(<N>,<UDeg>), 0 to
114 //! Min(<M>,<VDeg>). For orders higher than
115 //! <UDeg,VDeg> the input derivatives are assumed to
118 //! The <Ders> is a 2d array and the dimension of the
119 //! lines is always (<VDeg>+1) * (<3>+1), even
120 //! if <N> is smaller than <Udeg> (the derivatives
121 //! higher than <N> are not used).
123 //! Content of <Ders> :
125 //! x(i,j)[k] means : the composant k of x derivated
126 //! (i) times in u and (j) times in v.
128 //! ... First line ...
130 //! x[1],x[2],...,x[3],w
131 //! x(0,1)[1],...,x(0,1)[3],w(1,0)
133 //! x(0,VDeg)[1],...,x(0,VDeg)[3],w(0,VDeg)
135 //! ... Then second line ...
137 //! x(1,0)[1],...,x(1,0)[3],w(1,0)
138 //! x(1,1)[1],...,x(1,1)[3],w(1,1)
140 //! x(1,VDeg)[1],...,x(1,VDeg)[3],w(1,VDeg)
144 //! ... Last line ...
146 //! x(UDeg,0)[1],...,x(UDeg,0)[3],w(UDeg,0)
147 //! x(UDeg,1)[1],...,x(UDeg,1)[3],w(UDeg,1)
149 //! x(Udeg,VDeg)[1],...,x(UDeg,VDeg)[3],w(Udeg,VDeg)
151 //! If <All> is false, only the derivative at order
152 //! <N,M> is computed. <RDers> is an array of length
153 //! 3 which will contain the result :
155 //! x(1)/w , x(2)/w , ... derivated <N> <M> times
157 //! If <All> is true multiples derivatives are
158 //! computed. All the derivatives (i,j) with 0 <= i+j
159 //! <= Max(N,M) are computed. <RDers> is an array of
160 //! length 3 * (<N>+1) * (<M>+1) which will
163 //! x(1)/w , x(2)/w , ...
164 //! x(1)/w , x(2)/w , ... derivated <0,1> times
165 //! x(1)/w , x(2)/w , ... derivated <0,2> times
167 //! x(1)/w , x(2)/w , ... derivated <0,N> times
169 //! x(1)/w , x(2)/w , ... derivated <1,0> times
170 //! x(1)/w , x(2)/w , ... derivated <1,1> times
172 //! x(1)/w , x(2)/w , ... derivated <1,N> times
174 //! x(1)/w , x(2)/w , ... derivated <N,0> times
176 //! Warning: <RDers> must be dimensionned properly.
177 Standard_EXPORT static void RationalDerivative (const Standard_Integer UDeg, const Standard_Integer VDeg, const Standard_Integer N, const Standard_Integer M, Standard_Real& Ders, Standard_Real& RDers, const Standard_Boolean All = Standard_True);
179 Standard_EXPORT static void D0 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Pnt& P);
181 Standard_EXPORT static void D1 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer Degree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Pnt& P, gp_Vec& Vu, gp_Vec& Vv);
183 Standard_EXPORT static void D2 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Pnt& P, gp_Vec& Vu, gp_Vec& Vv, gp_Vec& Vuu, gp_Vec& Vvv, gp_Vec& Vuv);
185 Standard_EXPORT static void D3 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Pnt& P, gp_Vec& Vu, gp_Vec& Vv, gp_Vec& Vuu, gp_Vec& Vvv, gp_Vec& Vuv, gp_Vec& Vuuu, gp_Vec& Vvvv, gp_Vec& Vuuv, gp_Vec& Vuvv);
187 Standard_EXPORT static void DN (const Standard_Real U, const Standard_Real V, const Standard_Integer Nu, const Standard_Integer Nv, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Vec& Vn);
189 //! Computes the poles and weights of an isoparametric
190 //! curve at parameter <Param> (UIso if <IsU> is True,
192 Standard_EXPORT static void Iso (const Standard_Real Param, const Standard_Boolean IsU, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger* Mults, const Standard_Integer Degree, const Standard_Boolean Periodic, TColgp_Array1OfPnt& CPoles, TColStd_Array1OfReal* CWeights);
194 //! Reverses the array of poles. Last is the Index of
195 //! the new first Row( Col) of Poles.
196 //! On a non periodic surface Last is
198 //! On a periodic curve last is
199 //! (number of flat knots - degree - 1)
201 //! (sum of multiplicities(but for the last) + degree
203 Standard_EXPORT static void Reverse (TColgp_Array2OfPnt& Poles, const Standard_Integer Last, const Standard_Boolean UDirection);
205 //! Makes an homogeneous evaluation of Poles and Weights
206 //! any and returns in P the Numerator value and
207 //! in W the Denominator value if Weights are present
208 //! otherwise returns 1.0e0
209 Standard_EXPORT static void HomogeneousD0 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, Standard_Real& W, gp_Pnt& P);
211 //! Makes an homogeneous evaluation of Poles and Weights
212 //! any and returns in P the Numerator value and
213 //! in W the Denominator value if Weights are present
214 //! otherwise returns 1.0e0
215 Standard_EXPORT static void HomogeneousD1 (const Standard_Real U, const Standard_Real V, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, gp_Pnt& N, gp_Vec& Nu, gp_Vec& Nv, Standard_Real& D, Standard_Real& Du, Standard_Real& Dv);
217 //! Reverses the array of weights.
218 Standard_EXPORT static void Reverse (TColStd_Array2OfReal& Weights, const Standard_Integer Last, const Standard_Boolean UDirection);
221 //! Returns False if all the weights of the array <Weights>
222 //! in the area [I1,I2] * [J1,J2] are identic.
223 //! Epsilon is used for comparing weights.
224 //! If Epsilon is 0. the Epsilon of the first weight is used.
225 Standard_EXPORT static Standard_Boolean IsRational (const TColStd_Array2OfReal& Weights, const Standard_Integer I1, const Standard_Integer I2, const Standard_Integer J1, const Standard_Integer J2, const Standard_Real Epsilon = 0.0);
227 //! Copy in FP the coordinates of the poles.
228 Standard_EXPORT static void SetPoles (const TColgp_Array2OfPnt& Poles, TColStd_Array1OfReal& FP, const Standard_Boolean UDirection);
230 //! Copy in FP the coordinates of the poles.
231 Standard_EXPORT static void SetPoles (const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal& Weights, TColStd_Array1OfReal& FP, const Standard_Boolean UDirection);
233 //! Get from FP the coordinates of the poles.
234 Standard_EXPORT static void GetPoles (const TColStd_Array1OfReal& FP, TColgp_Array2OfPnt& Poles, const Standard_Boolean UDirection);
236 //! Get from FP the coordinates of the poles.
237 Standard_EXPORT static void GetPoles (const TColStd_Array1OfReal& FP, TColgp_Array2OfPnt& Poles, TColStd_Array2OfReal& Weights, const Standard_Boolean UDirection);
239 //! Find the new poles which allows an old point (with a
240 //! given u,v as parameters) to reach a new position
241 //! UIndex1,UIndex2 indicate the range of poles we can
243 //! (1, UNbPoles-1) or (2, UNbPoles) -> no constraint
244 //! for one side in U
245 //! (2, UNbPoles-1) -> the ends are enforced for U
246 //! don't enter (1,NbPoles) and (1,VNbPoles)
247 //! -> error: rigid move
248 //! if problem in BSplineBasis calculation, no change
249 //! for the curve and
250 //! UFirstIndex, VLastIndex = 0
251 //! VFirstIndex, VLastIndex = 0
252 Standard_EXPORT static void MovePoint (const Standard_Real U, const Standard_Real V, const gp_Vec& Displ, const Standard_Integer UIndex1, const Standard_Integer UIndex2, const Standard_Integer VIndex1, const Standard_Integer VIndex2, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean Rational, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal& Weights, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, Standard_Integer& UFirstIndex, Standard_Integer& ULastIndex, Standard_Integer& VFirstIndex, Standard_Integer& VLastIndex, TColgp_Array2OfPnt& NewPoles);
254 Standard_EXPORT static void InsertKnots (const Standard_Boolean UDirection, const Standard_Integer Degree, const Standard_Boolean Periodic, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger& Mults, const TColStd_Array1OfReal& AddKnots, const TColStd_Array1OfInteger* AddMults, TColgp_Array2OfPnt& NewPoles, TColStd_Array2OfReal* NewWeights, TColStd_Array1OfReal& NewKnots, TColStd_Array1OfInteger& NewMults, const Standard_Real Epsilon, const Standard_Boolean Add = Standard_True);
256 Standard_EXPORT static Standard_Boolean RemoveKnot (const Standard_Boolean UDirection, const Standard_Integer Index, const Standard_Integer Mult, const Standard_Integer Degree, const Standard_Boolean Periodic, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger& Mults, TColgp_Array2OfPnt& NewPoles, TColStd_Array2OfReal* NewWeights, TColStd_Array1OfReal& NewKnots, TColStd_Array1OfInteger& NewMults, const Standard_Real Tolerance);
258 Standard_EXPORT static void IncreaseDegree (const Standard_Boolean UDirection, const Standard_Integer Degree, const Standard_Integer NewDegree, const Standard_Boolean Periodic, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger& Mults, TColgp_Array2OfPnt& NewPoles, TColStd_Array2OfReal* NewWeights, TColStd_Array1OfReal& NewKnots, TColStd_Array1OfInteger& NewMults);
260 Standard_EXPORT static void Unperiodize (const Standard_Boolean UDirection, const Standard_Integer Degree, const TColStd_Array1OfInteger& Mults, const TColStd_Array1OfReal& Knots, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, TColStd_Array1OfInteger& NewMults, TColStd_Array1OfReal& NewKnots, TColgp_Array2OfPnt& NewPoles, TColStd_Array2OfReal* NewWeights);
262 //! Used as argument for a non rational curve.
263 static TColStd_Array2OfReal* NoWeights();
265 //! Perform the evaluation of the Taylor expansion
266 //! of the Bspline normalized between 0 and 1.
267 //! If rational computes the homogeneous Taylor expension
268 //! for the numerator and stores it in CachePoles
269 Standard_EXPORT static void BuildCache (const Standard_Real U, const Standard_Real V, const Standard_Real USpanDomain, const Standard_Real VSpanDomain, const Standard_Boolean UPeriodicFlag, const Standard_Boolean VPeriodicFlag, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, TColgp_Array2OfPnt& CachePoles, TColStd_Array2OfReal* CacheWeights);
271 //! Perform the evaluation of the Taylor expansion
272 //! of the Bspline normalized between 0 and 1.
273 //! Structure of result optimized for BSplSLib_Cache.
274 Standard_EXPORT static void BuildCache (const Standard_Real theU, const Standard_Real theV, const Standard_Real theUSpanDomain, const Standard_Real theVSpanDomain, const Standard_Boolean theUPeriodic, const Standard_Boolean theVPeriodic, const Standard_Integer theUDegree, const Standard_Integer theVDegree, const Standard_Integer theUIndex, const Standard_Integer theVIndex, const TColStd_Array1OfReal& theUFlatKnots, const TColStd_Array1OfReal& theVFlatKnots, const TColgp_Array2OfPnt& thePoles, const TColStd_Array2OfReal* theWeights, TColStd_Array2OfReal& theCacheArray);
276 //! Perform the evaluation of the of the cache
277 //! the parameter must be normalized between
278 //! the 0 and 1 for the span.
279 //! The Cache must be valid when calling this
280 //! routine. Geom Package will insure that.
281 //! and then multiplies by the weights
282 //! this just evaluates the current point
283 //! the CacheParameter is where the Cache was
284 //! constructed the SpanLength is to normalize
285 //! the polynomial in the cache to avoid bad conditioning
287 Standard_EXPORT static void CacheD0 (const Standard_Real U, const Standard_Real V, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Real UCacheParameter, const Standard_Real VCacheParameter, const Standard_Real USpanLenght, const Standard_Real VSpanLength, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point);
289 //! Calls CacheD0 for Bezier Surfaces Arrays computed with
290 //! the method PolesCoefficients.
291 //! Warning: To be used for BezierSurfaces ONLY!!!
292 static void CoefsD0 (const Standard_Real U, const Standard_Real V, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point);
294 //! Perform the evaluation of the of the cache
295 //! the parameter must be normalized between
296 //! the 0 and 1 for the span.
297 //! The Cache must be valid when calling this
298 //! routine. Geom Package will insure that.
299 //! and then multiplies by the weights
300 //! this just evaluates the current point
301 //! the CacheParameter is where the Cache was
302 //! constructed the SpanLength is to normalize
303 //! the polynomial in the cache to avoid bad conditioning
305 Standard_EXPORT static void CacheD1 (const Standard_Real U, const Standard_Real V, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Real UCacheParameter, const Standard_Real VCacheParameter, const Standard_Real USpanLenght, const Standard_Real VSpanLength, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point, gp_Vec& VecU, gp_Vec& VecV);
307 //! Calls CacheD0 for Bezier Surfaces Arrays computed with
308 //! the method PolesCoefficients.
309 //! Warning: To be used for BezierSurfaces ONLY!!!
310 static void CoefsD1 (const Standard_Real U, const Standard_Real V, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point, gp_Vec& VecU, gp_Vec& VecV);
312 //! Perform the evaluation of the of the cache
313 //! the parameter must be normalized between
314 //! the 0 and 1 for the span.
315 //! The Cache must be valid when calling this
316 //! routine. Geom Package will insure that.
317 //! and then multiplies by the weights
318 //! this just evaluates the current point
319 //! the CacheParameter is where the Cache was
320 //! constructed the SpanLength is to normalize
321 //! the polynomial in the cache to avoid bad conditioning
323 Standard_EXPORT static void CacheD2 (const Standard_Real U, const Standard_Real V, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Real UCacheParameter, const Standard_Real VCacheParameter, const Standard_Real USpanLenght, const Standard_Real VSpanLength, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point, gp_Vec& VecU, gp_Vec& VecV, gp_Vec& VecUU, gp_Vec& VecUV, gp_Vec& VecVV);
325 //! Calls CacheD0 for Bezier Surfaces Arrays computed with
326 //! the method PolesCoefficients.
327 //! Warning: To be used for BezierSurfaces ONLY!!!
328 static void CoefsD2 (const Standard_Real U, const Standard_Real V, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, gp_Pnt& Point, gp_Vec& VecU, gp_Vec& VecV, gp_Vec& VecUU, gp_Vec& VecUV, gp_Vec& VecVV);
330 //! Warning! To be used for BezierSurfaces ONLY!!!
331 static void PolesCoefficients (const TColgp_Array2OfPnt& Poles, TColgp_Array2OfPnt& CachePoles);
333 //! Encapsulation of BuildCache to perform the
334 //! evaluation of the Taylor expansion for beziersurfaces
335 //! at parameters 0.,0.;
336 //! Warning: To be used for BezierSurfaces ONLY!!!
337 Standard_EXPORT static void PolesCoefficients (const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, TColgp_Array2OfPnt& CachePoles, TColStd_Array2OfReal* CacheWeights);
339 //! Given a tolerance in 3D space returns two
340 //! tolerances, one in U one in V such that for
341 //! all (u1,v1) and (u0,v0) in the domain of
342 //! the surface f(u,v) we have :
343 //! | u1 - u0 | < UTolerance and
344 //! | v1 - v0 | < VTolerance
345 //! we have |f (u1,v1) - f (u0,v0)| < Tolerance3D
346 Standard_EXPORT static void Resolution (const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UKnots, const TColStd_Array1OfReal& VKnots, const TColStd_Array1OfInteger& UMults, const TColStd_Array1OfInteger& VMults, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Boolean URat, const Standard_Boolean VRat, const Standard_Boolean UPer, const Standard_Boolean VPer, const Standard_Real Tolerance3D, Standard_Real& UTolerance, Standard_Real& VTolerance);
348 //! Performs the interpolation of the data points given in
349 //! the Poles array in the form
350 //! [1,...,RL][1,...,RC][1...PolesDimension] . The
351 //! ColLength CL and the Length of UParameters must be the
352 //! same. The length of VFlatKnots is VDegree + CL + 1.
354 //! The RowLength RL and the Length of VParameters must be
355 //! the same. The length of VFlatKnots is Degree + RL + 1.
357 //! Warning: the method used to do that interpolation
358 //! is gauss elimination WITHOUT pivoting. Thus if the
359 //! diagonal is not dominant there is no guarantee that
360 //! the algorithm will work. Nevertheless for Cubic
361 //! interpolation at knots or interpolation at Scheonberg
362 //! points the method will work. The InversionProblem
363 //! will report 0 if there was no problem else it will
364 //! give the index of the faulty pivot
365 Standard_EXPORT static void Interpolate (const Standard_Integer UDegree, const Standard_Integer VDegree, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const TColStd_Array1OfReal& UParameters, const TColStd_Array1OfReal& VParameters, TColgp_Array2OfPnt& Poles, TColStd_Array2OfReal& Weights, Standard_Integer& InversionProblem);
367 //! Performs the interpolation of the data points given in
369 //! The ColLength CL and the Length of UParameters must be
370 //! the same. The length of VFlatKnots is VDegree + CL + 1.
372 //! The RowLength RL and the Length of VParameters must be
373 //! the same. The length of VFlatKnots is Degree + RL + 1.
375 //! Warning: the method used to do that interpolation
376 //! is gauss elimination WITHOUT pivoting. Thus if the
377 //! diagonal is not dominant there is no guarantee that
378 //! the algorithm will work. Nevertheless for Cubic
379 //! interpolation at knots or interpolation at Scheonberg
380 //! points the method will work. The InversionProblem
381 //! will report 0 if there was no problem else it will
382 //! give the index of the faulty pivot
383 Standard_EXPORT static void Interpolate (const Standard_Integer UDegree, const Standard_Integer VDegree, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const TColStd_Array1OfReal& UParameters, const TColStd_Array1OfReal& VParameters, TColgp_Array2OfPnt& Poles, Standard_Integer& InversionProblem);
385 //! this will multiply a given BSpline numerator N(u,v)
386 //! and denominator D(u,v) defined by its
387 //! U/VBSplineDegree and U/VBSplineKnots, and
388 //! U/VMults. Its Poles and Weights are arrays which are
389 //! coded as array2 of the form
390 //! [1..UNumPoles][1..VNumPoles] by a function a(u,v)
391 //! which is assumed to satisfy the following : 1.
392 //! a(u,v) * N(u,v) and a(u,v) * D(u,v) is a polynomial
393 //! BSpline that can be expressed exactly as a BSpline of
394 //! degree U/VNewDegree on the knots U/VFlatKnots 2. the range
395 //! of a(u,v) is the same as the range of N(u,v)
397 //! ---Warning: it is the caller's responsibility to
398 //! insure that conditions 1. and 2. above are satisfied
399 //! : no check whatsoever is made in this method --
400 //! theStatus will return 0 if OK else it will return the
401 //! pivot index -- of the matrix that was inverted to
402 //! compute the multiplied -- BSpline : the method used
403 //! is interpolation at Schoenenberg -- points of
404 //! a(u,v)* N(u,v) and a(u,v) * D(u,v)
405 //! theStatus will return 0 if OK else it will return the pivot index
406 //! of the matrix that was inverted to compute the multiplied
407 //! BSpline : the method used is interpolation at Schoenenberg
408 //! points of a(u,v)*F(u,v)
410 Standard_EXPORT static void FunctionMultiply (const BSplSLib_EvaluatorFunction& Function, const Standard_Integer UBSplineDegree, const Standard_Integer VBSplineDegree, const TColStd_Array1OfReal& UBSplineKnots, const TColStd_Array1OfReal& VBSplineKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const Standard_Integer UNewDegree, const Standard_Integer VNewDegree, TColgp_Array2OfPnt& NewNumerator, TColStd_Array2OfReal& NewDenominator, Standard_Integer& theStatus);
430 #include <BSplSLib.lxx>
436 #endif // _BSplSLib_HeaderFile