lili/OCCT
1
0
Fork 0
mirror of https://github.com/Open-Cascade-SAS/OCCT.git synced 2026-08-17 08:55:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Documentation - Fix whitespaces and typos (#819)

Browse Source 
- Fixed inconsistent whitespace and line breaks in comments
- Corrected spelling errors ("witch" → "which", "sprcified" → "specified", "nul" → "null", etc.)
- Improved formatting consistency in documentation comments
This commit is contained in:
luzpaz
2025-11-12 13:06:11 -05:00
committed by GitHub
parent 61d69fde9e
commit ed1d0c88cc
164 changed files with 765 additions and 770 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/ModelingAlgorithms/TKBO/IntTools/IntTools_CommonPrt.hxx
+1 -1
View File
@@ -77,7 +77,7 @@ public:
//! Returns the second edge
Standard_EXPORT const TopoDS_Edge& Edge2() const;
//! Returns the type of the common part
//! Returns the type of the common part
Standard_EXPORT TopAbs_ShapeEnum Type() const;
//! Returns the range of first edge
src/ModelingAlgorithms/TKBO/IntTools/IntTools_FClass2d.hxx
+1 -1
View File
@@ -63,7 +63,7 @@ public:
//! Test a point with +- an offset (Tol) and returns
//! On if some points are OUT an some are IN
//! (Caution: Internal use . see the code for more details)
//! (Caution: Internal use. see the code for more details)
Standard_EXPORT TopAbs_State
TestOnRestriction(const gp_Pnt2d& Puv,
const Standard_Real Tol,
src/ModelingAlgorithms/TKBool/BRepAlgo/BRepAlgo.hxx
+3 -3
View File
@@ -67,9 +67,9 @@ public:
//! <Standard_False>, else returns <Standard_True>.
Standard_EXPORT static Standard_Boolean IsValid(const TopoDS_Shape& S);
//! Checks if the Generated and Modified Faces from
//! the shapes <arguments> in the shape <result> are
//! "correct". The args may be empty, then all faces
//! Checks if the Generated and Modified Faces from
//! the shapes <arguments> in the shape <result> are
//! "correct". The args may be empty, then all faces
//! will be checked.
//! If <Closed> is True, only closed shape are valid.
//! If <GeomCtrl> is False the geometry of new
src/ModelingAlgorithms/TKBool/BRepFill/BRepFill_Evolved.hxx
+1 -1
View File
@@ -56,7 +56,7 @@ public:
const GeomAbs_JoinType Join = GeomAbs_Arc,
const Standard_Boolean Solid = Standard_False);
//! Creates an evolved shape by sweeping the <Profile>
//! Creates an evolved shape by sweeping the <Profile>
//! along the <Spine>
Standard_EXPORT BRepFill_Evolved(const TopoDS_Face& Spine,
const TopoDS_Wire& Profile,
src/ModelingAlgorithms/TKFeat/BRepFeat/BRepFeat_MakeRevolutionForm.hxx
+1 -1
View File
@@ -89,7 +89,7 @@ public:
Standard_Boolean& Sliding);
//! Indicates that the edge <E> will slide on the face
//! <OnFace>. Raises ConstructionError if the face does not belong to the
//! <OnFace>. Raises ConstructionError if the face does not belong to the
//! basis shape, or the edge to the prismed shape.
Standard_EXPORT void Add(const TopoDS_Edge& E, const TopoDS_Face& OnFace);
src/ModelingAlgorithms/TKFeat/LocOpe/LocOpe_SplitShape.hxx
+1 -1
View File
@@ -42,7 +42,7 @@ public:
//! Empty constructor.
LocOpe_SplitShape();
//! Creates the process with the shape <S>.
//! Creates the process with the shape <S>.
LocOpe_SplitShape(const TopoDS_Shape& S);
//! Initializes the process on the shape <S>.
src/ModelingAlgorithms/TKFillet/BRepBlend/BRepBlend_AppFuncRoot.hxx
+1 -1
View File
@@ -149,7 +149,7 @@ public:
Standard_EXPORT virtual Standard_Real MaximalSection() const Standard_OVERRIDE;
//! Compute the minimal value of weight for each poles
//! of all sections. This information is useful to
//! of all sections. This information is useful to
//! perform well conditioned rational approximation.
Standard_EXPORT virtual void GetMinimalWeight(TColStd_Array1OfReal& Weigths) const
Standard_OVERRIDE;
src/ModelingAlgorithms/TKFillet/BRepBlend/BRepBlend_SurfRstEvolRad.hxx
+2 -2
View File
@@ -162,9 +162,9 @@ public:
//! <S>. May be one if Continuity(me) >= <S>
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals(TColStd_Array1OfReal& T,
const GeomAbs_Shape S) const Standard_OVERRIDE;
src/ModelingAlgorithms/TKFillet/BRepFilletAPI/BRepFilletAPI_MakeFillet.hxx
+2 -2
View File
@@ -72,7 +72,7 @@ public:
//! InternalContinuity to produce fillet'surfaces with
//! an continuity Ci (i=0,1 or 2).
//! By defaultInternalContinuity = GeomAbs_C1.
//! AngularTolerance is the G1 tolerance between fillet
//! AngularTolerance is the G1 tolerance between fillet
//! and support'faces.
Standard_EXPORT void SetContinuity(const GeomAbs_Shape InternalContinuity,
const Standard_Real AngularTolerance);
@@ -142,7 +142,7 @@ public:
//! in the array UandR as follows:
//! - the X coordinate of a point in UandR defines a
//! relative parameter on the contour (i.e. a parameter between 0 and 1),
//! - the Y coordinate of a point in UandR gives the
//! - the Y coordinate of a point in UandR gives the
//! corresponding value of the radius, and the radius evolves
//! between the first and last vertices of the contour of index IC.
Standard_EXPORT void SetRadius(const TColgp_Array1OfPnt2d& UandR,
src/ModelingAlgorithms/TKFillet/ChFi2d/ChFi2d_ConstructionError.hxx
+1 -1
View File
@@ -35,7 +35,7 @@ enum ChFi2d_ConstructionError
ChFi2d_LastEdgeDegenerated, //!< the last edge is degenerated
ChFi2d_BothEdgesDegenerated, //!< the two edges are degenerated
ChFi2d_NotAuthorized //!< One or the two edges connected to the vertex is a fillet or a chamfer;
//! One or the two edges connected to the vertex is not a line or a circle
//!< One or the two edges connected to the vertex is not a line or a circle
};
#endif // _ChFi2d_ConstructionError_HeaderFile
src/ModelingAlgorithms/TKFillet/ChFi3d/ChFi3d_Builder_0.cxx
+3 -3
View File
@@ -5176,8 +5176,8 @@ void ChFi3d_edge_common_faces(const TopTools_ListOfShape& mapEF, TopoDS_Face& F1
}
/***********************************************************/
// gives the angle between edges E1 and E2 . Vtx is the
// vertex common to the edges
// gives the angle between edges E1 and E2.
// Vtx is the vertex common to the edges
/************************************************************/
Standard_Real ChFi3d_AngleEdge(const TopoDS_Vertex& Vtx,
const TopoDS_Edge& E1,
@@ -5204,7 +5204,7 @@ Standard_Real ChFi3d_AngleEdge(const TopoDS_Vertex& Vtx,
//==================================================================
// ChercheBordsLibres
// determines if vertex V1 has edges on free borders
// edgelibre1 and edgelibre2 .
// edgelibre1 and edgelibre2.
// It is supposed that a top can have only 2 edges on free borders
//===================================================================
void ChFi3d_ChercheBordsLibres(const ChFiDS_Map& myVEMap,
src/ModelingAlgorithms/TKFillet/ChFi3d/ChFi3d_FilBuilder.hxx
+1 -1
View File
@@ -61,7 +61,7 @@ public:
//! Attention, you need to start with SetRadius.
Standard_EXPORT void Add(const TopoDS_Edge& E);
//! initialisation of the constant vector the corresponding 1st edge.
//! initialisation of the constant vector the corresponding 1st edge.
Standard_EXPORT void Add(const Standard_Real Radius, const TopoDS_Edge& E);
//! Set the radius of the contour of index IC.
src/ModelingAlgorithms/TKGeomAlgo/GeomAPI/GeomAPI_PointsToBSplineSurface.hxx
+39 -45
View File
@@ -29,7 +29,7 @@
class Geom_BSplineSurface;
//! This class is used to approximate or interpolate
//! a BSplineSurface passing through an Array2 of
//! a BSplineSurface passing through an Array2 of
//! points, with a given continuity.
//! Describes functions for building a BSpline
//! surface which approximates or interpolates a set of points.
@@ -56,7 +56,7 @@ class Geom_BSplineSurface;
//! type of parametrization, which can be Approx_ChordLength, Approx_Centripetal
//! or Approx_IsoParametric. Default value is Approx_ChordLength.
//! For ChordLength parametrisation U(i) = U(i-1) + P(i).Distance(P(i-1)),
//! For Centripetal type U(i) = U(i-1) + Sqrt(P(i).Distance(P(i-1))).
//! For Centripetal type U(i) = U(i-1) + Sqrt(P(i).Distance(P(i-1))).
//! Centripetal type can get better result for irregular distances between points.
//!
//! Approximation and interpolation algorithms can build periodical surface along U
@@ -81,11 +81,11 @@ public:
//! the BSpline surface by interpolation.
Standard_EXPORT GeomAPI_PointsToBSplineSurface();
//! Approximates a BSpline Surface passing through an
//! array of Points. The resulting BSpline will have
//! Approximates a BSpline Surface passing through an
//! array of Points. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D.
@@ -95,11 +95,11 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Approximates a BSpline Surface passing through an
//! array of Points. The resulting BSpline will have
//! Approximates a BSpline Surface passing through an
//! array of Points. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D.
@@ -110,8 +110,8 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Approximates a BSpline Surface passing through an
//! array of points using variational smoothing algorithm,
//! Approximates a BSpline Surface passing through an
//! array of points using variational smoothing algorithm,
//! which tries to minimize additional criterium:
//! Weight1*CurveLength + Weight2*Curvature + Weight3*Torsion.
@@ -123,18 +123,16 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Approximates a BSpline Surface passing through an
//! array of Points.
//! Approximates a BSpline Surface passing through an
//! array of Points.
//!
//! The points will be constructed as follow:
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX ,
//! Y0 + (j-1)*dY ,
//! ZPoints(i,j) )
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX, Y0 + (j-1)*dY, ZPoints(i,j) )
//!
//! The resulting BSpline will have the following
//! The resulting BSpline will have the following
//! properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D
//! 4- the parametrization of the surface will verify:
@@ -150,11 +148,11 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Approximates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! Approximates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D.
@@ -164,37 +162,35 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Interpolates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! Interpolates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be 3.
//! 2- his continuity will be C2.
//! 2- his continuity will be C2.
Standard_EXPORT void Interpolate(const TColgp_Array2OfPnt& Points,
const Standard_Boolean thePeriodic = Standard_False);
//! Interpolates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! Interpolates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be 3.
//! 2- his continuity will be C2.
//! 2- his continuity will be C2.
Standard_EXPORT void Interpolate(const TColgp_Array2OfPnt& Points,
const Approx_ParametrizationType ParType,
const Standard_Boolean thePeriodic = Standard_False);
//! Approximates a BSpline Surface passing through an
//! array of Points.
//! Approximates a BSpline Surface passing through an
//! array of Points.
//!
//! The points will be constructed as follow:
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX ,
//! Y0 + (j-1)*dY ,
//! ZPoints(i,j) )
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX, Y0 + (j-1)*dY, ZPoints(i,j) )
//!
//! The resulting BSpline will have the following
//! The resulting BSpline will have the following
//! properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D
//! 4- the parametrization of the surface will verify:
@@ -210,18 +206,16 @@ public:
const GeomAbs_Shape Continuity = GeomAbs_C2,
const Standard_Real Tol3D = 1.0e-3);
//! Interpolates a BSpline Surface passing through an
//! array of Points.
//! Interpolates a BSpline Surface passing through an
//! array of Points.
//!
//! The points will be constructed as follow:
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX ,
//! Y0 + (j-1)*dY ,
//! ZPoints(i,j) )
//! P(i,j) = gp_Pnt( X0 + (i-1)*dX, Y0 + (j-1)*dY, ZPoints(i,j) )
//!
//! The resulting BSpline will have the following
//! The resulting BSpline will have the following
//! properties:
//! 1- his degree will be 3
//! 2- his continuity will be C2.
//! 2- his continuity will be C2.
//! 4- the parametrization of the surface will verify:
//! S->Value( U, V) = gp_Pnt( U, V, Z(U,V) );
@@ -231,11 +225,11 @@ public:
const Standard_Real Y0,
const Standard_Real dY);
//! Approximates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! Approximates a BSpline Surface passing through an
//! array of Point. The resulting BSpline will have
//! the following properties:
//! 1- his degree will be in the range [Degmin,Degmax]
//! 2- his continuity will be at least <Continuity>
//! 2- his continuity will be at least <Continuity>
//! 3- the distance from the point <Points> to the
//! BSpline will be lower to Tol3D.
@@ -247,8 +241,8 @@ public:
const Standard_Real Tol3D = 1.0e-3,
const Standard_Boolean thePeriodic = Standard_False);
//! Approximates a BSpline Surface passing through an
//! array of point using variational smoothing algorithm,
//! Approximates a BSpline Surface passing through an
//! array of point using variational smoothing algorithm,
//! which tries to minimize additional criterium:
//! Weight1*CurveLength + Weight2*Curvature + Weight3*Torsion.
src/ModelingAlgorithms/TKGeomAlgo/GeomFill/GeomFill_ConstrainedFilling.hxx
+1 -1
View File
@@ -85,7 +85,7 @@ public:
const Handle(GeomFill_Boundary)& B4,
const Standard_Boolean NoCheck = Standard_False);
//! Allows to modify domain on witch the blending function
//! Allows to modify domain on which the blending function
//! associated to the constrained boundary B will propag
//! the influence of the field of tangency. Can be
//! useful to reduce influence of boundaries on which
src/ModelingAlgorithms/TKGeomAlgo/IntCurve/IntCurve_ProjectOnPConicTool.hxx
+20 -20
View File
@@ -30,31 +30,31 @@ class IntCurve_ProjectOnPConicTool
public:
DEFINE_STANDARD_ALLOC
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt. The
//! Correspondence between Pnt and the point P(V) on the
//! parametric curve must be coherent with the way of
//! determination of the signed distance between a point and
//! the implicit curve. Tol is the tolerance on the distance
//! between a point and the parametrised curve. In that case,
//! no bounds are given. The research of the right parameter
//! has to be made on the natural parametric domain of the
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt. The
//! Correspondence between Pnt and the point P(V) on the
//! parametric curve must be coherent with the way of
//! determination of the signed distance between a point and
//! the implicit curve. Tol is the tolerance on the distance
//! between a point and the parametrised curve. In that case,
//! no bounds are given. The research of the right parameter
//! has to be made on the natural parametric domain of the
//! curve.
Standard_EXPORT static Standard_Real FindParameter(const IntCurve_PConic& C,
const gp_Pnt2d& Pnt,
const Standard_Real Tol);
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt. The
//! Correspondence between Pnt and the point P(V) on the
//! parametric curve must be coherent with the way of
//! determination of the signed distance between a point and
//! the implicit curve. Tol is the tolerance on the distance
//! between a point and the parametrised curve. LowParameter
//! and HighParameter give the boundaries of the interval in
//! which the parameter certainly lies. These parameters are
//! given to implement a more efficient algorithm. So, it is
//! not necessary to check that the returned value verifies
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt. The
//! Correspondence between Pnt and the point P(V) on the
//! parametric curve must be coherent with the way of
//! determination of the signed distance between a point and
//! the implicit curve. Tol is the tolerance on the distance
//! between a point and the parametrised curve. LowParameter
//! and HighParameter give the boundaries of the interval in
//! which the parameter certainly lies. These parameters are
//! given to implement a more efficient algorithm. So, it is
//! not necessary to check that the returned value verifies
//! LowParameter <= Value <= HighParameter.
Standard_EXPORT static Standard_Real FindParameter(const IntCurve_PConic& C,
const gp_Pnt2d& Pnt,
src/ModelingAlgorithms/TKGeomAlgo/IntCurveSurface/IntCurveSurface_HInter.hxx
+8 -8
View File
@@ -56,15 +56,15 @@ public:
Standard_EXPORT void Perform(const Handle(Adaptor3d_Curve)& Curve,
const Handle(Adaptor3d_Surface)& Surface);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Curve)& Curve,
const IntCurveSurface_ThePolygonOfHInter& Polygon,
const Handle(Adaptor3d_Surface)& Surface);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given. The Surface is
//! also sampled and <Polyhedron> is given.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Curve)& Curve,
@@ -72,8 +72,8 @@ public:
const Handle(Adaptor3d_Surface)& Surface,
const IntCurveSurface_ThePolyhedronOfHInter& Polyhedron);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given. The Surface is
//! also sampled and <Polyhedron> is given.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Curve)& Curve,
@@ -82,8 +82,8 @@ public:
const IntCurveSurface_ThePolyhedronOfHInter& Polyhedron,
Bnd_BoundSortBox& BndBSB);
//! Compute the Intersection between the curve and
//! the surface. The Surface is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Surface is already sampled and
//! its polyhedron : <Polyhedron> is given.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Curve)& Curve,
const Handle(Adaptor3d_Surface)& Surface,
src/ModelingAlgorithms/TKGeomAlgo/IntCurveSurface/IntCurveSurface_TheInterferenceOfHInter.hxx
+13 -13
View File
@@ -38,7 +38,7 @@ class IntCurveSurface_TheInterferenceOfHInter : public Intf_Interference
public:
DEFINE_STANDARD_ALLOC
//! Constructs an empty interference between Polygon and
//! Constructs an empty interference between Polygon and
//! Polyhedron.
Standard_EXPORT IntCurveSurface_TheInterferenceOfHInter();
@@ -48,29 +48,29 @@ public:
const IntCurveSurface_ThePolygonOfHInter& thePolyg,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Line and the Polyhedron.
Standard_EXPORT IntCurveSurface_TheInterferenceOfHInter(
const gp_Lin& theLin,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Lines and the Polyhedron.
Standard_EXPORT IntCurveSurface_TheInterferenceOfHInter(
const Intf_Array1OfLin& theLins,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Computes an interference between the Polygon and the
//! Computes an interference between the Polygon and the
//! Polyhedron.
Standard_EXPORT void Perform(const IntCurveSurface_ThePolygonOfHInter& thePolyg,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Computes an interference between the Straight Line and the
//! Computes an interference between the Straight Line and the
//! Polyhedron.
Standard_EXPORT void Perform(const gp_Lin& theLin,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Computes an interference between the Straight Lines and
//! Computes an interference between the Straight Lines and
//! the Polyhedron.
Standard_EXPORT void Perform(const Intf_Array1OfLin& theLins,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
@@ -82,33 +82,33 @@ public:
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Line and the Polyhedron.
Standard_EXPORT IntCurveSurface_TheInterferenceOfHInter(
const gp_Lin& theLin,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Lines and the Polyhedron.
Standard_EXPORT IntCurveSurface_TheInterferenceOfHInter(
const Intf_Array1OfLin& theLins,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Polygon and the
//! Computes an interference between the Polygon and the
//! Polyhedron.
Standard_EXPORT void Perform(const IntCurveSurface_ThePolygonOfHInter& thePolyg,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Straight Line and the
//! Computes an interference between the Straight Line and the
//! Polyhedron.
Standard_EXPORT void Perform(const gp_Lin& theLin,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Straight Lines and
//! Computes an interference between the Straight Lines and
//! the Polyhedron.
Standard_EXPORT void Perform(const Intf_Array1OfLin& theLins,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh,
@@ -127,7 +127,7 @@ public:
protected:
private:
//! Computes the intersection between the segment <BegO><EndO>
//! Computes the intersection between the segment <BegO><EndO>
//! and the triangle <TTri> of <thePolyh>.
Standard_EXPORT void Intersect(const gp_Pnt& BegO,
const gp_Pnt& EndO,
@@ -135,7 +135,7 @@ private:
const Standard_Integer TTri,
const IntCurveSurface_ThePolyhedronOfHInter& thePolyh);
//! Computes the intersection between the segment <BegO><EndO>
//! Computes the intersection between the segment <BegO><EndO>
//! and the triangle <TTri> of <thePolyh>.
Standard_EXPORT void Intersect(const gp_Pnt& BegO,
const gp_Pnt& EndO,
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_HCurve2dTool.hxx
+6 -6
View File
@@ -42,14 +42,14 @@ public:
static GeomAbs_Shape Continuity(const Handle(Adaptor2d_Curve2d)& C);
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(myclass) >= <S>
static Standard_Integer NbIntervals(const Handle(Adaptor2d_Curve2d)& C, const GeomAbs_Shape S);
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals(const Handle(Adaptor2d_Curve2d)& C,
TColStd_Array1OfReal& T,
@@ -106,12 +106,12 @@ public:
const Standard_Real U,
const Standard_Integer N);
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
static Standard_Real Resolution(const Handle(Adaptor2d_Curve2d)& C, const Standard_Real R3d);
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType GetType(const Handle(Adaptor2d_Curve2d)& C);
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_InterferencePolyhedron.hxx
+6 -6
View File
@@ -26,9 +26,9 @@
class IntPatch_Polyhedron;
class Intf_TangentZone;
//! Computes the interference between two polyhedra or the
//! Computes the interference between two polyhedra or the
//! self interference of a polyhedron. Points of intersection,
//! polylines of intersection and zones of tangence.
//! polylines of intersection and zones of tangence.
class IntPatch_InterferencePolyhedron : public Intf_Interference
{
public:
@@ -37,12 +37,12 @@ public:
//! Constructs an empty interference of Polyhedron.
Standard_EXPORT IntPatch_InterferencePolyhedron();
//! Constructs and computes an interference between the two
//! Constructs and computes an interference between the two
//! Polyhedra.
Standard_EXPORT IntPatch_InterferencePolyhedron(const IntPatch_Polyhedron& Obje1,
const IntPatch_Polyhedron& Obje2);
//! Constructs and computes the self interference of a
//! Constructs and computes the self interference of a
//! Polyhedron.
Standard_EXPORT IntPatch_InterferencePolyhedron(const IntPatch_Polyhedron& Obje);
@@ -62,14 +62,14 @@ private:
Standard_EXPORT void Interference(const IntPatch_Polyhedron& Obje1,
const IntPatch_Polyhedron& Obje2);
//! Computes the intersection between the facet <Tri1> of
//! Computes the intersection between the facet <Tri1> of
//! <FirstPol> and the facet <Tri2> of <SecondPol>.
Standard_EXPORT void Intersect(const Standard_Integer TriF,
const IntPatch_Polyhedron& Obje1,
const Standard_Integer TriS,
const IntPatch_Polyhedron& Obje2);
//! Computes the zone of tangence between the facet <Tri1> of
//! Computes the zone of tangence between the facet <Tri1> of
//! <FirstPol> and the facet <Tri2> of <SecondPol>.
Standard_EXPORT Standard_Boolean TangentZoneValue(Intf_TangentZone& TheTZ,
const IntPatch_Polyhedron& Obje1,
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_Intersection.hxx
+5 -5
View File
@@ -52,18 +52,18 @@ public:
//! --- Parametric - Parametric
//! --- Implicit - Implicit
//!
//! TolArc is used to compute the intersections
//! between the restrictions of a surface and a
//! 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
//! 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
//! UVMaxStep is a parameter used in the walking
//! algorithms to compute the distance between to
//! points in their respective parametric spaces.
Standard_EXPORT void SetTolerances(const Standard_Real TolArc,
const Standard_Real TolTang,
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_Line.hxx
+1 -1
View File
@@ -61,7 +61,7 @@ public:
//! a way that the system of vector (N1,N2,T) is right-handed,
//! where N1 is the normal to the first surface at a point P,
//! N2 is the normal to the second surface at a point P,
//! T is the tangent to the intersection line at P.
//! T is the tangent to the intersection line at P.
//! If the system of vector is left-handed, the transition
//! is OUT.
//! When N1 and N2 are colinear all along the intersection
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_LineConstructor.hxx
+2 -2
View File
@@ -22,8 +22,8 @@
class Adaptor3d_TopolTool;
//! The intersections algorithms compute the intersection
//! on two surfaces and return the intersections lines as
//! The intersections algorithms compute the intersection
//! on two surfaces and return the intersections lines as
//! IntPatch_Line.
class IntPatch_LineConstructor
{
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_Polyhedron.hxx
+1 -1
View File
@@ -21,7 +21,7 @@
#include <Bnd_HArray1OfBox.hxx>
//! This class provides a linear approximation of the PSurface.
//! preview a constructor on a zone of a surface
//! preview a constructor on a zone of a surface
class IntPatch_Polyhedron
{
public:
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_PolyhedronTool.hxx
+6 -6
View File
@@ -29,7 +29,7 @@ class IntPatch_Polyhedron;
class gp_Pnt;
//! Describe the signature of a polyhedral surface with
//! only triangular facets and the necessary information
//! only triangular facets and the necessary information
//! to compute the interferences.
class IntPatch_PolyhedronTool
{
@@ -49,7 +49,7 @@ public:
//! Give the number of triangles in this polyhedral surface.
static Standard_Integer NbTriangles(const IntPatch_Polyhedron& thePolyh);
//! Give the indices of the 3 points of the triangle of
//! Give the indices of the 3 points of the triangle of
//! address Index in the Polyhedron.
static void Triangle(const IntPatch_Polyhedron& thePolyh,
const Standard_Integer Index,
@@ -62,10 +62,10 @@ public:
//! Gives the address Tricon of the triangle connexe to
//! the triangle of address Triang by the edge Pivot Pedge
//! and the third point of this connexe triangle. When we
//! are on a free edge TriCon==0 but the function return
//! the value of the triangle in the other side of Pivot
//! on the free edge. Used to turn around a vertex.
//! and the third point of this connexe triangle. When we
//! are on a free edge TriCon==0 but the function return
//! the value of the triangle in the other side of Pivot
//! on the free edge. Used to turn around a vertex.
static Standard_Integer TriConnex(const IntPatch_Polyhedron& thePolyh,
const Standard_Integer Triang,
const Standard_Integer Pivot,
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_PrmPrmIntersection.hxx
+16 -16
View File
@@ -39,8 +39,8 @@ public:
//! Empty Constructor
Standard_EXPORT IntPatch_PrmPrmIntersection();
//! Performs the intersection between <Caro1> and
//! <Caro2>. Associated Polyhedrons <Polyhedron1>
//! Performs the intersection between <Caro1> and
//! <Caro2>. Associated Polyhedrons <Polyhedron1>
//! and <Polyhedron2> are given.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
const IntPatch_Polyhedron& Polyhedron1,
@@ -61,7 +61,7 @@ public:
const Standard_Real Deflection,
const Standard_Real Increment);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>. The method computes the polyhedron on
//! each surface.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -74,7 +74,7 @@ public:
const Standard_Real Increment,
const Standard_Boolean ClearFlag = Standard_True);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>. The method computes the polyhedron on
//! each surface.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -87,7 +87,7 @@ public:
const Standard_Real Increment,
IntSurf_ListOfPntOn2S& ListOfPnts);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>. The method computes the polyhedron on
//! each surface.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -103,7 +103,7 @@ public:
const Standard_Real Deflection,
const Standard_Real Increment);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>. The method computes the polyhedron on
//! each surface.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -113,10 +113,10 @@ public:
const Standard_Real Deflection,
const Standard_Real Increment);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>.
//!
//! The polyhedron which approximates <Caro2>,
//! The polyhedron which approximates <Caro2>,
//! <Polyhedron2> is given. The other one is
//! computed.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -129,10 +129,10 @@ public:
const Standard_Real Deflection,
const Standard_Real Increment);
//! Performs the intersection between <Caro1> and
//! Performs the intersection between <Caro1> and
//! <Caro2>.
//!
//! The polyhedron which approximates <Caro1>,
//! The polyhedron which approximates <Caro1>,
//! <Polyhedron1> is given. The other one is
//! computed.
Standard_EXPORT void Perform(const Handle(Adaptor3d_Surface)& Caro1,
@@ -158,14 +158,14 @@ public:
//! An exception is raised if Index<=0 or Index>NbLine.
const Handle(IntPatch_Line)& Line(const Standard_Integer Index) const;
//! Computes about <NbPoints> Intersection Points on
//! the Line <IndexLine> between the Points of Index
//! Computes about <NbPoints> Intersection Points on
//! the Line <IndexLine> between the Points of Index
//! <LowPoint> and <HighPoint>.
//!
//! All the points of the line of index <IndexLine>
//! with an index between <LowPoint> and <HighPoint>
//! are in the returned line. New Points are inserted
//! between existing points if those points are not
//! All the points of the line of index <IndexLine>
//! with an index between <LowPoint> and <HighPoint>
//! are in the returned line. New Points are inserted
//! between existing points if those points are not
//! too closed.
//!
//! An exception is raised if Index<=0 or Index>NbLine.
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_RLine.hxx
+1 -1
View File
@@ -177,7 +177,7 @@ public:
//! if (theMode == 0) then prints the information about WLine
//! if (theMode == 1) then prints the list of 3d-points
//! if (theMode == 2) then prints the list of 2d-points on the 1st surface
//! Otherwise, prints list of 2d-points on the 2nd surface
//! Otherwise, prints list of 2d-points on the 2nd surface
Standard_EXPORT void Dump(const Standard_Integer theMode) const;
DEFINE_STANDARD_RTTIEXT(IntPatch_RLine, IntPatch_PointLine)
src/ModelingAlgorithms/TKGeomAlgo/IntPatch/IntPatch_TheIWLineOfTheIWalking.hxx
+9 -10
View File
@@ -67,9 +67,8 @@ public:
void AddStatusLast(const Standard_Boolean HasLast,
const Standard_Integer Index,
const IntSurf_PathPoint& P);
//! associer a l 'indice du point sur la ligne l'indice du point
//! passant dans l'iterateur de depart
//! associate the index of the point on the line with the index of the point
//! passing through the starting iterator
void AddIndexPassing(const Standard_Integer Index);
void SetTangentVector(const gp_Vec& V, const Standard_Integer Index);
@@ -93,15 +92,15 @@ public:
Standard_Boolean IsClosed() const;
//! Returns True if the first point of the line is a
//! marching point . when is HasFirstPoint==False ,the line
//! begins on the natural bound of the surface.the line can be
//! too long
//! marching point. when HasFirstPoint==False the line
//! begins on the natural bound of the surface. The line
//! can be too long
Standard_Boolean HasFirstPoint() const;
//! Returns True if the end point of the line is a
//! marching point (Point from IntWS).
//! when is HasFirstPoint==False ,the line ends
//! on the natural bound of the surface.the line can be
//! when HasFirstPoint==False the line ends
//! on the natural bound of the surface. The line can be
//! too long.
Standard_Boolean HasLastPoint() const;
@@ -111,7 +110,7 @@ public:
const IntSurf_PathPoint& FirstPoint() const;
//! Returns the Index of first point of the line when it is a
//! marching point.This index is the index in the
//! marching point. This index is the index in the
//! PointStartIterator.
//! An exception is raised if HasFirstPoint returns False.
Standard_Integer FirstPointIndex() const;
@@ -122,7 +121,7 @@ public:
const IntSurf_PathPoint& LastPoint() const;
//! Returns the index of last point of the line when it is a
//! marching point.This index is the index in the
//! marching point. This index is the index in the
//! PointStartIterator.
//! An exception is raised if HasLastPoint returns False.
Standard_Integer LastPointIndex() const;
src/ModelingAlgorithms/TKGeomAlgo/IntPolyh/IntPolyh_MaillageAffinage.cxx
+1 -1
View File
@@ -500,7 +500,7 @@ void IntPolyh_MaillageAffinage::CommonBox()
//=======================================================================
// function : CommonBox
// purpose : Compute the common box witch is the intersection
// purpose : Compute the common box which is the intersection
// of the two bounding boxes, and mark the points of
// the two surfaces that are inside.
// REJECTION BOUNDING BOXES
src/ModelingAlgorithms/TKGeomAlgo/IntPolyh/IntPolyh_MaillageAffinage.hxx
+12 -12
View File
@@ -103,8 +103,8 @@ public:
//! of the surfaces inside that common box for possible intersection
Standard_EXPORT void CommonBox();
//! Compute the common box witch is the intersection
//! of the two bounding boxes, and mark the points of
//! Compute the common box which is the intersection
//! of the two bounding boxes, and mark the points of
//! the two surfaces that are inside.
Standard_EXPORT void CommonBox(const Bnd_Box& B1,
const Bnd_Box& B2,
@@ -118,8 +118,8 @@ public:
//! Compute edges from the array of points
Standard_EXPORT void FillArrayOfEdges(const Standard_Integer SurfID);
//! Compute triangles from the array of points, and --
//! mark the triangles that use marked points by the
//! Compute triangles from the array of points, and
//! mark the triangles that use marked points by the
//! CommonBox function.
Standard_EXPORT void FillArrayOfTriangles(const Standard_Integer SurfID);
@@ -129,14 +129,14 @@ public:
//! Refine systematicaly all marked triangles of ONE surface
Standard_EXPORT void LocalSurfaceRefinement(const Standard_Integer SurfId);
//! Compute deflection for all triangles of one
//! Compute deflection for all triangles of one
//! surface,and sort min and max of deflections
Standard_EXPORT void ComputeDeflections(const Standard_Integer SurfID);
//! Refine both surfaces using BoundSortBox as --
//! rejection. The criterions used to refine a --
//! triangle are: The deflection The size of the --
//! bounding boxes (one surface may be very small
//! Refine both surfaces using BoundSortBox as
//! rejection. The criterions used to refine a
//! triangle are: The deflection The size of the
//! bounding boxes (one surface may be very small
//! compared to the other)
Standard_EXPORT void TrianglesDeflectionsRefinementBSB();
@@ -189,13 +189,13 @@ public:
Standard_EXPORT Standard_Integer TriangleCompare();
//! Loop on the array of couples. Compute StartPoints.
//! Try to chain the StartPoints into SectionLines or
//! put the point in the ArrayOfTangentZones if
//! Try to chain the StartPoints into SectionLines or
//! put the point in the ArrayOfTangentZones if
//! chaining it, is not possible.
Standard_EXPORT Standard_Integer StartPointsChain(IntPolyh_ArrayOfSectionLines& TSectionLines,
IntPolyh_ArrayOfTangentZones& TTangentZones);
//! Mainly used by StartPointsChain(), this function
//! Mainly used by StartPointsChain(), this function
//! try to compute the next StartPoint.
Standard_EXPORT Standard_Integer
GetNextChainStartPoint(const IntPolyh_StartPoint& SPInit,
src/ModelingAlgorithms/TKGeomAlgo/IntRes2d/IntRes2d_IntersectionSegment.hxx
+16 -16
View File
@@ -51,31 +51,31 @@ public:
//! the same orientation on both curves.
Standard_Boolean IsOpposite() const;
//! Returns True if the segment is limited by a first
//! point. This point defines the lowest parameter
//! admitted on the first curve for the segment. If
//! IsOpposite returns False, it defines the lowest
//! parameter on the second curve, otherwise, it is
//! Returns True if the segment is limited by a first
//! point. This point defines the lowest parameter
//! admitted on the first curve for the segment. If
//! IsOpposite returns False, it defines the lowest
//! parameter on the second curve, otherwise, it is
//! the highest parameter on the second curve.
Standard_Boolean HasFirstPoint() const;
//! Returns the first point of the segment as an
//! IntersectionPoint (with a transition). The
//! exception DomainError is raised if HasFirstPoint
//! Returns the first point of the segment as an
//! IntersectionPoint (with a transition). The
//! exception DomainError is raised if HasFirstPoint
//! returns False.
const IntRes2d_IntersectionPoint& FirstPoint() const;
//! Returns True if the segment is limited by a last
//! point. This point defines the highest parameter
//! admitted on the first curve for the segment. If
//! IsOpposite returns False, it defines the highest
//! parameter on the second curve, otherwise, it is
//! Returns True if the segment is limited by a last
//! point. This point defines the highest parameter
//! admitted on the first curve for the segment. If
//! IsOpposite returns False, it defines the highest
//! parameter on the second curve, otherwise, it is
//! the lowest parameter on the second curve.
Standard_Boolean HasLastPoint() const;
//! Returns the last point of the segment as an
//! IntersectionPoint (with a transition). The
//! exception DomainError is raised if
//! Returns the last point of the segment as an
//! IntersectionPoint (with a transition). The
//! exception DomainError is raised if
//! HasLastExtremity returns False.
const IntRes2d_IntersectionPoint& LastPoint() const;
src/ModelingAlgorithms/TKGeomAlgo/IntRes2d/IntRes2d_Transition.hxx
+13 -13
View File
@@ -26,13 +26,13 @@
#include <IntRes2d_TypeTrans.hxx>
#include <IntRes2d_Situation.hxx>
//! Definition of the type of transition near an
//! intersection point between two curves. The transition
//! Definition of the type of transition near an
//! intersection point between two curves. The transition
//! is either a "true transition", which means that one of
//! the curves goes inside or outside the area defined by
//! the other curve near the intersection, or a "touch
//! transition" which means that the first curve does not
//! cross the other one, or an "undecided" transition,
//! the curves goes inside or outside the area defined by
//! the other curve near the intersection, or a "touch
//! transition" which means that the first curve does not
//! cross the other one, or an "undecided" transition,
//! which means that the curves are superposed.
class IntRes2d_Transition
{
@@ -73,8 +73,8 @@ public:
//! Sets the value of the position.
void SetPosition(const IntRes2d_Position Pos);
//! Indicates if the intersection is at the beginning
//! (IntRes2d_Head), at the end (IntRes2d_End), or in
//! Indicates if the intersection is at the beginning
//! (IntRes2d_Head), at the end (IntRes2d_End), or in
//! the middle (IntRes2d_Middle) of the curve.
IntRes2d_Position PositionOnCurve() const;
@@ -100,11 +100,11 @@ public:
//! exception DomainError is raised.
IntRes2d_Situation Situation() const;
//! returns a significant value if TransitionType
//! returns TOUCH. In this case, the function returns
//! true when the 2 curves locally define two
//! different parts of the space. If TransitionType
//! returns IN or OUT or UNDECIDED, the exception
//! returns a significant value if TransitionType
//! returns TOUCH. In this case, the function returns
//! true when the 2 curves locally define two
//! different parts of the space. If TransitionType
//! returns IN or OUT or UNDECIDED, the exception
//! DomainError is raised.
Standard_Boolean IsOpposite() const;
src/ModelingAlgorithms/TKGeomAlgo/IntWalk/IntWalk_PWalking.hxx
+2 -2
View File
@@ -31,7 +31,7 @@ class gp_Pnt;
//! This class implements an algorithm to determine the
//! intersection between 2 parametrized surfaces, marching from
//! a starting point. The intersection line
//! starts and ends on the natural surface's boundaries .
//! starts and ends on the natural surface's boundaries.
class IntWalk_PWalking
{
public:
@@ -88,7 +88,7 @@ public:
//! calculate the line of intersection. The regulation
//! of steps is done using min and max values on u and
//! v. (if this data is not presented as in the
//! v. (if this data is not presented as in the
//! previous method, the initial steps are calculated
//! starting from min and max uv of faces).
Standard_EXPORT void Perform(const TColStd_Array1OfReal& ParDep,
src/ModelingAlgorithms/TKGeomAlgo/Intf/Intf.hxx
+6 -6
View File
@@ -26,19 +26,19 @@
class gp_Pnt;
class gp_XYZ;
//! Interference computation between polygons, lines and
//! polyhedra with only triangular facets. These objects
//! are polygonal representations of complex curves and
//! Interference computation between polygons, lines and
//! polyhedra with only triangular facets. These objects
//! are polygonal representations of complex curves and
//! triangulated representations of complex surfaces.
class Intf
{
public:
DEFINE_STANDARD_ALLOC
//! Computes the interference between two polygons in 2d.
//! Computes the interference between two polygons in 2d.
//! Result : points of intersections and zones of tangence.
//! Computes the interference between a polygon or a straight
//! line and a polyhedron. Points of intersection and zones
//! Computes the interference between a polygon or a straight
//! line and a polyhedron. Points of intersection and zones
//! of tangence.
//! Give the plane equation of the triangle <P1> <P2> <P3>.
Standard_EXPORT static void PlaneEquation(const gp_Pnt& P1,
src/ModelingAlgorithms/TKGeomAlgo/Intf/Intf_Interference.hxx
+10 -10
View File
@@ -29,24 +29,24 @@ class Intf_SectionPoint;
class Intf_SectionLine;
class Intf_TangentZone;
//! Describes the Interference computation result
//! Describes the Interference computation result
//! between polygon2d or polygon3d or polyhedron
//! (as three sequences of points of intersection,
//! (as three sequences of points of intersection,
//! polylines of intersection and zones de tangence).
class Intf_Interference
{
public:
DEFINE_STANDARD_ALLOC
//! Gives the number of points of intersection in the
//! Gives the number of points of intersection in the
//! interference.
Standard_Integer NbSectionPoints() const;
//! Gives the point of intersection of address Index in
//! Gives the point of intersection of address Index in
//! the interference.
const Intf_SectionPoint& PntValue(const Standard_Integer Index) const;
//! Gives the number of polylines of intersection in the
//! Gives the number of polylines of intersection in the
//! interference.
Standard_Integer NbSectionLines() const;
@@ -57,23 +57,23 @@ public:
//! Gives the number of zones of tangence in the interference.
Standard_Integer NbTangentZones() const;
//! Gives the zone of tangence at address Index in the
//! Gives the zone of tangence at address Index in the
//! interference.
const Intf_TangentZone& ZoneValue(const Standard_Integer Index) const;
//! Gives the tolerance used for the calculation.
Standard_Real GetTolerance() const;
//! Tests if the polylines of intersection or the zones of
//! Tests if the polylines of intersection or the zones of
//! tangence contain the point of intersection <ThePnt>.
Standard_EXPORT Standard_Boolean Contains(const Intf_SectionPoint& ThePnt) const;
//! Inserts a new zone of tangence in the current list of
//! tangent zones of the interference and returns True
//! Inserts a new zone of tangence in the current list of
//! tangent zones of the interference and returns True
//! when done.
Standard_EXPORT Standard_Boolean Insert(const Intf_TangentZone& TheZone);
//! Insert a new segment of intersection in the current list of
//! Insert a new segment of intersection in the current list of
//! polylines of intersection of the interference.
Standard_EXPORT void Insert(const Intf_SectionPoint& pdeb, const Intf_SectionPoint& pfin);
src/ModelingAlgorithms/TKGeomAlgo/Intf/Intf_SectionPoint.hxx
+12 -12
View File
@@ -25,7 +25,7 @@
#include <Standard_Integer.hxx>
class gp_Pnt2d;
//! Describes an intersection point between polygons and
//! Describes an intersection point between polygons and
//! polyedra.
class Intf_SectionPoint
{
@@ -35,7 +35,7 @@ public:
//! Returns the location of the SectionPoint.
Standard_EXPORT const gp_Pnt& Pnt() const;
//! Returns the cumulated Parameter of the SectionPoint on the
//! Returns the cumulated Parameter of the SectionPoint on the
//! first element.
Standard_Real ParamOnFirst() const;
@@ -46,7 +46,7 @@ public:
//! Returns the type of the section point on the first element.
Intf_PIType TypeOnFirst() const;
//! Returns the type of the section point on the second
//! Returns the type of the section point on the second
//! element.
Intf_PIType TypeOnSecond() const;
@@ -70,25 +70,25 @@ public:
Standard_Integer& Addr,
Standard_Real& Param) const;
//! Gives the incidence at this section point. The incidence
//! between the two triangles is given by the cosine. The best
//! incidence is 0. (PI/2). The worst is 1. (null angle).
//! Gives the incidence at this section point. The incidence
//! between the two triangles is given by the cosine. The best
//! incidence is 0. (PI/2). The worst is 1. (null angle).
Standard_EXPORT Standard_Real Incidence() const;
//! Returns True if the two SectionPoint have the same logical
//! Returns True if the two SectionPoint have the same logical
//! information.
Standard_Boolean IsEqual(const Intf_SectionPoint& Other) const;
Standard_Boolean operator==(const Intf_SectionPoint& Other) const { return IsEqual(Other); }
//! Returns True if the two SectionPoints are on the same edge
//! Returns True if the two SectionPoints are on the same edge
//! of the first or the second element.
Standard_EXPORT Standard_Boolean IsOnSameEdge(const Intf_SectionPoint& Other) const;
Standard_EXPORT Intf_SectionPoint();
//! Builds a SectionPoint with the respective dimensions
//! (vertex edge or face) of the concerned arguments and their
//! Builds a SectionPoint with the respective dimensions
//! (vertex edge or face) of the concerned arguments and their
//! addresses in the Topological structure.
Standard_EXPORT Intf_SectionPoint(const gp_Pnt& Where,
const Intf_PIType DimeO,
@@ -101,8 +101,8 @@ public:
const Standard_Real ParamT,
const Standard_Real Incid);
//! Builds a SectionPoint 2d with the respective dimensions
//! (vertex or edge) of the concerned arguments and their
//! Builds a SectionPoint 2d with the respective dimensions
//! (vertex or edge) of the concerned arguments and their
//! addresses in the Topological structure.
Standard_EXPORT Intf_SectionPoint(const gp_Pnt2d& Where,
const Intf_PIType DimeO,
src/ModelingAlgorithms/TKGeomAlgo/Intf/Intf_TangentZone.hxx
+8 -8
View File
@@ -25,7 +25,7 @@
#include <Standard_Boolean.hxx>
class Intf_SectionPoint;
//! Describes a zone of tangence between polygons or
//! Describes a zone of tangence between polygons or
//! polyhedra as a sequence of points of intersection.
class Intf_TangentZone
{
@@ -35,7 +35,7 @@ public:
//! Returns number of SectionPoint in this TangentZone.
Standard_Integer NumberOfPoints() const;
//! Gives the SectionPoint of address <Index> in the
//! Gives the SectionPoint of address <Index> in the
//! TangentZone.
Standard_EXPORT const Intf_SectionPoint& GetPoint(const Standard_Integer Index) const;
@@ -47,33 +47,33 @@ public:
//! Checks if <ThePI> is in TangentZone.
Standard_EXPORT Standard_Boolean Contains(const Intf_SectionPoint& ThePI) const;
//! Gives the parameter range of the TangentZone on the first
//! Gives the parameter range of the TangentZone on the first
//! argument of the Interference. (Usable only for polygon)
void ParamOnFirst(Standard_Real& paraMin, Standard_Real& paraMax) const;
//! Gives the parameter range of the TangentZone on the second
//! Gives the parameter range of the TangentZone on the second
//! argument of the Interference. (Usable only for polygon)
void ParamOnSecond(Standard_Real& paraMin, Standard_Real& paraMax) const;
//! Gives information about the first argument of the
//! Gives information about the first argument of the
//! Interference. (Usable only for polygon)
Standard_EXPORT void InfoFirst(Standard_Integer& segMin,
Standard_Real& paraMin,
Standard_Integer& segMax,
Standard_Real& paraMax) const;
//! Gives information about the second argument of the
//! Gives information about the second argument of the
//! Interference. (Usable only for polygon)
Standard_EXPORT void InfoSecond(Standard_Integer& segMin,
Standard_Real& paraMin,
Standard_Integer& segMax,
Standard_Real& paraMax) const;
//! Returns True if <ThePI> is in the parameter range of the
//! Returns True if <ThePI> is in the parameter range of the
//! TangentZone.
Standard_EXPORT Standard_Boolean RangeContains(const Intf_SectionPoint& ThePI) const;
//! Returns True if the TangentZone <Other> has a common part
//! Returns True if the TangentZone <Other> has a common part
//! with <me>.
Standard_EXPORT Standard_Boolean HasCommonRange(const Intf_TangentZone& Other) const;
src/ModelingAlgorithms/TKGeomAlgo/Law/Law.hxx
+12 -12
View File
@@ -39,14 +39,14 @@ public:
DEFINE_STANDARD_ALLOC
//! This algorithm searches the knot values corresponding to the
//! splitting of a given B-spline law into several arcs with
//! splitting of a given B-spline law into several arcs with
//! the same continuity. The continuity order is given at the
//! construction time.
//! Builds a 1d bspline that is near from Lin with null
//! Builds a 1d bspline that is near from Lin with null
//! derivatives at the extremities.
Standard_EXPORT static Handle(Law_BSpFunc) MixBnd(const Handle(Law_Linear)& Lin);
//! Builds the poles of the 1d bspline that is near from
//! Builds the poles of the 1d bspline that is near from
//! Lin with null derivatives at the extremities.
Standard_EXPORT static Handle(TColStd_HArray1OfReal) MixBnd(const Standard_Integer Degree,
const TColStd_Array1OfReal& Knots,
@@ -54,12 +54,12 @@ public:
const Handle(Law_Linear)& Lin);
//! Builds the poles of the 1d bspline that is null on the
//! right side of Knots(Index) (on the left if
//! NulOnTheRight is false) and that is like a
//! t*(1-t)(1-t) curve on the left side of Knots(Index)
//! (on the right if NulOnTheRight is false). The result
//! curve is C1 with a derivative equal to 1. at first
//! parameter (-1 at last parameter if NulOnTheRight is
//! right side of Knots(Index) (on the left if
//! NulOnTheRight is false) and that is like a
//! t*(1-t)(1-t) curve on the left side of Knots(Index)
//! (on the right if NulOnTheRight is false). The result
//! curve is C1 with a derivative equal to 1. at first
//! parameter (-1 at last parameter if NulOnTheRight is
//! false).
//! Warning: Mults(Index) must greater or equal to degree-1.
Standard_EXPORT static Handle(TColStd_HArray1OfReal) MixTgt(const Standard_Integer Degree,
@@ -68,8 +68,8 @@ public:
const Standard_Boolean NulOnTheRight,
const Standard_Integer Index);
//! Computes a 1 d curve to reparametrize a curve. Its an
//! interpolation of NbPoints points calculated at quasi
//! Computes a 1d curve to reparametrize a curve. Its an
//! interpolation of NbPoints points calculated at quasi
//! constant abscissa.
Standard_EXPORT static Handle(Law_BSpline) Reparametrize(const Adaptor3d_Curve& Curve,
const Standard_Real First,
@@ -81,7 +81,7 @@ public:
const Standard_Boolean Rev,
const Standard_Integer NbPoints);
//! Computes a 1 d curve to scale a field of tangency.
//! Computes a 1d curve to scale a field of tangency.
//! Value is 1. for t = (First+Last)/2 .
//! If HasFirst value for t = First is VFirst (null derivative).
//! If HasLast value for t = Last is VLast (null derivative).
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_BSpFunc.hxx
+5 -5
View File
@@ -29,9 +29,9 @@ class Law_BSpline;
class Law_BSpFunc;
DEFINE_STANDARD_HANDLE(Law_BSpFunc, Law_Function)
//! Law Function based on a BSpline curve 1d. Package
//! Law Function based on a BSpline curve 1d. Package
//! methods and classes are implemented in package Law
//! to construct the basis curve with several
//! to construct the basis curve with several
//! constraints.
class Law_BSpFunc : public Law_Function
{
@@ -45,7 +45,7 @@ public:
Standard_EXPORT GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(me) >= <S>
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
@@ -66,8 +66,8 @@ public:
Standard_Real& D,
Standard_Real& D2) Standard_OVERRIDE;
//! Returns a law equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! Returns a law equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! test for 3d points confusion.
//! It is usfule to determines the derivatives
//! in these values <First> and <Last> if
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_BSpline.hxx
+7 -7
View File
@@ -165,11 +165,11 @@ public:
//!
//! For each U = Knots(i), M = Mults(i)
//!
//! If <U> is an existing knot the multiplicity is
//! If <U> is an existing knot the multiplicity is
//! increased by <M> if <Add> is True, increased to
//! <M> if <Add> is False.
//!
//! If U is not on the parameter range nothing is
//! If U is not on the parameter range nothing is
//! done.
//!
//! If the multiplicity is negative or null nothing is
@@ -215,7 +215,7 @@ public:
//! of the reversed curve.
Standard_EXPORT void Reverse();
//! Returns the parameter on the reversed curve for
//! Returns the parameter on the reversed curve for
//! the point of parameter U on <me>.
//!
//! returns UFirst + ULast - U
@@ -243,7 +243,7 @@ public:
//!
//! Raised if there is an index such that K (Index+1) <= K (Index).
//!
//! Raised if K.Lower() < 1 or K.Upper() > NbKnots
//! Raised if K.Lower() < 1 or K.Upper() > NbKnots
Standard_EXPORT void SetKnots(const TColStd_Array1OfReal& K);
//! Changes the knot of range Index with its multiplicity.
@@ -474,12 +474,12 @@ public:
//! Locates the parametric value U in the sequence of knots.
//! If "WithKnotRepetition" is True we consider the knot's
//! representation with repetition of multiple knot value,
//! otherwise we consider the knot's representation with
//! otherwise we consider the knot's representation with
//! no repetition of multiple knot values.
//! Knots (I1) <= U <= Knots (I2)
//! . if I1 = I2 U is a knot value (the tolerance criterion
//! . if I1 = I2 U is a knot value (the tolerance criterion
//! ParametricTolerance is used).
//! . if I1 < 1 => U < Knots (1) - Abs(ParametricTolerance)
//! . if I1 < 1 => U < Knots (1) - Abs(ParametricTolerance)
//! . if I2 > NbKnots => U > Knots (NbKnots) + Abs(ParametricTolerance)
Standard_EXPORT void LocateU(const Standard_Real U,
const Standard_Real ParametricTolerance,
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_BSplineKnotSplitting.hxx
+2 -2
View File
@@ -29,8 +29,8 @@ class Law_BSpline;
//! For a B-spline curve the discontinuities are localised at the
//! knot values and between two knots values the B-spline is
//! infinitely continuously differentiable.
//! At a knot of range index the continuity is equal to :
//! Degree - Mult (Index) where Degree is the degree of the
//! At a knot of range index the continuity is equal to:
//! Degree - Mult (Index) where Degree is the degree of the
//! basis B-spline functions and Mult the multiplicity of the knot
//! of range Index.
//! If for your computation you need to have B-spline curves with a
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_Composite.hxx
+6 -6
View File
@@ -29,7 +29,7 @@
class Law_Composite;
DEFINE_STANDARD_HANDLE(Law_Composite, Law_Function)
//! Loi composite constituee d une liste de lois de
//! Loi composite constituee d une liste de lois de
//! ranges consecutifs.
//! Cette implementation un peu lourde permet de reunir
//! en une seule loi des portions de loi construites de
@@ -52,11 +52,11 @@ public:
Standard_EXPORT GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(me) >= <S>
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Stores in <T> the parameters bounding the intervals of continuity <S>.
//! Stores in <T> the parameters bounding the intervals of continuity <S>.
//! The array must provide enough room to accommodate for the parameters,
//! i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals(TColStd_Array1OfReal& T,
@@ -77,8 +77,8 @@ public:
Standard_Real& D,
Standard_Real& D2) Standard_OVERRIDE;
//! Returns a law equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! Returns a law equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! test for 3d points confusion.
//! It is usfule to determines the derivatives
//! in these values <First> and <Last> if
@@ -90,7 +90,7 @@ public:
//! Returns the parametric bounds of the function.
Standard_EXPORT void Bounds(Standard_Real& PFirst, Standard_Real& PLast) Standard_OVERRIDE;
//! Returns the elementary function of the composite used
//! Returns the elementary function of the composite used
//! to compute at parameter W.
Standard_EXPORT Handle(Law_Function)& ChangeElementaryLaw(const Standard_Real W);
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_Constant.hxx
+1 -1
View File
@@ -44,7 +44,7 @@ public:
//! Returns GeomAbs_CN
Standard_EXPORT GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Returns 1
//! Returns 1
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
Standard_EXPORT void Intervals(TColStd_Array1OfReal& T,
src/ModelingAlgorithms/TKGeomAlgo/Law/Law_Interpolate.hxx
+14 -14
View File
@@ -26,30 +26,30 @@
#include <TColStd_Array1OfReal.hxx>
class Law_BSpline;
//! This class is used to interpolate a BsplineCurve
//! passing through an array of points, with a C2
//! Continuity if tangency is not requested at the point.
//! If tangency is requested at the point the continuity
//! will be C1. If Perodicity is requested the curve will
//! be closed and the junction will be the first point
//! This class is used to interpolate a BsplineCurve
//! passing through an array of points, with a C2
//! Continuity if tangency is not requested at the point.
//! If tangency is requested at the point the continuity
//! will be C1. If Perodicity is requested the curve will
//! be closed and the junction will be the first point
//! given. The curve will than be only C1
class Law_Interpolate
{
public:
DEFINE_STANDARD_ALLOC
//! Tolerance is to check if the points are not too close
//! to one an other. It is also used to check if the
//! tangent vector is not too small. There should be at
//! Tolerance is to check if the points are not too close
//! to one an other. It is also used to check if the
//! tangent vector is not too small. There should be at
//! least 2 points. If PeriodicFlag is True then the curve
//! will be periodic be periodic
Standard_EXPORT Law_Interpolate(const Handle(TColStd_HArray1OfReal)& Points,
const Standard_Boolean PeriodicFlag,
const Standard_Real Tolerance);
//! Tolerance is to check if the points are not too close
//! to one an other. It is also used to check if the
//! tangent vector is not too small. There should be at
//! Tolerance is to check if the points are not too close
//! to one an other. It is also used to check if the
//! tangent vector is not too small. There should be at
//! least 2 points. If PeriodicFlag is True then the curve
//! will be periodic be periodic
Standard_EXPORT Law_Interpolate(const Handle(TColStd_HArray1OfReal)& Points,
@@ -61,8 +61,8 @@ public:
Standard_EXPORT void Load(const Standard_Real InitialTangent, const Standard_Real FinalTangent);
//! loads the tangents. We should have as many tangents as
//! they are points in the array if TangentFlags.Value(i)
//! is Standard_True use the tangent Tangents.Value(i)
//! they are points in the array if TangentFlags.Value(i)
//! is Standard_True use the tangent Tangents.Value(i)
//! otherwise the tangent is not constrained.
Standard_EXPORT void Load(const TColStd_Array1OfReal& Tangents,
const Handle(TColStd_HArray1OfBoolean)& TangentFlags);
src/ModelingAlgorithms/TKGeomAlgo/LocalAnalysis/LocalAnalysis_CurveContinuity.hxx
+22 -22
View File
@@ -27,52 +27,52 @@ class Geom_Curve;
class GeomLProp_CLProps;
//! This class gives tools to check local continuity C0
//! C1 C2 G1 G2 between two points situated on two curves
//! C1 C2 G1 G2 between two points situated on two curves
class LocalAnalysis_CurveContinuity
{
public:
DEFINE_STANDARD_ALLOC
//! -u1 is the parameter of the point on Curv1
//! -u2 is the parameter of the point on Curv2
//! -u2 is the parameter of the point on Curv2
//! -Order is the required continuity:
//! GeomAbs_C0 GeomAbs_C1 GeomAbs_C2
//! GeomAbs_C0 GeomAbs_C1 GeomAbs_C2
//! GeomAbs_G1 GeomAbs_G2
//!
//! -EpsNul is used to detect a a vector with nul
//! -EpsNul is used to detect a vector with null
//! magnitude (in mm)
//!
//! -EpsC0 is used for C0 continuity to confuse two
//! -EpsC0 is used for C0 continuity to confuse two
//! points (in mm)
//!
//! -EpsC1 is an angular tolerance in radians used
//! for C1 continuity to compare the angle between
//! -EpsC1 is an angular tolerance in radians used
//! for C1 continuity to compare the angle between
//! the first derivatives
//!
//! -EpsC2 is an angular tolerance in radians used
//! for C2 continuity to compare the angle between
//! -EpsC2 is an angular tolerance in radians used
//! for C2 continuity to compare the angle between
//! the second derivatives
//!
//! -EpsG1 is an angular tolerance in radians used
//! for G1 continuity to compare the angle between
//! -EpsG1 is an angular tolerance in radians used
//! for G1 continuity to compare the angle between
//! the tangents
//!
//! -EpsG2 is an angular tolerance in radians used
//! for G2 continuity to compare the angle between
//! -EpsG2 is an angular tolerance in radians used
//! for G2 continuity to compare the angle between
//! the normals
//!
//! - percent : percentage of curvature variation (unitless)
//! - percent: percentage of curvature variation (unitless)
//! used for G2 continuity
//!
//! - Maxlen is the maximum length of Curv1 or Curv2 in
//! meters used to detect nul curvature (in mm)
//!
//! the constructor computes the quantities which are
//! the constructor computes the quantities which are
//! necessary to check the continuity in the following cases:
//!
//! case C0
//! case C0
//! --------
//! - the distance between P1 and P2 with P1=Curv1 (u1) and
//! - the distance between P1 and P2 with P1=Curv1 (u1) and
//! P2=Curv2(u2)
//!
//! case C1
@@ -83,14 +83,14 @@ public:
//! -------- and ---------
//! du du
//!
//! - the ratio between the magnitudes of the first
//! - the ratio between the magnitudes of the first
//! derivatives
//!
//! the angle value is between 0 and PI/2
//!
//! case C2
//! case C2
//! -------
//! - the angle between the second derivatives
//! - the angle between the second derivatives
//! 2 2
//! d Curv1(u1) d Curv2(u2)
//! ---------- ----------
@@ -99,12 +99,12 @@ public:
//!
//! the angle value is between 0 and PI/2
//!
//! - the ratio between the magnitudes of the second
//! - the ratio between the magnitudes of the second
//! derivatives
//!
//! case G1
//! -------
//! the angle between the tangents at each point
//! the angle between the tangents at each point
//!
//! the angle value is between 0 and PI/2
//!
src/ModelingAlgorithms/TKGeomAlgo/LocalAnalysis/LocalAnalysis_SurfaceContinuity.hxx
+31 -31
View File
@@ -28,48 +28,48 @@ class Geom2d_Curve;
class GeomLProp_SLProps;
//! This class gives tools to check local continuity C0
//! C1 C2 G1 G2 between two points situated on two surfaces
//! C1 C2 G1 G2 between two points situated on two surfaces
class LocalAnalysis_SurfaceContinuity
{
public:
DEFINE_STANDARD_ALLOC
//! -u1,v1 are the parameters of the point on Surf1
//! -u2,v2 are the parameters of the point on Surf2
//! -Order is the required continuity:
//! GeomAbs_C0 GeomAbs_C1 GeomAbs_C2
//! -u1,v1 are the parameters of the point on Surf1
//! -u2,v2 are the parameters of the point on Surf2
//! -Order is the required continuity:
//! GeomAbs_C0 GeomAbs_C1 GeomAbs_C2
//! GeomAbs_G1 GeomAbs_G2
//!
//! -EpsNul is used to detect a a vector with nul
//! -EpsNul is used to detect a a vector with nul
//! magnitude
//!
//! -EpsC0 is used for C0 continuity to confuse two
//! -EpsC0 is used for C0 continuity to confuse two
//! points (in mm)
//!
//! -EpsC1 is an angular tolerance in radians used
//! for C1 continuity to compare the angle between
//! -EpsC1 is an angular tolerance in radians used
//! for C1 continuity to compare the angle between
//! the first derivatives
//!
//! -EpsC2 is an angular tolerance in radians used
//! for C2 continuity to compare the angle between
//! -EpsC2 is an angular tolerance in radians used
//! for C2 continuity to compare the angle between
//! the second derivatives
//!
//! -EpsG1 is an angular tolerance in radians used
//! for G1 continuity to compare the angle between
//! the normals
//! -EpsG1 is an angular tolerance in radians used
//! for G1 continuity to compare the angle between
//! the normals
//!
//! -Percent : percentage of curvature variation (unitless)
//! -Percent: percentage of curvature variation (unitless)
//! used for G2 continuity
//!
//! - Maxlen is the maximum length of Surf1 or Surf2 in
//! - Maxlen is the maximum length of Surf1 or Surf2 in
//! meters used to detect null curvature (in mm)
//!
//! the constructor computes the quantities which are
//! the constructor computes the quantities which are
//! necessary to check the continuity in the following cases:
//!
//! case C0
//! case C0
//! --------
//! - the distance between P1 and P2 with P1=Surf (u1,v1) and
//! - the distance between P1 and P2 with P1=Surf (u1,v1) and
//! P2=Surfv2(u2,v2)
//!
//! case C1
@@ -89,33 +89,33 @@ public:
//! -------- and ---------
//! dv dv
//!
//! - the ratio between the magnitudes of the first derivatives in u
//! - the ratio between the magnitudes of the first derivatives in v
//! - the ratio between the magnitudes of the first derivatives in u
//! - the ratio between the magnitudes of the first derivatives in v
//!
//! the angle value is between 0 and pi/2
//! the angle value is between 0 and pi/2
//!
//! case C2
//! case C2
//! -------
//! - the angle between the second derivatives in u
//! - the angle between the second derivatives in u
//! 2 2
//! d Surf1(u1,v1) d Surf2(u2,v2)
//! ---------- ----------
//! 2 2
//! d u d u
//!
//! - the ratio between the magnitudes of the second derivatives in u
//! - the ratio between the magnitudes of the second derivatives in v
//! - the ratio between the magnitudes of the second derivatives in u
//! - the ratio between the magnitudes of the second derivatives in v
//!
//! the angle value is between 0 and PI/2
//!
//! case G1
//! -------
//! -the angle between the normals at each point
//! -the angle between the normals at each point
//! the angle value is between 0 and PI/2
//!
//! case G2
//! case G2
//! -------
//! - the maximum normal curvature gap between the two
//! - the maximum normal curvature gap between the two
//! points
Standard_EXPORT LocalAnalysis_SurfaceContinuity(const Handle(Geom_Surface)& Surf1,
const Standard_Real u1,
@@ -146,8 +146,8 @@ public:
const Standard_Real Percent = 0.01,
const Standard_Real Maxlen = 10000);
//! This constructor is used when we want to compute many analysis.
//! After we use the method ComputeAnalysis
//! This constructor is used when we want to compute many analysis.
//! After we use the method ComputeAnalysis
Standard_EXPORT LocalAnalysis_SurfaceContinuity(const Standard_Real EpsNul = 0.001,
const Standard_Real EpsC0 = 0.001,
const Standard_Real EpsC1 = 0.001,
src/ModelingAlgorithms/TKGeomAlgo/Plate/Plate_LinearScalarConstraint.hxx
+5 -5
View File
@@ -30,7 +30,7 @@
class Plate_PinpointConstraint;
class gp_XYZ;
//! define on or several constraints as linear combination of
//! define on or several constraints as linear combination of
//! the X,Y and Z components of a set of PinPointConstraint
class Plate_LinearScalarConstraint
{
@@ -55,13 +55,13 @@ public:
const TColgp_Array2OfXYZ& Coeff() const;
//! Sets the PinPointConstraint of index Index to
//! Sets the PinPointConstraint of index Index to
//! Value raise if Index is greater than the length of
//! PPC or the Row length of coeff or lower than 1
//! PPC or the Row length of coeff or lower than 1
Standard_EXPORT void SetPPC(const Standard_Integer Index, const Plate_PinpointConstraint& Value);
//! Sets the coeff of index (Row,Col) to Value
//! raise if Row (respectively Col) is greater than the
//! Sets the coeff of index (Row,Col) to Value
//! raise if Row (respectively Col) is greater than the
//! Row (respectively Column) length of coeff
Standard_EXPORT void SetCoeff(const Standard_Integer Row,
const Standard_Integer Col,
src/ModelingAlgorithms/TKGeomAlgo/Plate/Plate_LinearXYZConstraint.hxx
+4 -4
View File
@@ -53,13 +53,13 @@ public:
const TColStd_Array2OfReal& Coeff() const;
//! Sets the PinPointConstraint of index Index to
//! Sets the PinPointConstraint of index Index to
//! Value raise if Index is greater than the length of
//! PPC or the Row length of coeff or lower than 1
//! PPC or the Row length of coeff or lower than 1
Standard_EXPORT void SetPPC(const Standard_Integer Index, const Plate_PinpointConstraint& Value);
//! Sets the coeff of index (Row,Col) to Value
//! raise if Row (respectively Col) is greater than the
//! Sets the coeff of index (Row,Col) to Value
//! raise if Row (respectively Col) is greater than the
//! Row (respectively Column) length of coeff
Standard_EXPORT void SetCoeff(const Standard_Integer Row,
const Standard_Integer Col,
src/ModelingAlgorithms/TKGeomAlgo/TopTrans/TopTrans_CurveTransition.hxx
+15 -15
View File
@@ -24,30 +24,30 @@
#include <TopAbs_Orientation.hxx>
#include <TopAbs_State.hxx>
//! This algorithm is used to compute the transition
//! This algorithm is used to compute the transition
//! of a Curve intersecting a curvilinear boundary.
//!
//! The geometric elements are described locally at
//! the intersection point by a second order
//! The geometric elements are described locally at
//! the intersection point by a second order
//! development.
//!
//! The curve is described by the intersection point,
//! The curve is described by the intersection point,
//! the tangent vector and the curvature.
//!
//! The boundary is described by a set of curve
//! The boundary is described by a set of curve
//! elements, a curve element is either :
//!
//! - A curve.
//!
//! - A curve and an orientation called a half-curve,
//! the boundary of the curve is before or after the
//! - A curve and an orientation called a half-curve,
//! the boundary of the curve is before or after the
//! intersection point depending on the orientation.
class TopTrans_CurveTransition
{
public:
DEFINE_STANDARD_ALLOC
//! Create an empty Curve Transition.
//! Create an empty Curve Transition.
Standard_EXPORT TopTrans_CurveTransition();
//! Initialize a Transition with the local description
@@ -57,10 +57,10 @@ public:
//! Initialize a Transition with the local description of a straight line.
Standard_EXPORT void Reset(const gp_Dir& Tgt);
//! Add a curve element to the boundary. If Or is
//! REVERSED the curve is before the intersection,
//! else if Or is FORWARD the curv is after the
//! intersection and if Or is INTERNAL the
//! Add a curve element to the boundary. If Or is
//! REVERSED the curve is before the intersection,
//! else if Or is FORWARD the curv is after the
//! intersection and if Or is INTERNAL the
//! intersection is in the middle of the curv.
Standard_EXPORT void Compare(const Standard_Real Tole,
const gp_Dir& Tang,
@@ -69,13 +69,13 @@ public:
const TopAbs_Orientation S,
const TopAbs_Orientation Or);
//! returns the state of the curve before the
//! returns the state of the curve before the
//! intersection, this is the position relative to the
//! boundary of a point very close to the intersection
//! on the negative side of the tangent.
Standard_EXPORT TopAbs_State StateBefore() const;
//! returns the state of the curve after the
//! returns the state of the curve after the
//! intersection, this is the position relative to the
//! boundary of a point very close to the intersection
//! on the positive side of the tangent.
@@ -83,7 +83,7 @@ public:
protected:
private:
//! Compare two curvature and return true if N1,C1 is
//! Compare two curvature and return true if N1,C1 is
//! before N2,C2 in the edge orientation
Standard_EXPORT Standard_Boolean IsBefore(const Standard_Real Tole,
const Standard_Real Angl,
src/ModelingAlgorithms/TKGeomAlgo/TopTrans/TopTrans_SurfaceTransition.hxx
+11 -11
View File
@@ -26,10 +26,10 @@
#include <TopAbs_Orientation.hxx>
#include <TopAbs_State.hxx>
//! This algorithm is used to compute the transition
//! This algorithm is used to compute the transition
//! of a 3D surface intersecting a topological surfacic
//! boundary on a 3D curve ( intersection curve ).
//! The boundary is described by a set of faces
//! The boundary is described by a set of faces
//! each face is described by
//! - its support surface,
//! - an orientation defining its matter side.
@@ -37,14 +37,14 @@
//! intersection point by a second order development.
//! A surface is described by the normal vector, the
//! principal directions and the principal curvatures.
//! A curve is described by the tangent, the normal
//! A curve is described by the tangent, the normal
//! and the curvature.
//! The algorithm keeps track of the two faces elements
//! The algorithm keeps track of the two faces elements
//! closest to the part of the curve "before" and "after"
//! the intersection, these two elements are updated
//! the intersection, these two elements are updated
//! for each new face.
//! The position of the curve can be computed when at
//! least one surface element has been given, this
//! The position of the curve can be computed when at
//! least one surface element has been given, this
//! position is "In","Out" or "On" for the part of the
//! curve "Before" or "After" the intersection.
class TopTrans_SurfaceTransition
@@ -55,7 +55,7 @@ public:
//! Create an empty Surface Transition.
Standard_EXPORT TopTrans_SurfaceTransition();
//! Initialize a Surface Transition with the local
//! Initialize a Surface Transition with the local
//! description of the intersection curve and of the
//! reference surface.
//! PREQUESITORY : Norm oriented OUTSIDE "geometric matter"
@@ -66,7 +66,7 @@ public:
const Standard_Real MaxCurv,
const Standard_Real MinCurv);
//! Initialize a Surface Transition with the local
//! Initialize a Surface Transition with the local
//! description of a straight line.
Standard_EXPORT void Reset(const gp_Dir& Tgt, const gp_Dir& Norm);
@@ -101,13 +101,13 @@ public:
//! Returns the state of the reference surface before
//! the interference, this is the position relative to
//! the surface of a point very close to the intersection
//! the surface of a point very close to the intersection
//! on the negative side of the tangent.
Standard_EXPORT TopAbs_State StateBefore() const;
//! Returns the state of the reference surface after
//! interference, this is the position relative to the
//! surface of a point very close to the intersection
//! surface of a point very close to the intersection
//! on the positive side of the tangent.
Standard_EXPORT TopAbs_State StateAfter() const;
src/ModelingAlgorithms/TKHLR/Contap/Contap_HCurve2dTool.hxx
+6 -6
View File
@@ -43,14 +43,14 @@ public:
static GeomAbs_Shape Continuity(const Handle(Adaptor2d_Curve2d)& C);
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(myclass) >= <S>
static Standard_Integer NbIntervals(const Handle(Adaptor2d_Curve2d)& C, const GeomAbs_Shape S);
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals(const Handle(Adaptor2d_Curve2d)& C,
TColStd_Array1OfReal& T,
@@ -107,12 +107,12 @@ public:
const Standard_Real U,
const Standard_Integer N);
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
static Standard_Real Resolution(const Handle(Adaptor2d_Curve2d)& C, const Standard_Real R3d);
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType GetType(const Handle(Adaptor2d_Curve2d)& C);
src/ModelingAlgorithms/TKHLR/Contap/Contap_TheIWLineOfTheIWalking.hxx
+9 -9
View File
@@ -69,8 +69,8 @@ public:
const Standard_Integer Index,
const IntSurf_PathPoint& P);
//! associer a l 'indice du point sur la ligne l'indice du point
//! passant dans l'iterateur de depart
//! associate the index of the point on the line with the index of the point
//! passing through the starting iterator
void AddIndexPassing(const Standard_Integer Index);
void SetTangentVector(const gp_Vec& V, const Standard_Integer Index);
@@ -94,15 +94,15 @@ public:
Standard_Boolean IsClosed() const;
//! Returns True if the first point of the line is a
//! marching point . when is HasFirstPoint==False ,the line
//! begins on the natural bound of the surface.the line can be
//! too long
//! marching point. when is HasFirstPoint==False ,the line
//! begins on the natural bound of the surface. The line can
//! be too long
Standard_Boolean HasFirstPoint() const;
//! Returns True if the end point of the line is a
//! marching point (Point from IntWS).
//! when is HasFirstPoint==False ,the line ends
//! on the natural bound of the surface.the line can be
//! when is HasFirstPoint==False the line ends
//! on the natural bound of the surface. The line can be
//! too long.
Standard_Boolean HasLastPoint() const;
@@ -112,7 +112,7 @@ public:
const IntSurf_PathPoint& FirstPoint() const;
//! Returns the Index of first point of the line when it is a
//! marching point.This index is the index in the
//! marching point. This index is the index in the
//! PointStartIterator.
//! An exception is raised if HasFirstPoint returns False.
Standard_Integer FirstPointIndex() const;
@@ -123,7 +123,7 @@ public:
const IntSurf_PathPoint& LastPoint() const;
//! Returns the index of last point of the line when it is a
//! marching point.This index is the index in the
//! marching point. This index is the index in the
//! PointStartIterator.
//! An exception is raised if HasLastPoint returns False.
Standard_Integer LastPointIndex() const;
src/ModelingAlgorithms/TKHLR/HLRAlgo/HLRAlgo.hxx
+1 -1
View File
@@ -46,7 +46,7 @@ class HLRAlgo
public:
DEFINE_STANDARD_ALLOC
//! Iterator on the visible or hidden parts of an
//! Iterator on the visible or hidden parts of an
//! EdgeStatus.
Standard_EXPORT static void UpdateMinMax(const Standard_Real x,
const Standard_Real y,
src/ModelingAlgorithms/TKHLR/HLRAlgo/HLRAlgo_EdgeStatus.hxx
+15 -16
View File
@@ -23,15 +23,14 @@
#include <Intrv_Intervals.hxx>
//! This class describes the Hidden Line status of an
//! Edge. It contains :
//! This class describes the Hidden Line status of an
//! Edge. It contains:
//!
//! The Bounds of the Edge and their tolerances
//!
//! Two flags indicating if the edge is full visible
//! or full hidden.
//!
//! The Sequence of visible Intervals on the Edge.
//! or full hidden
//! TheSequenceof visible Intervals on the Edge.
class HLRAlgo_EdgeStatus
{
public:
@@ -39,16 +38,16 @@ public:
Standard_EXPORT HLRAlgo_EdgeStatus();
//! Creates a new EdgeStatus. Default visible. The
//! Edge is bounded by the interval <Start>, <End>
//! Creates a new EdgeStatus. Default visible. The
//! Edge is bounded by the interval <Start>, <End>
//! with the tolerances <TolStart>, <TolEnd>.
Standard_EXPORT HLRAlgo_EdgeStatus(const Standard_Real Start,
const Standard_ShortReal TolStart,
const Standard_Real End,
const Standard_ShortReal TolEnd);
//! Initialize an EdgeStatus. Default visible. The
//! Edge is bounded by the interval <Start>, <End>
//! Initialize an EdgeStatus. Default visible. The
//! Edge is bounded by the interval <Start>, <End>
//! with the tolerances <TolStart>, <TolEnd>.
Standard_EXPORT void Initialize(const Standard_Real Start,
const Standard_ShortReal TolStart,
@@ -74,13 +73,13 @@ public:
Standard_Real& End,
Standard_ShortReal& TolEnd) const;
//! Hides the interval <Start>, <End> with the
//! tolerances <TolStart>, <TolEnd>. This interval is
//! subtracted from the visible parts. If the hidden
//! part is on ( or under ) the face the flag <OnFace>
//! is True ( or False ). If the hidden part is on (
//! or inside ) the boundary of the face the flag
//! <OnBoundary> is True ( or False ).
//! Hides the interval <Start>, <End> with the
//! tolerances <TolStart>, <TolEnd>. This interval is
//! subtracted from the visible parts. If the hidden
//! part is on (or under) the face the flag <OnFace>
//! is True (or False). If the hidden part is on
//! (or inside) the boundary of the face the flag
//! <OnBoundary> is True (or False).
Standard_EXPORT void Hide(const Standard_Real Start,
const Standard_ShortReal TolStart,
const Standard_Real End,
src/ModelingAlgorithms/TKHLR/HLRAlgo/HLRAlgo_Intersection.hxx
+2 -2
View File
@@ -25,8 +25,8 @@
#include <Standard_ShortReal.hxx>
#include <TopAbs_State.hxx>
//! Describes an intersection on an edge to hide.
//! Contains a parameter and a state (ON = on the
//! Describes an intersection on an edge to hide.
//! Contains a parameter and a state (ON = on the
//! face, OUT = above the face, IN = under the Face)
class HLRAlgo_Intersection
{
src/ModelingAlgorithms/TKHLR/HLRAlgo/HLRAlgo_Projector.hxx
+3 -3
View File
@@ -29,7 +29,7 @@ class gp_Pnt;
class gp_Pnt2d;
class gp_Lin;
//! Implements a projector object.
//! Implements a projector object.
//! To transform and project Points and Planes.
//! This object is designed to be used in the
//! removal of hidden lines and is returned by the
@@ -48,11 +48,11 @@ public:
Standard_EXPORT HLRAlgo_Projector();
//! Creates an axonometric projector. <CS> is the
//! Creates an axonometric projector. <CS> is the
//! viewing coordinate system.
Standard_EXPORT HLRAlgo_Projector(const gp_Ax2& CS);
//! Creates a perspective projector. <CS> is the
//! Creates a perspective projector. <CS> is the
//! viewing coordinate system.
Standard_EXPORT HLRAlgo_Projector(const gp_Ax2& CS, const Standard_Real Focus);
src/ModelingAlgorithms/TKHLR/HLRAlgo/HLRAlgo_WiresBlock.hxx
+2 -2
View File
@@ -32,9 +32,9 @@ DEFINE_STANDARD_HANDLE(HLRAlgo_WiresBlock, Standard_Transient)
//! A WiresBlock is a set of Blocks. It is used by the
//! DataStructure to structure the Edges.
//!
//! A WiresBlock contains :
//! A WiresBlock contains:
//!
//! * An Array of Blocks.
//! * An Array of Blocks.
class HLRAlgo_WiresBlock : public Standard_Transient
{
public:
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_Algo.hxx
+2 -2
View File
@@ -27,7 +27,7 @@ class Standard_Transient;
class HLRBRep_Algo;
DEFINE_STANDARD_HANDLE(HLRBRep_Algo, HLRBRep_InternalAlgo)
//! Inherited from InternalAlgo to provide methods with Shape from TopoDS.
//! Inherited from InternalAlgo to provide methods with Shape from TopoDS.
//! A framework to compute a shape as seen in a projection plane. This is done by
//! calculating the visible and the hidden parts of the shape.
//! HLRBRep_Algo works with three types of entity:
@@ -84,7 +84,7 @@ public:
//! You may add as many shapes as you wish. Use the function Add once for each shape.
Standard_EXPORT void Add(const TopoDS_Shape& S, const Standard_Integer nbIso = 0);
//! return the index of the Shape <S> and
//! return the index of the Shape <S> and
//! return 0 if the Shape <S> is not found.
Standard_EXPORT Standard_Integer Index(const TopoDS_Shape& S);
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_AreaLimit.hxx
+2 -2
View File
@@ -27,8 +27,8 @@
class HLRBRep_AreaLimit;
DEFINE_STANDARD_HANDLE(HLRBRep_AreaLimit, Standard_Transient)
//! The private nested class AreaLimit represents a --
//! vertex on the Edge with the state on the left and --
//! The private nested class AreaLimit represents a
//! vertex on the Edge with the state on the left and
//! the right.
class HLRBRep_AreaLimit : public Standard_Transient
{
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_BCurveTool.hxx
+6 -6
View File
@@ -50,14 +50,14 @@ public:
static GeomAbs_Shape Continuity(const BRepAdaptor_Curve& C);
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(myclass) >= <S>
static Standard_Integer NbIntervals(const BRepAdaptor_Curve& C, const GeomAbs_Shape S);
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals(const BRepAdaptor_Curve& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);
@@ -107,12 +107,12 @@ public:
//! Raised if N < 1.
static gp_Vec DN(const BRepAdaptor_Curve& C, const Standard_Real U, const Standard_Integer N);
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
static Standard_Real Resolution(const BRepAdaptor_Curve& C, const Standard_Real R3d);
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType GetType(const BRepAdaptor_Curve& C);
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_CLProps.hxx
+1 -1
View File
@@ -97,7 +97,7 @@ public:
//! three first derivatives are all null.
Standard_EXPORT Standard_Boolean IsTangentDefined();
//! output the tangent direction <D>
//! output the tangent direction <D>
Standard_EXPORT void Tangent(gp_Dir2d& D);
//! Returns the curvature.
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_EdgeFaceTool.hxx
+3 -3
View File
@@ -22,9 +22,9 @@
class gp_Dir;
//! The EdgeFaceTool computes the UV coordinates at a
//! given parameter on a Curve and a Surface. It also
//! compute the signed curvature value in a direction
//! The EdgeFaceTool computes the UV coordinates at a
//! given parameter on a Curve and a Surface. It also
//! compute the signed curvature value in a direction
//! at a given u,v point on a surface.
class HLRBRep_EdgeFaceTool
{
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_EdgeInterferenceTool.hxx
+7 -7
View File
@@ -28,7 +28,7 @@ class HLRBRep_Data;
class gp_Dir;
class HLRAlgo_Interference;
//! Implements the methods required to instantiates
//! Implements the methods required to instantiates
//! the EdgeInterferenceList from HLRAlgo.
class HLRBRep_EdgeInterferenceTool
{
@@ -54,7 +54,7 @@ public:
Standard_Boolean IsPeriodic() const;
//! Returns local geometric description of the Edge at
//! parameter <Para>. See method Reset of class
//! parameter <Para>. See method Reset of class
//! EdgeFaceTransition from TopCnx for other arguments.
Standard_EXPORT void EdgeGeometry(const Standard_Real Param,
gp_Dir& Tgt,
@@ -63,18 +63,18 @@ public:
Standard_Real ParameterOfInterference(const HLRAlgo_Interference& I) const;
//! True if the two interferences are on the same
//! True if the two interferences are on the same
//! geometric locus.
Standard_EXPORT Standard_Boolean SameInterferences(const HLRAlgo_Interference& I1,
const HLRAlgo_Interference& I2) const;
//! True if the Interference and the current Vertex
//! True if the Interference and the current Vertex
//! are on the same geometric locus.
Standard_EXPORT Standard_Boolean SameVertexAndInterference(const HLRAlgo_Interference& I) const;
//! Returns the geometry of the boundary at the
//! interference <I>. See the AddInterference method
//! of the class EdgeFaceTransition from TopCnx for
//! Returns the geometry of the boundary at the
//! interference <I>. See the AddInterference method
//! of the class EdgeFaceTransition from TopCnx for
//! the other arguments.
Standard_EXPORT void InterferenceBoundaryGeometry(const HLRAlgo_Interference& I,
gp_Dir& Tang,
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_FaceData.hxx
+1 -1
View File
@@ -47,7 +47,7 @@ public:
//! <WI>.
Standard_EXPORT void SetWire(const Standard_Integer WI, const Standard_Integer NE);
//! Set the edge number <EWI> of the wire <WI>.
//! Set the edge number <EWI> of the wire <WI>.
Standard_EXPORT void SetWEdge(const Standard_Integer WI,
const Standard_Integer EWI,
const Standard_Integer EI,
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_InterCSurf.hxx
+8 -8
View File
@@ -55,15 +55,15 @@ public:
//! surface
Standard_EXPORT void Perform(const gp_Lin& Curve, const Standard_Address& Surface);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given.
Standard_EXPORT void Perform(const gp_Lin& Curve,
const HLRBRep_ThePolygonOfInterCSurf& Polygon,
const Standard_Address& Surface);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given. The Surface is
//! also sampled and <Polyhedron> is given.
Standard_EXPORT void Perform(const gp_Lin& Curve,
@@ -71,8 +71,8 @@ public:
const Standard_Address& Surface,
const HLRBRep_ThePolyhedronOfInterCSurf& Polyhedron);
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Curve is already sampled and
//! its polygon : <Polygon> is given. The Surface is
//! also sampled and <Polyhedron> is given.
Standard_EXPORT void Perform(const gp_Lin& Curve,
@@ -81,8 +81,8 @@ public:
const HLRBRep_ThePolyhedronOfInterCSurf& Polyhedron,
Bnd_BoundSortBox& BndBSB);
//! Compute the Intersection between the curve and
//! the surface. The Surface is already sampled and
//! Compute the Intersection between the curve and
//! the surface. The Surface is already sampled and
//! its polyhedron : <Polyhedron> is given.
Standard_EXPORT void Perform(const gp_Lin& Curve,
const Standard_Address& Surface,
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_InternalAlgo.hxx
+6 -6
View File
@@ -58,7 +58,7 @@ public:
Standard_EXPORT void Load(const Handle(HLRTopoBRep_OutLiner)& S,
const Standard_Integer nbIso = 0);
//! return the index of the Shape <S> and return 0 if
//! return the index of the Shape <S> and return 0 if
//! the Shape <S> is not found.
Standard_EXPORT Standard_Integer Index(const Handle(HLRTopoBRep_OutLiner)& S) const;
@@ -81,7 +81,7 @@ public:
//! select all the DataStructure.
Standard_EXPORT void Select();
//! select only the Shape of index <I>.
//! select only the Shape of index <I>.
Standard_EXPORT void Select(const Standard_Integer I);
//! select only the edges of the Shape <S>.
@@ -99,10 +99,10 @@ public:
//! set to hide all the edges.
Standard_EXPORT void HideAll();
//! set to hide all the edges of the Shape <S>.
//! set to hide all the edges of the Shape <S>.
Standard_EXPORT void HideAll(const Standard_Integer I);
//! own hiding of all the shapes of the DataStructure
//! own hiding of all the shapes of the DataStructure
//! without hiding by each other.
Standard_EXPORT void PartialHide();
@@ -125,8 +125,8 @@ public:
protected:
private:
//! first if <SideFace> own hiding of the side faces.
//! After hiding of the selected parts of the
//! first if <SideFace> own hiding of the side faces.
//! After hiding of the selected parts of the
//! DataStructure.
Standard_EXPORT void HideSelected(const Standard_Integer I, const Standard_Boolean SideFace);
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_LineTool.hxx
+8 -8
View File
@@ -43,7 +43,7 @@ class gp_Vec;
class Geom_BezierCurve;
class Geom_BSplineCurve;
//! The LineTool class provides class methods to
//! The LineTool class provides class methods to
//! access the methodes of the Line.
class HLRBRep_LineTool
{
@@ -56,19 +56,19 @@ public:
static GeomAbs_Shape Continuity(const gp_Lin& C);
//! If necessary, breaks the line in intervals of
//! continuity <S>. And returns the number of
//! If necessary, breaks the line in intervals of
//! continuity <S>. And returns the number of
//! intervals.
static Standard_Integer NbIntervals(const gp_Lin& C, const GeomAbs_Shape S);
//! Sets the current working interval.
static void Intervals(const gp_Lin& C, TColStd_Array1OfReal& T, const GeomAbs_Shape Sh);
//! Returns the first parameter of the current
//! Returns the first parameter of the current
//! interval.
static Standard_Real IntervalFirst(const gp_Lin& C);
//! Returns the last parameter of the current
//! Returns the last parameter of the current
//! interval.
static Standard_Real IntervalLast(const gp_Lin& C);
@@ -116,12 +116,12 @@ public:
//! Raised if N < 1.
static gp_Vec DN(const gp_Lin& C, const Standard_Real U, const Standard_Integer N);
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
static Standard_Real Resolution(const gp_Lin& C, const Standard_Real R3d);
//! Returns the type of the line in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the line in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType GetType(const gp_Lin& C);
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_PolyAlgo.hxx
+3 -3
View File
@@ -97,7 +97,7 @@ public:
//! calculation of the visible and hidden lines of a shape in a projection.
//! Use the functions:
//! - Projector to define the point of view
//! - Load to select the shape or shapes to be visualized
//! - Load to select the shape or shapes to be visualized
//! - Update to compute the visible and hidden lines of the shape.
//! Warning
//! The shape or shapes to be visualized must have already been triangulated.
@@ -114,7 +114,7 @@ public:
//! remove the Shape of Index <I>.
Standard_EXPORT void Remove(const Standard_Integer I);
//! return the index of the Shape <S> and return 0 if
//! return the index of the Shape <S> and return 0 if
//! the Shape <S> is not found.
Standard_EXPORT Standard_Integer Index(const TopoDS_Shape& S) const;
@@ -173,7 +173,7 @@ public:
Standard_Boolean& outl,
Standard_Boolean& intl);
//! Make a shape with the internal outlines in each
//! Make a shape with the internal outlines in each
//! face.
Standard_EXPORT TopoDS_Shape OutLinedShape(const TopoDS_Shape& S) const;
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_SLPropsATool.hxx
+7 -7
View File
@@ -30,14 +30,14 @@ class HLRBRep_SLPropsATool
public:
DEFINE_STANDARD_ALLOC
//! Computes the point <P> of parameter <U> and <V>
//! Computes the point <P> of parameter <U> and <V>
//! on the Surface <A>.
static void Value(const Standard_Address A,
const Standard_Real U,
const Standard_Real V,
gp_Pnt& P);
//! Computes the point <P> and first derivative <D1*>
//! Computes the point <P> and first derivative <D1*>
//! of parameter <U> and <V> on the Surface <A>.
static void D1(const Standard_Address A,
const Standard_Real U,
@@ -47,7 +47,7 @@ public:
gp_Vec& D1V);
//! Computes the point <P>, the first derivative <D1*>
//! and second derivative <D2*> of parameter <U> and
//! and second derivative <D2*> of parameter <U> and
//! <V> on the Surface <A>.
static void D2(const Standard_Address A,
const Standard_Real U,
@@ -65,10 +65,10 @@ public:
const Standard_Integer Nu,
const Standard_Integer Nv);
//! returns the order of continuity of the Surface
//! <A>. returns 1 : first derivative only is
//! computable returns 2 : first and second derivative
//! only are computable.
//! returns the order of continuity of the Surface <A>.
//! returns 1 : first derivative only is computable
//! returns 2 : first and second derivative only are
//! computable.
static Standard_Integer Continuity(const Standard_Address A);
//! returns the bounds of the Surface.
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_ShapeBounds.hxx
+1 -1
View File
@@ -26,7 +26,7 @@
#include <Standard_Integer.hxx>
class HLRTopoBRep_OutLiner;
//! Contains a Shape and the bounds of its vertices,
//! Contains a Shape and the bounds of its vertices,
//! edges and faces in the DataStructure.
class HLRBRep_ShapeBounds
{
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_ShapeToHLR.hxx
+3 -3
View File
@@ -29,15 +29,15 @@ class HLRTopoBRep_OutLiner;
class HLRAlgo_Projector;
class TopoDS_Face;
//! compute the OutLinedShape of a Shape with an
//! OutLiner, a Projector and create the Data
//! compute the OutLinedShape of a Shape with an
//! OutLiner, a Projector and create the Data
//! Structure of a Shape.
class HLRBRep_ShapeToHLR
{
public:
DEFINE_STANDARD_ALLOC
//! Creates a DataStructure containing the OutLiner
//! Creates a DataStructure containing the OutLiner
//! <S> depending on the projector <P> and nbIso.
Standard_EXPORT static Handle(HLRBRep_Data) Load(const Handle(HLRTopoBRep_OutLiner)& S,
const HLRAlgo_Projector& P,
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_ThePolygon2dOfTheIntPCurvePCurveOfCInter.hxx
+1 -1
View File
@@ -44,7 +44,7 @@ public:
const Standard_Real Tol);
//! The current polygon is modified if most
//! of the points of the polygon are
//! of the points of the polygon are
//! outside the box <OtherBox>. In this
//! situation, bounds are computed to build
//! a polygon inside or near the OtherBox.
src/ModelingAlgorithms/TKHLR/Intrv/Intrv_Intervals.hxx
+3 -3
View File
@@ -24,8 +24,8 @@
#include <Intrv_SequenceOfInterval.hxx>
class Intrv_Interval;
//! The class Intervals is a sorted sequence of non
//! overlapping Real Intervals.
//! The class Intervals is a sorted sequence of non
//! overlapping Real Intervals.
class Intrv_Intervals
{
public:
@@ -41,7 +41,7 @@ public:
Standard_EXPORT void Intersect(const Intrv_Interval& Tool);
//! Intersects the intervals with the intervals in the
//! sequence <Tool>.
//! sequence <Tool>.
Standard_EXPORT void Intersect(const Intrv_Intervals& Tool);
Standard_EXPORT void Subtract(const Intrv_Interval& Tool);
src/ModelingAlgorithms/TKHLR/TopCnx/TopCnx_EdgeFaceTransition.hxx
+7 -7
View File
@@ -25,8 +25,8 @@
#include <TopAbs_Orientation.hxx>
class gp_Dir;
//! TheEdgeFaceTransition is an algorithm to compute
//! the cumulated transition for interferences on an
//! TheEdgeFaceTransition is an algorithm to compute
//! the cumulated transition for interferences on an
//! edge.
class TopCnx_EdgeFaceTransition
{
@@ -36,17 +36,17 @@ public:
//! Creates an empty algorithm.
Standard_EXPORT TopCnx_EdgeFaceTransition();
//! Initialize the algorithm with the local
//! Initialize the algorithm with the local
//! description of the edge.
Standard_EXPORT void Reset(const gp_Dir& Tgt, const gp_Dir& Norm, const Standard_Real Curv);
//! Initialize the algorithm with a linear Edge.
Standard_EXPORT void Reset(const gp_Dir& Tgt);
//! Add a curve element to the boundary. Or is the
//! orientation of the interference on the boundary
//! curve. Tr is the transition of the interference.
//! BTr is the boundary transition of the
//! Add a curve element to the boundary. Or is the
//! orientation of the interference on the boundary
//! curve. Tr is the transition of the interference.
//! BTr is the boundary transition of the
//! interference.
Standard_EXPORT void AddInterference(const Standard_Real Tole,
const gp_Dir& Tang,
src/ModelingAlgorithms/TKHelix/HelixGeom/HelixGeom_HelixCurve.hxx
+8 -8
View File
@@ -40,13 +40,13 @@ class HelixGeom_HelixCurve : public Adaptor3d_Curve
{
DEFINE_STANDARD_RTTIEXT(HelixGeom_HelixCurve, Adaptor3d_Curve)
public:
//! implementation of analytical expressions
//! implementation of analytical expressions
Standard_EXPORT HelixGeom_HelixCurve();
//! Sets default values for parameters
//! Sets default values for parameters
Standard_EXPORT void Load();
//! Sets helix parameters
//! Sets helix parameters
Standard_EXPORT void Load(const Standard_Real aT1,
const Standard_Real aT2,
const Standard_Real aPitch,
@@ -54,24 +54,24 @@ public:
const Standard_Real aTaperAngle,
const Standard_Boolean aIsCW);
//! Gets first parameter
//! Gets first parameter
Standard_EXPORT virtual Standard_Real FirstParameter() const Standard_OVERRIDE;
//! Gets last parameter
//! Gets last parameter
Standard_EXPORT virtual Standard_Real LastParameter() const Standard_OVERRIDE;
//! Gets continuity
Standard_EXPORT virtual GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Gets number of intervals
//! Gets number of intervals
Standard_EXPORT virtual Standard_Integer NbIntervals(const GeomAbs_Shape S) const
Standard_OVERRIDE;
//! Gets parametric intervals
//! Gets parametric intervals
Standard_EXPORT virtual void Intervals(TColStd_Array1OfReal& T,
const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Gets parametric resolution
//! Gets parametric resolution
Standard_EXPORT virtual Standard_Real Resolution(const Standard_Real R3d) const Standard_OVERRIDE;
//! Returns False
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset.hxx
+3 -3
View File
@@ -31,13 +31,13 @@ class TopoDS_Face;
class BRepOffset
{
public:
//! returns the Offset surface computed from the
//! returns the Offset surface computed from the
//! surface <Surface> at an OffsetDistance <Offset>.
//!
//! If possible, this method returns the real type of
//! If possible, this method returns the real type of
//! the surface ( e.g. An Offset of a plane is a plane).
//!
//! If no particular case is detected, the returned
//! If no particular case is detected, the returned
//! surface will have the Type Geom_OffsetSurface.
//! Parameter allowC0 is then passed as last argument to
//! constructor of Geom_OffsetSurface.
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset_Analyse.hxx
+1 -1
View File
@@ -77,7 +77,7 @@ public: //! @name Results
const ChFiDS_TypeOfConcavity theType,
TopTools_ListOfShape& theL) const;
//! set in <Edges> all the Edges of <Shape> which are
//! set in <Edges> all the Edges of <Shape> which are
//! tangent to <Edge> at the vertex <Vertex>.
Standard_EXPORT void TangentEdges(const TopoDS_Edge& theEdge,
const TopoDS_Vertex& theVertex,
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset_MakeOffset.hxx
+2 -2
View File
@@ -74,7 +74,7 @@ public:
//! Changes the flag allowing the linearization
Standard_EXPORT void AllowLinearization(const Standard_Boolean theIsAllowed);
//! Add Closing Faces, <F> has to be in the initial
//! Add Closing Faces, <F> has to be in the initial
//! shape S.
Standard_EXPORT void AddFace(const TopoDS_Face& F);
@@ -125,7 +125,7 @@ public:
Standard_EXPORT const TopoDS_Shape& GetBadShape() const;
public: //! @name History methods
//! Returns the list of shapes generated from the shape <S>.
//! Returns the list of shapes generated from the shape <S>.
Standard_EXPORT const TopTools_ListOfShape& Generated(const TopoDS_Shape& theS);
//! Returns the list of shapes modified from the shape <S>.
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset_Offset.hxx
+8 -8
View File
@@ -52,18 +52,18 @@ public:
const Standard_Boolean OffsetOutside = Standard_True,
const GeomAbs_JoinType JoinType = GeomAbs_Arc);
//! This method will be called when you want to share
//! the edges soon generated from an other face.
//! e.g. when two faces are tangents the common edge
//! This method will be called when you want to share
//! the edges soon generated from an other face.
//! e.g. when two faces are tangents the common edge
//! will generate only one edge ( no pipe).
//!
//! The Map will be fill as follow:
//! The Map will be fill as follow:
//!
//! Created(E) = E'
//! with: E = an edge of <Face>
//! E' = the image of E in the offsetting of
//! another face sharing E with a
//! continuity at least G1
//! with:
//! E = an edge of <Face>
//! E' = the image of E in the offsetting of another
//! face sharing E with a continuity at least G1
Standard_EXPORT BRepOffset_Offset(const TopoDS_Face& Face,
const Standard_Real Offset,
const TopTools_DataMapOfShapeShape& Created,
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset_Tool.cxx
+1 -1
View File
@@ -2045,7 +2045,7 @@ static void ExtentEdge(const TopoDS_Face& F,
Standard_Real f, l;
Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
// calcul point cible . ie point d'intersection du prolongement tangent et des bords.
// calcul point cible. ie point d'intersection du prolongement tangent et des bords.
gp_Pnt2d P;
gp_Vec2d Tang;
C2d->D1(CE.FirstParameter(), P, Tang);
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_DraftAngle.hxx
+7 -7
View File
@@ -158,18 +158,18 @@ public:
//! the non-empty constructor or the Init function.
Standard_EXPORT const TopoDS_Shape& ProblematicShape() const;
//! Returns an error status when an error has occurred
//! (Face, Edge or Vertex recomputation problem).
//! Returns an error status when an error has occurred
//! (Face, Edge or Vertex recomputation problem).
//! Otherwise returns Draft_NoError. The method may be
//! called if AddDone returns Standard_False, or when
//! called if AddDone returns Standard_False, or when
//! IsDone returns Standard_False.
Standard_EXPORT Draft_ErrorStatus Status() const;
//! Returns all the faces which have been added
//! Returns all the faces which have been added
//! together with the face <F>.
Standard_EXPORT const TopTools_ListOfShape& ConnectedFaces(const TopoDS_Face& F) const;
//! Returns all the faces on which a modification has
//! Returns all the faces on which a modification has
//! been given.
Standard_EXPORT const TopTools_ListOfShape& ModifiedFaces() const;
@@ -179,12 +179,12 @@ public:
Standard_EXPORT void CorrectWires();
//! Returns the list of shapes generated from the
//! Returns the list of shapes generated from the
//! shape <S>.
Standard_EXPORT virtual const TopTools_ListOfShape& Generated(const TopoDS_Shape& S)
Standard_OVERRIDE;
//! Returns the list of shapes modified from the shape
//! Returns the list of shapes modified from the shape
//! <S>.
Standard_EXPORT virtual const TopTools_ListOfShape& Modified(const TopoDS_Shape& S)
Standard_OVERRIDE;
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_FindContigousEdges.hxx
+1 -1
View File
@@ -144,7 +144,7 @@ public:
Standard_EXPORT Standard_Boolean IsModified(const TopoDS_Shape& shape) const;
//! Gives a modifieded shape
//! Raises NoSuchObject if shape has not been modified
//! Raises NoSuchObject if shape has not been modified
Standard_EXPORT const TopoDS_Shape& Modified(const TopoDS_Shape& shape) const;
//! Dump properties of resulting shape.
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_MakeDraft.hxx
+1 -1
View File
@@ -88,7 +88,7 @@ public:
//! draft along the wire.
Standard_EXPORT TopoDS_Shell Shell() const;
//! Returns the list of shapes generated from the
//! Returns the list of shapes generated from the
//! shape <S>.
Standard_EXPORT virtual const TopTools_ListOfShape& Generated(const TopoDS_Shape& S)
Standard_OVERRIDE;
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_MakeEvolved.hxx
+5 -5
View File
@@ -45,8 +45,8 @@ class TopoDS_Shape;
//! (which lies in infinite number of planes).
//!
//! The profile is defined in a Referential R. The position of
//! the profile at the current point of the spine is given by
//! confusing R and the local referential given by ( D0, D1
//! the profile at the current point of the spine is given by
//! confusing R and the local referential given by (D0, D1
//! and the normal of the Spine).
//!
//! The coordinate system is determined by theIsAxeProf argument:
@@ -102,8 +102,8 @@ public:
Standard_EXPORT virtual void Build(
const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Returns the shapes created from a subshape
//! <SpineShape> of the spine and a subshape
//! Returns the shapes created from a subshape
//! <SpineShape> of the spine and a subshape
//! <ProfShape> on the profile.
Standard_EXPORT const TopTools_ListOfShape& GeneratedShapes(const TopoDS_Shape& SpineShape,
const TopoDS_Shape& ProfShape) const;
@@ -111,7 +111,7 @@ public:
//! Return the face Top if <Solid> is True in the constructor.
Standard_EXPORT const TopoDS_Shape& Top() const;
//! Return the face Bottom if <Solid> is True in the constructor.
//! Return the face Bottom if <Solid> is True in the constructor.
Standard_EXPORT const TopoDS_Shape& Bottom() const;
protected:
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_MakePipe.hxx
+1 -1
View File
@@ -71,7 +71,7 @@ public:
Standard_EXPORT virtual void Build(
const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Returns the TopoDS Shape of the bottom of the prism.
//! Returns the TopoDS Shape of the bottom of the prism.
Standard_EXPORT TopoDS_Shape FirstShape() Standard_OVERRIDE;
//! Returns the TopoDS Shape of the top of the prism.
src/ModelingAlgorithms/TKOffset/BRepOffsetAPI/BRepOffsetAPI_MakePipeShell.hxx
+3 -3
View File
@@ -172,7 +172,7 @@ public:
//! shape, i.e. has a definition for the wire section Profile.
Standard_EXPORT Standard_Boolean IsReady() const;
//! Get a status, when Simulate or Build failed. It can be
//! Get a status, when Simulate or Build failed. It can be
//! BRepBuilderAPI_PipeDone,
//! BRepBuilderAPI_PipeNotDone,
//! BRepBuilderAPI_PlaneNotIntersectGuide,
@@ -247,7 +247,7 @@ public:
//! they are returned in the list Result.
//! This gives a rapid preview of the resulting shape,
//! which will be obtained using the settings you have provided.
//! Raises NotDone if <me> it is not Ready
//! Raises NotDone if <me> it is not Ready
Standard_EXPORT void Simulate(const Standard_Integer NumberOfSection,
TopTools_ListOfShape& Result);
@@ -259,7 +259,7 @@ public:
//! If a propfile is not closed returns False
Standard_EXPORT Standard_Boolean MakeSolid();
//! Returns the TopoDS Shape of the bottom of the sweep.
//! Returns the TopoDS Shape of the bottom of the sweep.
Standard_EXPORT virtual TopoDS_Shape FirstShape() Standard_OVERRIDE;
//! Returns the TopoDS Shape of the top of the sweep.
src/ModelingAlgorithms/TKOffset/BiTgte/BiTgte_Blend.hxx
+8 -8
View File
@@ -52,7 +52,7 @@ public:
//! <S>: Shape to be rounded
//! <Radius>: radius of the fillet
//! <Tol>: Tol3d used in approximations
//! <NUBS>: if true, generate only NUBS surfaces,
//! <NUBS>: if true, generate only NUBS surfaces,
//! if false, generate analytical surfaces if possible
Standard_EXPORT BiTgte_Blend(const TopoDS_Shape& S,
const Standard_Real Radius,
@@ -67,7 +67,7 @@ public:
//! Clear all the Fields.
Standard_EXPORT void Clear();
//! Set two faces of <myShape> on which the Sphere
//! Set two faces of <myShape> on which the Sphere
//! must roll.
Standard_EXPORT void SetFaces(const TopoDS_Face& F1, const TopoDS_Face& F2);
@@ -99,7 +99,7 @@ public:
//! set in <LC> all the center lines
Standard_EXPORT void CenterLines(TopTools_ListOfShape& LC) const;
//! returns the surface generated by the centerline.
//! returns the surface generated by the centerline.
//! <CenterLine> may be
//! - an edge : generate a pipe.
//! - a vertex : generate a sphere.
@@ -107,7 +107,7 @@ public:
//! no surface.
Standard_EXPORT Handle(Geom_Surface) Surface(const TopoDS_Shape& CenterLine) const;
//! returns the face generated by the centerline.
//! returns the face generated by the centerline.
//! <CenterLine> may be
//! - an edge : generate a pipe.
//! - a vertex : generate a sphere.
@@ -143,8 +143,8 @@ public:
//! on the Fillet
Standard_EXPORT Handle(Geom2d_Curve) PCurve1OnFillet(const Standard_Integer Index) const;
//! gives the PCurve associated to CurveOnShape2(Index)
//! on the support face
//! gives the PCurve associated to CurveOnShape2(Index)
//! on the support face
//! Warning: returns a Null Handle if SupportShape2 is not a Face
Standard_EXPORT Handle(Geom2d_Curve) PCurveOnFace2(const Standard_Integer Index) const;
@@ -154,7 +154,7 @@ public:
Standard_EXPORT Standard_Integer NbBranches();
//! Set in <From>,<To> the indices of the faces of
//! Set in <From>,<To> the indices of the faces of
//! the branche <Index>.
//!
//! i.e: Branche<Index> = Face(From) + Face(From+1) + ..+ Face(To)
@@ -175,7 +175,7 @@ private:
Standard_EXPORT void ComputeShape();
//! Computes the intersections with <Face> and all the
//! OffsetFaces stored in <myMapSF>. Returns <True>
//! OffsetFaces stored in <myMapSF>. Returns <True>
//! if an intersections ends on a boundary of a Face.
Standard_EXPORT Standard_Boolean Intersect(const TopoDS_Shape& Init,
const TopoDS_Face& Face,
src/ModelingAlgorithms/TKOffset/BiTgte/BiTgte_CurveOnEdge.hxx
+9 -9
View File
@@ -40,7 +40,7 @@ class Geom_BSplineCurve;
DEFINE_STANDARD_HANDLE(BiTgte_CurveOnEdge, Adaptor3d_Curve)
//! private class used to create a filler rolling on
//! private class used to create a filler rolling on
//! an edge.
class BiTgte_CurveOnEdge : public Adaptor3d_Curve
{
@@ -61,20 +61,20 @@ public:
Standard_EXPORT GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(me) >= <S>
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals(TColStd_Array1OfReal& T,
const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Returns a curve equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! Returns a curve equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! test for 3d points confusion.
//! If <First> >= <Last>
Standard_EXPORT Handle(Adaptor3d_Curve) Trim(const Standard_Real First,
@@ -126,12 +126,12 @@ public:
Standard_EXPORT gp_Vec DN(const Standard_Real U,
const Standard_Integer N) const Standard_OVERRIDE;
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
Standard_EXPORT Standard_Real Resolution(const Standard_Real R3d) const Standard_OVERRIDE;
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
Standard_EXPORT GeomAbs_CurveType GetType() const Standard_OVERRIDE;
src/ModelingAlgorithms/TKOffset/BiTgte/BiTgte_CurveOnVertex.hxx
+9 -9
View File
@@ -40,7 +40,7 @@ class Geom_BSplineCurve;
DEFINE_STANDARD_HANDLE(BiTgte_CurveOnVertex, Adaptor3d_Curve)
//! private class used to create a filler rolling on
//! private class used to create a filler rolling on
//! an edge.
class BiTgte_CurveOnVertex : public Adaptor3d_Curve
{
@@ -58,20 +58,20 @@ public:
Standard_EXPORT GeomAbs_Shape Continuity() const Standard_OVERRIDE;
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(me) >= <S>
Standard_EXPORT Standard_Integer NbIntervals(const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals(TColStd_Array1OfReal& T,
const GeomAbs_Shape S) const Standard_OVERRIDE;
//! Returns a curve equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! Returns a curve equivalent of <me> between
//! parameters <First> and <Last>. <Tol> is used to
//! test for 3d points confusion.
//! If <First> >= <Last>
Standard_EXPORT Handle(Adaptor3d_Curve) Trim(const Standard_Real First,
@@ -123,12 +123,12 @@ public:
Standard_EXPORT gp_Vec DN(const Standard_Real U,
const Standard_Integer N) const Standard_OVERRIDE;
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
Standard_EXPORT Standard_Real Resolution(const Standard_Real R3d) const Standard_OVERRIDE;
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
Standard_EXPORT GeomAbs_CurveType GetType() const Standard_OVERRIDE;
src/ModelingAlgorithms/TKOffset/Draft/Draft.hxx
+3 -3
View File
@@ -30,9 +30,9 @@ class Draft
public:
DEFINE_STANDARD_ALLOC
//! Returns the draft angle of the face <F> using the
//! direction <Direction>. The method is valid for :
//! - Plane faces,
//! Returns the draft angle of the face <F> using the
//! direction <Direction>. The method is valid for :
//! - Plane faces,
//! - Cylindrical or conical faces, when the direction
//! of the axis of the surface is colinear with the
//! direction.
src/ModelingAlgorithms/TKOffset/Draft/Draft_Modification.hxx
+44 -44
View File
@@ -56,10 +56,10 @@ public:
//! Changes the basis shape and resets.
Standard_EXPORT void Init(const TopoDS_Shape& S);
//! Adds the face F and propagates the draft
//! modification to its neighbour faces if they are
//! Adds the face F and propagates the draft
//! modification to its neighbour faces if they are
//! tangent. If an error occurs, will return False and
//! ProblematicShape will return the "bad" face.
//! ProblematicShape will return the "bad" face.
Standard_EXPORT Standard_Boolean Add(const TopoDS_Face& F,
const gp_Dir& Direction,
const Standard_Real Angle,
@@ -67,51 +67,51 @@ public:
const Standard_Boolean Flag = Standard_True);
//! Removes the face F and the neighbour faces if they
//! are tangent. It will be necessary to call this
//! method if the method Add returns Standard_False,
//! are tangent. It will be necessary to call this
//! method if the method Add returns Standard_False,
//! to unset ProblematicFace.
Standard_EXPORT void Remove(const TopoDS_Face& F);
//! Performs the draft angle modification and sets the
//! value returned by the method IsDone. If an error
//! occurs, IsDone will return Standard_False, and an
//! error status will be given by the method Error,
//! and the shape on which the problem appeared will
//! value returned by the method IsDone. If an error
//! occurs, IsDone will return Standard_False, and an
//! error status will be given by the method Error,
//! and the shape on which the problem appeared will
//! be given by ProblematicShape
Standard_EXPORT void Perform();
//! Returns True if Perform has been successfully
//! Returns True if Perform has been successfully
//! called. Otherwise more information can be obtained
//! using the methods Error() and ProblematicShape().
Standard_EXPORT Standard_Boolean IsDone() const;
Standard_EXPORT Draft_ErrorStatus Error() const;
//! Returns the shape (Face, Edge or Vertex) on which
//! Returns the shape (Face, Edge or Vertex) on which
//! an error occurred.
Standard_EXPORT const TopoDS_Shape& ProblematicShape() const;
//! Returns all the faces which have been added
//! Returns all the faces which have been added
//! together with the face <F>.
Standard_EXPORT const TopTools_ListOfShape& ConnectedFaces(const TopoDS_Face& F);
//! Returns all the faces on which a modification has
//! Returns all the faces on which a modification has
//! been given.
Standard_EXPORT const TopTools_ListOfShape& ModifiedFaces();
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location,<Tol>
//! the new tolerance.<RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface.(the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! face changes in the shells which contain it. Here
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location, <Tol>
//! the new tolerance.<RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface. (the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! face changes in the shells which contain it. Here
//! it will be set to Standard_False.
//!
//! Otherwise, returns Standard_False, and <S>, <L>,
//! <Tol> , <RevWires> ,<RevFace> are not significant.
//! Otherwise, returns Standard_False, and <S>, <L>,
//! <Tol> , <RevWires> ,<RevFace> are not significant.
Standard_EXPORT Standard_Boolean NewSurface(const TopoDS_Face& F,
Handle(Geom_Surface)& S,
TopLoc_Location& L,
@@ -119,35 +119,35 @@ public:
Standard_Boolean& RevWires,
Standard_Boolean& RevFace) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>, <Tol> are not
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>, <Tol> are not
//! significant.
Standard_EXPORT Standard_Boolean NewCurve(const TopoDS_Edge& E,
Handle(Geom_Curve)& C,
TopLoc_Location& L,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
Standard_EXPORT Standard_Boolean NewPoint(const TopoDS_Vertex& V,
gp_Pnt& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has a new
//! Returns Standard_True if the edge <E> has a new
//! curve on surface on the face <F>.In this case, <C>
//! is the new geometric support of the edge, <L> the
//! is the new geometric support of the edge, <L> the
//! new location, <Tol> the new tolerance.
//!
//! Otherwise, returns Standard_False, and <C>, <L>,
//! Otherwise, returns Standard_False, and <C>, <L>,
//! <Tol> are not significant.
//!
//! <NewE> is the new edge created from <E>. <NewF>
//! <NewE> is the new edge created from <E>. <NewF>
//! is the new face created from <F>. They may be useful.
Standard_EXPORT Standard_Boolean NewCurve2d(const TopoDS_Edge& E,
const TopoDS_Face& F,
@@ -156,21 +156,21 @@ public:
Handle(Geom2d_Curve)& C,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case, <P> is
//! the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case, <P> is
//! the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
Standard_EXPORT Standard_Boolean NewParameter(const TopoDS_Vertex& V,
const TopoDS_Edge& E,
Standard_Real& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns the continuity of <NewE> between <NewF1>
//! Returns the continuity of <NewE> between <NewF1>
//! and <NewF2>.
//!
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! (resp. <F2>).
Standard_EXPORT GeomAbs_Shape Continuity(const TopoDS_Edge& E,
const TopoDS_Face& F1,
src/ModelingAlgorithms/TKPrim/BRepPrim/BRepPrim_Torus.hxx
+1 -1
View File
@@ -50,7 +50,7 @@ public:
const Standard_Real Major,
const Standard_Real Minor);
//! The surface normal should be directed towards the
//! The surface normal should be directed towards the
//! outside.
Standard_EXPORT virtual TopoDS_Face MakeEmptyLateralFace() const Standard_OVERRIDE;
src/ModelingAlgorithms/TKPrim/BRepPrim/BRepPrim_Wedge.hxx
+3 -3
View File
@@ -33,7 +33,7 @@ public:
//! Default constructor
BRepPrim_Wedge() {}
//! Creates a Wedge algorithm. <Axes> is the axis
//! Creates a Wedge algorithm. <Axes> is the axis
//! system for the primitive.
//!
//! XMin, YMin, ZMin are set to 0
@@ -49,7 +49,7 @@ public:
const Standard_Real dy,
const Standard_Real dz);
//! Creates a Wedge primitive. <Axes> is the axis
//! Creates a Wedge primitive. <Axes> is the axis
//! system for the primitive.
//!
//! XMin, YMin, ZMin are set to 0
@@ -67,7 +67,7 @@ public:
const Standard_Real dz,
const Standard_Real ltx);
//! Create a Wedge primitive. <Axes> is the axis
//! Create a Wedge primitive. <Axes> is the axis
//! system for the primitive.
//!
//! all the fields are set to the corresponding value
src/ModelingAlgorithms/TKPrim/BRepPrimAPI/BRepPrimAPI_MakeCylinder.hxx
+3 -3
View File
@@ -25,7 +25,7 @@
#include <BRepPrimAPI_MakeOneAxis.hxx>
class gp_Ax2;
//! Describes functions to build cylinders or portions of cylinders.
//! Describes functions to build cylinders or portions of cylinders.
//! A MakeCylinder object provides a framework for:
//! - defining the construction of a cylinder,
//! - implementing the construction algorithm, and
@@ -56,8 +56,8 @@ public:
const Standard_Real R,
const Standard_Real H);
//! Make a cylinder of radius R and length H with
//! angle H.
//! Make a cylinder of radius R and length H with
//! angle H.
//! Constructs
//! - a cylinder of radius R and height H, or
//! - a portion of cylinder of radius R and height H, and of
src/ModelingAlgorithms/TKPrim/BRepPrimAPI/BRepPrimAPI_MakePrism.hxx
+7 -7
View File
@@ -58,8 +58,8 @@ public:
const Standard_Boolean Canonize = Standard_True);
//! Builds a semi-infinite or an infinite prism of base S.
//! If Inf is true the prism is infinite, if Inf is false
//! the prism is semi-infinite (in the direction D). If C
//! If Inf is true the prism is infinite, if Inf is false
//! the prism is semi-infinite (in the direction D). If C
//! is true S is copied (for semi-infinite prisms).
//! If Canonize is true then generated surfaces
//! are attempted to be canonized in simple types
@@ -76,7 +76,7 @@ public:
Standard_EXPORT virtual void Build(
const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Returns the TopoDS Shape of the bottom of the prism.
//! Returns the TopoDS Shape of the bottom of the prism.
Standard_EXPORT TopoDS_Shape FirstShape() Standard_OVERRIDE;
//! Returns the TopoDS Shape of the top of the prism.
@@ -94,12 +94,12 @@ public:
//! Returns true if the shape S has been deleted.
Standard_EXPORT virtual Standard_Boolean IsDeleted(const TopoDS_Shape& S) Standard_OVERRIDE;
//! Returns the TopoDS Shape of the bottom of the prism.
//! generated with theShape (subShape of the generating shape).
//! Returns the TopoDS Shape of the bottom of the prism.
//! generated with theShape (subShape of the generating shape).
Standard_EXPORT TopoDS_Shape FirstShape(const TopoDS_Shape& theShape);
//! Returns the TopoDS Shape of the top of the prism.
//! generated with theShape (subShape of the generating shape).
//! Returns the TopoDS Shape of the top of the prism.
//! generated with theShape (subShape of the generating shape).
Standard_EXPORT TopoDS_Shape LastShape(const TopoDS_Shape& theShape);
protected:
src/ModelingAlgorithms/TKPrim/BRepPrimAPI/BRepPrimAPI_MakeSweep.hxx
+4 -4
View File
@@ -32,11 +32,11 @@ class TopoDS_Shape;
//! - Edges generate Faces.
//! - Wires generate Shells.
//! - Faces generate Solids.
//! - Shells generate Composite Solids.
//! - Shells generate Composite Solids.
//! You are not allowed to sweep Solids and Composite Solids.
//! Two kinds of sweeps are implemented in the BRepPrimAPI package:
//! - The linear sweep called a Prism
//! - The rotational sweep called a Revol
//! - The linear sweep called a Prism
//! - The rotational sweep called a Revol
//! Swept constructions along complex profiles such as BSpline curves
//! are also available in the BRepOffsetAPI package..
class BRepPrimAPI_MakeSweep : public BRepBuilderAPI_MakeShape
@@ -44,7 +44,7 @@ class BRepPrimAPI_MakeSweep : public BRepBuilderAPI_MakeShape
public:
DEFINE_STANDARD_ALLOC
//! Returns the TopoDS Shape of the bottom of the sweep.
//! Returns the TopoDS Shape of the bottom of the sweep.
Standard_EXPORT virtual TopoDS_Shape FirstShape() = 0;
//! Returns the TopoDS Shape of the top of the sweep.
src/ModelingAlgorithms/TKPrim/BRepPrimAPI/BRepPrimAPI_MakeTorus.hxx
+1 -1
View File
@@ -103,7 +103,7 @@ public:
//! Make a section of a torus of radii R1 R2.
//! For all algorithms The resulting shape is composed of
//! - a lateral toroidal face,
//! - two conical faces (defined by the equation v = angle1 and
//! - two conical faces (defined by the equation v = angle1 and
//! v = angle2) if the sphere is truncated in the v parametric
//! direction (they may be cylindrical faces in some
//! particular conditions), and in case of a portion
src/ModelingAlgorithms/TKPrim/BRepSweep/BRepSweep_Iterator.hxx
+1 -1
View File
@@ -28,7 +28,7 @@ class TopoDS_Shape;
//! This class provides iteration services required by
//! the Generating Line (TopoDS Shape) of a BRepSweep.
//! This tool is used to iterate on the direct
//! This tool is used to iterate on the direct
//! sub-shapes of a Shape.
class BRepSweep_Iterator
{
src/ModelingAlgorithms/TKPrim/Sweep/Sweep_NumShapeIterator.hxx
+1 -1
View File
@@ -25,7 +25,7 @@
#include <TopAbs_Orientation.hxx>
//! This class provides iteration services required by
//! the Swept Primitives for a Directing NumShape
//! the Swept Primitives for a Directing NumShape
//! Line.
class Sweep_NumShapeIterator
{
src/ModelingAlgorithms/TKPrim/Sweep/Sweep_NumShapeTool.hxx
+4 -4
View File
@@ -25,16 +25,16 @@
#include <TopAbs_ShapeEnum.hxx>
#include <TopAbs_Orientation.hxx>
//! This class provides the indexation and type analysis
//! services required by the NumShape Directing Shapes of
//! This class provides the indexation and type analysis
//! services required by the NumShape Directing Shapes of
//! Swept Primitives.
class Sweep_NumShapeTool
{
public:
DEFINE_STANDARD_ALLOC
//! Create a new NumShapeTool with <aShape>. The Tool
//! must prepare an indexation for all the subshapes
//! Create a new NumShapeTool with <aShape>. The Tool
//! must prepare an indexation for all the subshapes
//! of this shape.
Standard_EXPORT Sweep_NumShapeTool(const Sweep_NumShape& aShape);
src/ModelingAlgorithms/TKShHealing/ShapeAnalysis/ShapeAnalysis_ShapeContents.hxx
+1 -1
View File
@@ -63,7 +63,7 @@ public:
Standard_Boolean& ModifyOffsetCurveMode() { return myOffsetCurveMode; }
//! Returns (modifiable) the flag which defines whether to store faces
//! with edges if its pcurves are trimmed curves
//! with edges if its pcurves are trimmed curves
Standard_Boolean& ModifyTrimmed2dMode() { return myTrimmed2dMode; }
Standard_Integer NbSolids() const { return myNbSolids; }

Some files were not shown because too many files have changed in this diff Show More