Provides evaluation methods on an algorithmic patch (based on 4 Curves) defined by its boundaries and blending functions.  
 More...
 | 
|   | GeomFill_CoonsAlgPatch (const Handle< GeomFill_Boundary > &B1, const Handle< GeomFill_Boundary > &B2, const Handle< GeomFill_Boundary > &B3, const Handle< GeomFill_Boundary > &B4) | 
|   | Constructs the algorithmic patch. By Default the constructed blending functions are linear. Warning: No control is done on the bounds. B1/B3 and B2/B4 must be same range and well oriented.  
  | 
|   | 
| void  | Func (Handle< Law_Function > &f1, Handle< Law_Function > &f2) const | 
|   | Give the blending functions.  
  | 
|   | 
| void  | SetFunc (const Handle< Law_Function > &f1, const Handle< Law_Function > &f2) | 
|   | Set the blending functions.  
  | 
|   | 
| gp_Pnt  | Value (const Standard_Real U, const Standard_Real V) const | 
|   | Computes the value on the algorithmic patch at parameters U and V.  
  | 
|   | 
| gp_Vec  | D1U (const Standard_Real U, const Standard_Real V) const | 
|   | Computes the d/dU partial derivative on the algorithmic patch at parameters U and V.  
  | 
|   | 
| gp_Vec  | D1V (const Standard_Real U, const Standard_Real V) const | 
|   | Computes the d/dV partial derivative on the algorithmic patch at parameters U and V.  
  | 
|   | 
| gp_Vec  | DUV (const Standard_Real U, const Standard_Real V) const | 
|   | Computes the d2/dUdV partial derivative on the algorithmic patch made with linear blending functions at parameter U and V.  
  | 
|   | 
| const gp_Pnt &  | Corner (const Standard_Integer I) const | 
|   | 
| const Handle< GeomFill_Boundary > &  | Bound (const Standard_Integer I) const | 
|   | 
| const Handle< Law_Function > &  | Func (const Standard_Integer I) const | 
|   | 
  Public Member Functions inherited from Standard_Transient | 
|   | Standard_Transient () | 
|   | Empty constructor.  
  | 
|   | 
|   | Standard_Transient (const Standard_Transient &) | 
|   | Copy constructor – does nothing.  
  | 
|   | 
| Standard_Transient &  | operator= (const Standard_Transient &) | 
|   | Assignment operator, needed to avoid copying reference counter.  
  | 
|   | 
| virtual  | ~Standard_Transient () | 
|   | Destructor must be virtual.  
  | 
|   | 
| virtual const opencascade::handle< Standard_Type > &  | DynamicType () const | 
|   | Returns a type descriptor about this object.  
  | 
|   | 
| Standard_Boolean  | IsInstance (const opencascade::handle< Standard_Type > &theType) const | 
|   | Returns a true value if this is an instance of Type.  
  | 
|   | 
| Standard_Boolean  | IsInstance (const Standard_CString theTypeName) const | 
|   | Returns a true value if this is an instance of TypeName.  
  | 
|   | 
| Standard_Boolean  | IsKind (const opencascade::handle< Standard_Type > &theType) const | 
|   | Returns true if this is an instance of Type or an instance of any class that inherits from Type. Note that multiple inheritance is not supported by OCCT RTTI mechanism.  
  | 
|   | 
| Standard_Boolean  | IsKind (const Standard_CString theTypeName) const | 
|   | Returns true if this is an instance of TypeName or an instance of any class that inherits from TypeName. Note that multiple inheritance is not supported by OCCT RTTI mechanism.  
  | 
|   | 
| Standard_Transient *  | This () const | 
|   | Returns non-const pointer to this object (like const_cast). For protection against creating handle to objects allocated in stack or call from constructor, it will raise exception Standard_ProgramError if reference counter is zero.  
  | 
|   | 
| Standard_Integer  | GetRefCount () const noexcept | 
|   | Get the reference counter of this object.  
  | 
|   | 
| void  | IncrementRefCounter () noexcept | 
|   | Increments the reference counter of this object.  
  | 
|   | 
| Standard_Integer  | DecrementRefCounter () noexcept | 
|   | Decrements the reference counter of this object; returns the decremented value.  
  | 
|   | 
| virtual void  | Delete () const | 
|   | Memory deallocator for transient classes.  
  | 
|   | 
Provides evaluation methods on an algorithmic patch (based on 4 Curves) defined by its boundaries and blending functions.