Provides evaluation methods on an algorithmic patch (based on 4 Curves) defined by its boundaries and blending functions.
More...
|
| | GeomFill_CoonsAlgPatch (const occ::handle< GeomFill_Boundary > &B1, const occ::handle< GeomFill_Boundary > &B2, const occ::handle< GeomFill_Boundary > &B3, const occ::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 (occ::handle< Law_Function > &f1, occ::handle< Law_Function > &f2) const |
| | Give the blending functions.
|
| void | SetFunc (const occ::handle< Law_Function > &f1, const occ::handle< Law_Function > &f2) |
| | Set the blending functions.
|
| gp_Pnt | Value (const double U, const double V) const |
| | Computes the value on the algorithmic patch at parameters U and V.
|
| gp_Vec | D1U (const double U, const double V) const |
| | Computes the d/dU partial derivative on the algorithmic patch at parameters U and V.
|
| gp_Vec | D1V (const double U, const double V) const |
| | Computes the d/dV partial derivative on the algorithmic patch at parameters U and V.
|
| gp_Vec | DUV (const double U, const double 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 int I) const |
| const occ::handle< GeomFill_Boundary > & | Bound (const int I) const |
| const occ::handle< Law_Function > & | Func (const int 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 ()=default |
| | Destructor must be virtual.
|
| virtual const opencascade::handle< Standard_Type > & | DynamicType () const |
| | Returns a type descriptor about this object.
|
| bool | IsInstance (const opencascade::handle< Standard_Type > &theType) const |
| | Returns a true value if this is an instance of Type.
|
| bool | IsInstance (const char *const theTypeName) const |
| | Returns a true value if this is an instance of TypeName.
|
| bool | 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.
|
| bool | IsKind (const char *const 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.
|
| int | GetRefCount () const noexcept |
| | Get the reference counter of this object.
|
| void | IncrementRefCounter () noexcept |
| | Increments the reference counter of this object. Uses relaxed memory ordering since incrementing only requires atomicity, not synchronization with other memory operations.
|
| int | DecrementRefCounter () noexcept |
| | Decrements the reference counter of this object; returns the decremented value. Uses release ordering for the decrement to ensure all writes to the object are visible before the count reaches zero. An acquire fence is added only when the count reaches zero, ensuring proper synchronization before deletion. This is more efficient than using acq_rel for every decrement.
|
| 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.