|
| | IntPatch_Intersection () |
| |
| | IntPatch_Intersection (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Handle< Adaptor3d_HSurface > &S2, const Handle< Adaptor3d_TopolTool > &D2, const Standard_Real TolArc, const Standard_Real TolTang) |
| |
| | IntPatch_Intersection (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Standard_Real TolArc, const Standard_Real TolTang) |
| |
| void | SetTolerances (const Standard_Real TolArc, const Standard_Real TolTang, const Standard_Real UVMaxStep, const Standard_Real Fleche) |
| | Set the tolerances used by the algorithms: — Implicit - Parametric — Parametric - Parametric — Implicit - Implicit. More...
|
| |
| void | Perform (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Handle< Adaptor3d_HSurface > &S2, const Handle< Adaptor3d_TopolTool > &D2, const Standard_Real TolArc, const Standard_Real TolTang, const Standard_Boolean isGeomInt=Standard_True) |
| |
| void | Perform (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Handle< Adaptor3d_HSurface > &S2, const Handle< Adaptor3d_TopolTool > &D2, const Standard_Real TolArc, const Standard_Real TolTang, IntSurf_ListOfPntOn2S &LOfPnts, const Standard_Boolean RestrictLine=Standard_True, const Standard_Boolean isGeomInt=Standard_True) |
| | If isGeomInt == Standard_False, then method Param-Param intersection will be used. More...
|
| |
| void | Perform (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Handle< Adaptor3d_HSurface > &S2, const Handle< Adaptor3d_TopolTool > &D2, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2, const Standard_Real TolArc, const Standard_Real TolTang) |
| |
| void | Perform (const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Standard_Real TolArc, const Standard_Real TolTang) |
| |
| Standard_Boolean | IsDone () const |
| | Returns True if the calculus was succesfull. More...
|
| |
| Standard_Boolean | IsEmpty () const |
| | Returns true if the is no intersection. More...
|
| |
| Standard_Boolean | TangentFaces () const |
| | Returns True if the two patches are considered as entierly tangent, i-e every restriction arc of one patch is inside the geometric base of the other patch. More...
|
| |
| Standard_Boolean | OppositeFaces () const |
| | Returns True when the TangentFaces returns True and the normal vectors evaluated at a point on the first and the second surface are opposite. The exception DomainError is raised if TangentFaces returns False. More...
|
| |
| Standard_Integer | NbPnts () const |
| | Returns the number of "single" points. More...
|
| |
| const IntPatch_Point & | Point (const Standard_Integer Index) const |
| | Returns the point of range Index. An exception is raised if Index<=0 or Index>NbPnt. More...
|
| |
| Standard_Integer | NbLines () const |
| | Returns the number of intersection lines. More...
|
| |
| const Handle< IntPatch_Line > & | Line (const Standard_Integer Index) const |
| | Returns the line of range Index. An exception is raised if Index<=0 or Index>NbLine. More...
|
| |
| const IntPatch_SequenceOfLine & | SequenceOfLine () const |
| |
| void | Dump (const Standard_Integer Mode, const Handle< Adaptor3d_HSurface > &S1, const Handle< Adaptor3d_TopolTool > &D1, const Handle< Adaptor3d_HSurface > &S2, const Handle< Adaptor3d_TopolTool > &D2) const |
| | Dump of each result line. Mode for more accurate dumps. More...
|
| |
This class provides a generic algorithm to intersect 2 surfaces.
Set the tolerances used by the algorithms: — Implicit - Parametric — Parametric - Parametric — Implicit - Implicit.
TolArc is used to compute the intersections between the restrictions of a surface and a walking line.
TolTang is used to compute the points on a walking line, and in geometric algorithms.
Fleche is a parameter used in the walking algorithms to provide small curvatures on a line.
UVMaxStep is a parameter used in the walking algorithms to compute the distance between to points in their respective parametrtic spaces.