#include <IntPatch_CurvIntSurf.hxx>
|
| IntPatch_CurvIntSurf (const Standard_Real U, const Standard_Real V, const Standard_Real W, const IntPatch_CSFunction &F, const Standard_Real TolTangency, const Standard_Real MarginCoef=0.0) |
| compute the solution point with the close point MarginCoef is the coefficient for extension of UV bounds. Ex., UFirst -= MarginCoef*(ULast-UFirst) More...
|
|
| IntPatch_CurvIntSurf (const IntPatch_CSFunction &F, const Standard_Real TolTangency) |
| initialize the parameters to compute the solution More...
|
|
void | Perform (const Standard_Real U, const Standard_Real V, const Standard_Real W, math_FunctionSetRoot &Rsnld, const Standard_Real u0, const Standard_Real v0, const Standard_Real u1, const Standard_Real v1, const Standard_Real w0, const Standard_Real w1) |
| compute the solution it's possible to write to optimize: IntImp_IntCS inter(S1,C1,Toltangency) math_FunctionSetRoot rsnld(Inter.function()) while ...{ u=... v=... w=... inter.Perform(u,v,w,rsnld) } or IntImp_IntCS inter(Toltangency) inter.SetSurface(S); math_FunctionSetRoot rsnld(Inter.function()) while ...{ C=... inter.SetCurve(C); u=... v=... w=... inter.Perform(u,v,w,rsnld) } More...
|
|
Standard_Boolean | IsDone () const |
| Returns TRUE if the creation completed without failure. More...
|
|
Standard_Boolean | IsEmpty () const |
|
const gp_Pnt & | Point () const |
| returns the intersection point The exception NotDone is raised if IsDone is false. The exception DomainError is raised if IsEmpty is true. More...
|
|
Standard_Real | ParameterOnCurve () const |
|
void | ParameterOnSurface (Standard_Real &U, Standard_Real &V) const |
|
IntPatch_CSFunction & | Function () |
| return the math function which is used to compute the intersection More...
|
|
◆ IntPatch_CurvIntSurf() [1/2]
compute the solution point with the close point MarginCoef is the coefficient for extension of UV bounds. Ex., UFirst -= MarginCoef*(ULast-UFirst)
◆ IntPatch_CurvIntSurf() [2/2]
initialize the parameters to compute the solution
◆ Function()
return the math function which is used to compute the intersection
◆ IsDone()
Returns TRUE if the creation completed without failure.
◆ IsEmpty()
◆ ParameterOnCurve()
◆ ParameterOnSurface()
◆ Perform()
compute the solution it's possible to write to optimize: IntImp_IntCS inter(S1,C1,Toltangency) math_FunctionSetRoot rsnld(Inter.function()) while ...{ u=... v=... w=... inter.Perform(u,v,w,rsnld) } or IntImp_IntCS inter(Toltangency) inter.SetSurface(S); math_FunctionSetRoot rsnld(Inter.function()) while ...{ C=... inter.SetCurve(C); u=... v=... w=... inter.Perform(u,v,w,rsnld) }
◆ Point()
const gp_Pnt& IntPatch_CurvIntSurf::Point |
( |
| ) |
const |
returns the intersection point The exception NotDone is raised if IsDone is false. The exception DomainError is raised if IsEmpty is true.
The documentation for this class was generated from the following file: