1 -- Created on: 1993-01-26
2 -- Created by: Laurent PAINNOT
3 -- Copyright (c) 1993-1999 Matra Datavision
4 -- Copyright (c) 1999-2012 OPEN CASCADE SAS
6 -- The content of this file is subject to the Open CASCADE Technology Public
7 -- License Version 6.5 (the "License"). You may not use the content of this file
8 -- except in compliance with the License. Please obtain a copy of the License
9 -- at http://www.opencascade.org and read it completely before using this file.
11 -- The Initial Developer of the Original Code is Open CASCADE S.A.S., having its
12 -- main offices at: 1, place des Freres Montgolfier, 78280 Guyancourt, France.
14 -- The Original Code and all software distributed under the License is
15 -- distributed on an "AS IS" basis, without warranty of any kind, and the
16 -- Initial Developer hereby disclaims all such warranties, including without
17 -- limitation, any warranties of merchantability, fitness for a particular
18 -- purpose or non-infringement. Please see the License for the specific terms
19 -- and conditions governing the rights and limitations under the License.
26 ---Purpose: This package provides algorithms approximating a function
27 -- that can be multidimensional creating in the end a
28 -- BSpline function with the required continuity
45 class ApproxAFunction from AdvApprox ;
47 -- this approximate a given function
49 -- class ApproxAFunction;
51 imported EvaluatorFunction ;
53 -- typedef void (*EvaluatorFunction) (
59 -- Standard_Integer *) ;
62 deferred class Cutting;
64 -- this class is used to choose the way of cutting if needed
68 -- inherits class Cutting;
69 -- if Cutting is necessary in [a,b], we cut at (a+b) / 2.
74 -- inherits class Cutting; contains a list of preferential points (di)i
75 -- if Cutting is necessary in [a,b], we cut at the di nearest from (a+b)/2.
79 -- inherits class Cutting; contains two lists of preferential points to
80 -- manage to level of preferential cutting.
81 -- if Cutting is necessary in [a,b], we cut at the di nearest from (a+b)/2