//! Allows to add or remove the object given to the list of current and highlight/unhighlight it correspondingly.
//! Is valid for global context only; for local context use method AddOrRemoveSelected.
- //! Since this method makes sence only for neutral point selection of a whole object,
+ //! Since this method makes sense only for neutral point selection of a whole object,
//! if 0 selection of the object is empty this method simply does nothing.
Standard_DEPRECATED ("Local Context is deprecated - local selection should be used without Local Context")
void AddOrRemoveCurrentObject (const Handle(AIS_InteractiveObject)& theObj,
//=======================================================================
//function : AddOrRemoveSelected
-//purpose : Adds or removes current object from AIS selection and highlights/unhighlights it.
-// Since this method makes sence only for neutral point selection of a whole object,
-// if 0 selection of the object is empty this method simply does nothing.
+//purpose :
//=======================================================================
void AIS_InteractiveContext::AddOrRemoveSelected (const Handle(AIS_InteractiveObject)& theObject,
const Standard_Boolean theToUpdateViewer)
//! Computes transformation of parent object according to the active mode and input motion vector.
//! You can use this method to get object transformation according to current mode or use own algorithm
- //! to implement any other tranformation for modes.
+ //! to implement any other transformation for modes.
//! @return transformation of parent object.
Standard_EXPORT Standard_Boolean ObjectTransformation (const Standard_Integer theX, const Standard_Integer theY,
const Handle(V3d_View)& theView, gp_Trsf& theTrsf);
//! of a surface for generic algorithms.
//!
//! The Surface can be decomposed in intervals of any
-//! continuity in U and V using the method
-//! NbIntervals. A current interval can be set. Most
-//! of the methods apply to the current interval.
+//! continuity in U and V using the method NbIntervals.
+//! A current interval can be set.
+//! Most of the methods apply to the current interval.
//! Warning: All the methods are virtual and implemented with a
-//! raise to allow to redefined only the methods realy
-//! used.
+//! raise to allow to redefined only the methods really used.
//!
-//! Polynomial coefficients of BSpline surfaces used for their evaluation are
-//! cached for better performance. Therefore these evaluations are not
-//! thread-safe and parallel evaluations need to be prevented.
+//! Polynomial coefficients of BSpline surfaces used for their evaluation are cached for better performance.
+//! Therefore these evaluations are not thread-safe and parallel evaluations need to be prevented.
class Adaptor3d_Surface : public Standard_Transient
{
DEFINE_STANDARD_RTTIEXT(Adaptor3d_Surface, Standard_Transient)
DEFINE_STANDARD_HANDLE(Adaptor3d_TopolTool, Standard_Transient)
//! This class provides a default topological tool,
-//! based on the Umin,Vmin,Umax,Vmax of an HSurface
-//! from Adaptor3d.
-//! All methods and fields may be redefined when
-//! inheriting from this class.
-//! This class is used to instantiate algorithmes
-//! as Intersection, outlines,...
+//! based on the Umin,Vmin,Umax,Vmax of an HSurface from Adaptor3d.
+//! All methods and fields may be redefined when inheriting from this class.
+//! This class is used to instantiate algorithms as Intersection, outlines,...
class Adaptor3d_TopolTool : public Standard_Transient
{
public:
-
Standard_EXPORT Adaptor3d_TopolTool();
Standard_EXPORT Adaptor3d_TopolTool(const Handle(Adaptor3d_Surface)& Surface);
Standard_EXPORT virtual Standard_Boolean DomainIsInfinite();
Standard_EXPORT virtual Standard_Address Edge() const;
-
- //! compute the sample-points for the intersections algorithms
- //! by adaptive algorithm for BSpline surfaces. For other surfaces algorithm
- //! is the same as in method ComputeSamplePoints(), but only fill arrays of U
- //! and V sample parameters;
- //! theDefl is a requred deflection
- //! theNUmin, theNVmin are minimal nb points for U and V.
- Standard_EXPORT virtual void SamplePnts (const Standard_Real theDefl, const Standard_Integer theNUmin, const Standard_Integer theNVmin);
-
- //! compute the sample-points for the intersections algorithms
- //! by adaptive algorithm for BSpline surfaces - is used in SamplePnts
- //! theDefl is a requred deflection
- //! theNUmin, theNVmin are minimal nb points for U and V.
- Standard_EXPORT virtual void BSplSamplePnts (const Standard_Real theDefl, const Standard_Integer theNUmin, const Standard_Integer theNVmin);
-
- //! Returns true if provide uniform sampling of points.
- Standard_EXPORT virtual Standard_Boolean IsUniformSampling() const;
-
+ //! Compute the sample-points for the intersections algorithms by adaptive algorithm for BSpline surfaces.
+ //! For other surfaces algorithm is the same as in method ComputeSamplePoints(),
+ //! but only fill arrays of U and V sample parameters;
+ //! @param theDefl [in] a required deflection
+ //! @param theNUmin [in] minimal nb points for U
+ //! @param theNVmin [in] minimal nb points for V
+ Standard_EXPORT virtual void SamplePnts (const Standard_Real theDefl,
+ const Standard_Integer theNUmin,
+ const Standard_Integer theNVmin);
+
+ //! Compute the sample-points for the intersections algorithms
+ //! by adaptive algorithm for BSpline surfaces - is used in SamplePnts
+ //! @param theDefl [in] required deflection
+ //! @param theNUmin [in] minimal nb points for U
+ //! @param theNVmin [in] minimal nb points for V
+ Standard_EXPORT virtual void BSplSamplePnts (const Standard_Real theDefl,
+ const Standard_Integer theNUmin,
+ const Standard_Integer theNVmin);
+ //! Returns true if provide uniform sampling of points.
+ Standard_EXPORT virtual Standard_Boolean IsUniformSampling() const;
DEFINE_STANDARD_RTTIEXT(Adaptor3d_TopolTool,Standard_Transient)
protected:
-
Handle(Adaptor3d_Surface) myS;
Standard_Integer myNbSamplesU;
Standard_Integer myNbSamplesV;
Handle(TColStd_HArray1OfReal) myUPars;
Handle(TColStd_HArray1OfReal) myVPars;
-
private:
-
Standard_Integer nbRestr;
Standard_Integer idRestr;
Standard_Real Uinf;
Standard_Integer idVtx;
Handle(Adaptor3d_HVertex) myVtx[2];
-
};
-
-
-
-
-
-
#endif // _Adaptor3d_TopolTool_HeaderFile
myConstraints.UpdateInV(Vdec);
break;
case 3 :
-// It is necesary to cut in U and V
+// It is necessary to cut in U and V
myResult.UpdateInU(Udec);
myConstraints.UpdateInU(Udec);
myResult.UpdateInV(Vdec);
//=======================================================================
//function : ConvertBS
-//purpose : Convertion of the approximation in BSpline Surface
+//purpose : Conversion of the approximation in BSpline Surface
//=======================================================================
void AdvApp2Var_ApproxAFunc2Var::ConvertBS()
//! [FirstInU, LastInU]: The Bounds in U of the Approximation
//! [FirstInV, LastInV]: The Bounds in V of the Approximation
//! FavorIso : Give preference to extract u-iso or v-iso on F(U,V)
-//! This can be usefull to optimize the <Func> methode
+//! This can be useful to optimize the <Func> method
//! ContInU, ContInV : Continuity waiting in u and v
//! PrecisCode : Precision on approximation's error mesurement
//! 1 : Fast computation and average precision
//! where iu (resp. iv) = 0 if ContInU (resp. ContInV) = GeomAbs_C0,
//! = 1 if = GeomAbs_C1,
//! = 2 if = GeomAbs_C2.
-//! MaxPatch : Maximun number of Patch waiting
+//! MaxPatch : Maximum number of Patch waiting
//! number of Patch is number of u span * number of v span
//! Func : The external method to evaluate F(U,V)
//! Crit : To (re)defined condition of convergence
/* Other types of tables (INTEGER*2, INTEGER, REAL, ...) */
/* are not managed by the routine. */
-/* It is usable in phase of developpement to detect the */
+/* It is usable in phase of development to detect the */
/* errors of initialization. */
/* In official version, these calls will be inactive. */
/* TABLES */
-/* DATAS */
+/* DATA */
/* Parameter adjustments */
--dtable;
Standard_EXPORT Standard_Real AverageError (const Standard_Integer Dimension, const Standard_Integer Index) const;
- //! diplay information on approximation.
+ //! display information on approximation.
Standard_EXPORT void Dump (Standard_OStream& o) const;
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
class AppDef_MultiLine;
-//! example of MultiLine tool corresponding to the tools of the packages
-//! AppParCurves and Approx. For Approx, the tool will not addd points
-//! if the algorithms want some.
+//! Example of MultiLine tool corresponding to the tools of the packages AppParCurves and Approx.
+//! For Approx, the tool will not add points if the algorithms want some.
class AppDef_MyLineTool
{
public:
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
o << " NbSegments " << myKnots->Length()-1 << std::endl;
}
else
- { if (myIsOverConstr) o << "The probleme is overconstraint " << std::endl;
- else o << " Erreur dans l''approximation" << std::endl;
- }
+ {
+ o << (myIsOverConstr
+ ? " The problem is overconstraint"
+ : " Error in approximation") << std::endl;
+ }
}
-//
+
//=======================================================================
//function : SetConstraints
//purpose : Define the constraints to approximate
myPoles2d->ChangeArray1(),
myWeigths->ChangeArray1());
- // poles3d are multiplied by weight after tranlation.
+ // poles3d are multiplied by weight after translation.
for (ii=1; ii<=Num1DSS; ii++) {
myPoles->ChangeValue(ii).ChangeCoord()
-= Translation.XYZ();
myDWeigths->ChangeArray1(),
myD2Weigths->ChangeArray1());
- // Multiply poles3d by the weight after tranlations.
+ // Multiply poles3d by the weight after translations.
for (ii=1; ii<=Num1DSS; ii++) {
// First translate
myPoles->ChangeValue(ii).ChangeCoord()
//! [First, Last] : Approx_SweepApproximation.cdl
//! Tol3d : Tolerance to surface approximation
//! Tol2d : Tolerance used to perform curve approximation
- //! Normaly the 2d curve are approximated with a
+ //! Normally the 2d curve are approximated with a
//! tolerance given by the resolution on support surfaces,
//! but if this tolerance is too large Tol2d is used.
//! TolAngular : Tolerance (in radian) to control the angle
const TColStd_Array1OfInteger& SurfVMults() const;
- //! returns the maximum error in the suface approximation.
+ //! returns the maximum error in the surface approximation.
Standard_EXPORT Standard_Real MaxErrorOnSurf() const;
- //! returns the average error in the suface approximation.
+ //! returns the average error in the surface approximation.
Standard_EXPORT Standard_Real AverageErrorOnSurf() const;
Standard_Integer NbCurves2d() const;
//! compute the first derivative in v direction of the
//! section for v = param
- //! Warning : It used only for C1 or C2 aproximation
+ //! Warning : It used only for C1 or C2 approximation
Standard_EXPORT virtual Standard_Boolean D1 (const Standard_Real Param, const Standard_Real First, const Standard_Real Last, TColgp_Array1OfPnt& Poles, TColgp_Array1OfVec& DPoles, TColgp_Array1OfPnt2d& Poles2d, TColgp_Array1OfVec2d& DPoles2d, TColStd_Array1OfReal& Weigths, TColStd_Array1OfReal& DWeigths);
//! compute the second derivative in v direction of the
//! section for v = param
- //! Warning : It used only for C2 aproximation
+ //! Warning : It used only for C2 approximation
Standard_EXPORT virtual Standard_Boolean D2 (const Standard_Real Param, const Standard_Real First, const Standard_Real Last, TColgp_Array1OfPnt& Poles, TColgp_Array1OfVec& DPoles, TColgp_Array1OfVec& D2Poles, TColgp_Array1OfPnt2d& Poles2d, TColgp_Array1OfVec2d& DPoles2d, TColgp_Array1OfVec2d& D2Poles2d, TColStd_Array1OfReal& Weigths, TColStd_Array1OfReal& DWeigths, TColStd_Array1OfReal& D2Weigths);
//! get the number of 2d curves to approximate.
//! SurfTol error inside the surface.
Standard_EXPORT virtual void GetTolerance (const Standard_Real BoundTol, const Standard_Real SurfTol, const Standard_Real AngleTol, TColStd_Array1OfReal& Tol3d) const = 0;
- //! Is usefull, if (me) have to run numerical
- //! algorithm to perform D0, D1 or D2
+ //! Is useful, if (me) have to run numerical algorithm to perform D0, D1 or D2
Standard_EXPORT virtual void SetTolerance (const Standard_Real Tol3d, const Standard_Real Tol2d) = 0;
//! Get the barycentre of Surface.
- //! An very poor estimation is sufficent.
- //! This information is usefull to perform well
- //! conditioned rational approximation.
+ //! An very poor estimation is sufficient.
+ //! This information is useful to perform well conditioned rational approximation.
//! Warning: Used only if <me> IsRational
Standard_EXPORT virtual gp_Pnt BarycentreOfSurf() const;
- //! Returns the length of the greater section. This
- //! information is usefull to G1's control.
+ //! Returns the length of the greater section.
+ //! Thisinformation is useful to G1's control.
//! Warning: With an little value, approximation can be slower.
Standard_EXPORT virtual Standard_Real MaximalSection() const;
- //! Compute the minimal value of weight for each poles
- //! in all sections.
- //! This information is usefull to control error
- //! in rational approximation.
+ //! Compute the minimal value of weight for each poles in all sections.
+ //! This information is useful to control error in rational approximation.
//! Warning: Used only if <me> IsRational
Standard_EXPORT virtual void GetMinimalWeight (TColStd_Array1OfReal& Weigths) const;
// Condition
// Tg=theDU*theTg2D.X()+theDV*theTg2D.Y()
// has to be satisfied strictly.
-// More over, vector Tg has to be NORMALYZED
+// More over, vector Tg has to be NORMALIZED
// (if theIsTo3DTgCompute == TRUE then new computed vector will
// always have magnitude 1.0).
//=======================================================================
{
//Attention: @ \sin theAngTol \approx theAngTol @ (for cross-product)
- //Really, vector theTg3D has to be normalyzed (if theIsTo3DTgCompute == FALSE).
+ //Really, vector theTg3D has to be normalized (if theIsTo3DTgCompute == FALSE).
const Standard_Real aSQTan = theTg3D.SquareMagnitude();
const Standard_Real aSqMagnDU = theDU.SquareMagnitude(),
if(theIsTo3DTgCompute)
{
- //theTg3D will be normalyzed. Its magnitude is
+ //theTg3D will be normalized. Its magnitude is
const Standard_Real aTgMagn = 1.0;
const Standard_Real aNorm = sqrt(aSqMagnDV);
if(theIsTo3DTgCompute)
{
- //theTg3D will be normalyzed. Its magnitude is
+ //theTg3D will be normalized. Its magnitude is
const Standard_Real aTgMagn = 1.0;
const Standard_Real aNorm = sqrt(aSqMagnDU);
// Condition
// Tg=theDU*theTg2D.X()+theDV*theTg2D.Y()
// has to be satisfied strictly.
-// More over, vector Tg has always to be NORMALYZED.
+// More over, vector Tg has always to be NORMALIZED.
//=======================================================================
static Standard_Boolean NonSingularProcessing(const gp_Vec& theDU,
const gp_Vec& theDV,
aNormalPrm.Divide(sqrt(aSQMagnPrm));
}
- //Analogicaly for implicit surface
+ //Analogically for implicit surface
if(aSQMagnImp < aNullValue)
{
isImpSingular = Standard_True;
//(3D- and 2D-tangents are still not defined)
//Ask to pay attention to the fact that here
- //aNormalImp and aNormalPrm are normalyzed.
+ //aNormalImp and aNormalPrm are normalized.
//Therefore, @ \left \| \vec{Tg} \right \| = 0.0 @
//if and only if (aNormalImp || aNormalPrm).
Tg = aNormalImp.Crossed(aNormalPrm);
return Standard_False;
}
- //Normalyze Tg vector
+ //Normalize Tg vector
Tg.Divide(sqrt(aSQMagnTg));
MyTg = Tg;
}
while(i < theInds.Length());
- //IV: Cheking feature points.
+ //IV: Checking feature points.
j = 2;
for(i = 1; i <= aFeatureInds.Length(); ++i)
{
protected:
- //! Initializes the datas of a Window.
+ //! Initializes the data of a Window.
Standard_EXPORT Aspect_Window();
protected:
protected: //! @name Methods for building the result
//! Performs the building of the result.
- //! The method calls the PerfromInternal1() method surrounded by a try-catch block.
+ //! The method calls the PerformInternal1() method surrounded by a try-catch block.
Standard_EXPORT virtual void PerformInternal (const BOPAlgo_PaveFiller& thePF);
//! Performs the building of the result.
//!
//! 3. Build solids from <myFaces> using BOPAlgo_BuilderSolid algorithm;
//!
-//! 4. Treat the result: Eliminate solid containig faces from <mySBox>;
+//! 4. Treat the result: Eliminate solid containing faces from <mySBox>;
//!
//! 5. Fill internal shapes: add internal vertices and edges into
//! created solids;
- //! Empty contructor.
+ //! Empty constructor.
BOPAlgo_MakerVolume();
virtual ~BOPAlgo_MakerVolume();
- //! Empty contructor.
+ //! Empty constructor.
BOPAlgo_MakerVolume(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Clears the data.
}
}
//
- // Each vertex has one edge In and one - Out. Good. But it is not enought
- // to consider that nothing to do with this. We must check edges on TShape
- // coinsidence. If there are such edges there is something to do with.
+ // Each vertex has one edge In and one - Out. Good.
+ // But it is not enough to consider that nothing to do with this.
+ // We must check edges on TShape coincidence.
+ // If there are such edges there is something to do with.
if (bNothingToDo) {
Standard_Integer aNbE, aNbMapEE;
Standard_Boolean bFlag;
}
}// for (i=0; i<2; ++i) {
return !bRet;
-}
\ No newline at end of file
+}
- //! Empty contructor
+ //! Empty constructor
Standard_EXPORT BOPDS_CommonBlock();
- //! Contructor
- //! <theAllocator> - the allocator to manage the memory
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_CommonBlock(const Handle(NCollection_BaseAllocator)& theAllocator);
- //! Empty contructor
- BOPDS_Curve();
-virtual ~BOPDS_Curve();
+ //! Empty constructor
+ BOPDS_Curve();
+
+ virtual ~BOPDS_Curve();
- //! Contructor
- //! <theAllocator> - the allocator to manage the memory
- BOPDS_Curve(const Handle(NCollection_BaseAllocator)& theAllocator);
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
+ BOPDS_Curve(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier
- //! Empty contructor
+ //! Empty constructor
Standard_EXPORT BOPDS_DS();
-Standard_EXPORT virtual ~BOPDS_DS();
-
- //! Contructor
- //! theAllocator - the allocator to manage the memory
+ Standard_EXPORT virtual ~BOPDS_DS();
+
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_DS(const Handle(NCollection_BaseAllocator)& theAllocator);
- //! Empty contructor
- BOPDS_FaceInfo();
-virtual ~BOPDS_FaceInfo();
-
+ //! Empty constructor
+ BOPDS_FaceInfo();
+
+ virtual ~BOPDS_FaceInfo();
- //! Contructor
- //! theAllocator - the allocator to manage the memory
- BOPDS_FaceInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
+ BOPDS_FaceInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Clears the contents
- //! Empty contructor
+ //! Empty constructor
BOPDS_IndexRange();
//! Modifier
DEFINE_STANDARD_ALLOC
- //! Empty contructor
+ //! Empty constructor
Standard_EXPORT BOPDS_Iterator();
Standard_EXPORT virtual ~BOPDS_Iterator();
- //! Contructor
- //! theAllocator - the allocator to manage the memory
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_Iterator(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier
- //! Empty contructor
+ //! Empty constructor
Standard_EXPORT BOPDS_IteratorSI();
-Standard_EXPORT virtual ~BOPDS_IteratorSI();
-
- //! Contructor
- //! theAllocator - the allocator to manage the memory
+ Standard_EXPORT virtual ~BOPDS_IteratorSI();
+
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_IteratorSI(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Updates the lists of possible intersections
- //! Empty contructor
+ //! Empty constructor
BOPDS_Pave();
//! Modifier
public:
-
-
- //! Empty contructor
+ //! Empty constructor
Standard_EXPORT BOPDS_PaveBlock();
-
- //! Contructor
- //! <theAllocator> - the allocator to manage the memory
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_PaveBlock(const Handle(NCollection_BaseAllocator)& theAllocator);
-
//! Modifier
//! Sets the first pave <thePave>
- //! Empty contructor
+ //! Empty constructor
BOPDS_Point();
virtual ~BOPDS_Point();
DEFINE_STANDARD_ALLOC
-
+ //! Empty constructor
+ BOPDS_ShapeInfo();
- //! Empty contructor
- BOPDS_ShapeInfo();
-virtual ~BOPDS_ShapeInfo();
-
+ virtual ~BOPDS_ShapeInfo();
- //! Contructor
- //! theAllocator - the allocator to manage the memory
- BOPDS_ShapeInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
+ //! Constructor
+ //! @param theAllocator the allocator to manage the memory
+ BOPDS_ShapeInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier
if(aSqMagn <= gp::Resolution())
return;
- //Normalyze aT
+ //Normalize aT
aT /= sqrt(aSqMagn);
//sin(da) ~ da, when da->0.
//! The Tface from BRep is based on the TFace from
//! TopoDS. The TFace contains :
//!
-//! * A suface, a tolerance and a Location.
+//! * A surface, a tolerance and a Location.
//!
//! * A NaturalRestriction flag, when this flag is
//! True the boundary of the face is known to be the
}
}
- Forward = Standard_True; // Defaut ; The Reverse Edges are parsed.
+ Forward = Standard_True; // Default ; The Reverse Edges are parsed.
if((NbEdge > 2) || ((NbEdge==2) && (!myWire.Closed())) ) {
TopAbs_Orientation Or = myCurves->Value(1).Edge().Orientation();
TopoDS_Vertex VI, VL;
Standard_EXPORT Standard_Integer NbKnots() const Standard_OVERRIDE;
- //! Warning :
- //! This will make a copy of the Bezier Curve
- //! since it applies to it myTsrf . Be carefull when
- //! using this method
+ //! Warning:
+ //! This will make a copy of the Bezier Curve since it applies to it myTsrf.
+ //! Be careful when using this method.
Standard_EXPORT Handle(Geom_BezierCurve) Bezier() const Standard_OVERRIDE;
- //! Warning :
- //! This will make a copy of the BSpline Curve
- //! since it applies to it myTsrf . Be carefull when
- //! using this method
+ //! Warning:
+ //! This will make a copy of the BSpline Curve since it applies to it myTsrf.
+ //! Be careful when using this method.
Standard_EXPORT Handle(Geom_BSplineCurve) BSpline() const Standard_OVERRIDE;
Standard_EXPORT Handle(Geom_OffsetCurve) OffsetCurve() const Standard_OVERRIDE;
if(index==0){ //storage of the first edge features
First0=First;
- if(edge.Orientation()==TopAbs_REVERSED){ //(usefull for the closed wire)
+ if(edge.Orientation()==TopAbs_REVERSED){ //(useful for the closed wire)
Vfirst=TopExp::LastVertex(edge);
tab(index)->Reverse();
}
//! 1 - Remove all the free boundary and the faces
//! connex to such edges.
//! 2 - Remove all the shapes not valid in the result
- //! (according to the side of offseting)
- //! in this verion only the first point is implemented.
+ //! (according to the side of offsetting)
+ //! in this version only the first point is implemented.
Standard_EXPORT static TopoDS_Shape Deboucle3D (const TopoDS_Shape& S, const TopTools_MapOfShape& Boundary);
-//! The algorithm is to build a Secton operation between arguments and tools.
+//! The algorithm is to build a Section operation between arguments and tools.
//! The result of Section operation consists of vertices and edges.
//! The result of Section operation contains:
//! 1. new vertices that are subjects of V/V, E/E, E/F, F/F interferences
//! <S1> -argument
//! <S2> -tool
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const TopoDS_Shape& S2, const Standard_Boolean PerformNow = Standard_True);
//! <S2> -tool
//! <PF> - PaveFiller object that is carried out
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const TopoDS_Shape& S2, const BOPAlgo_PaveFiller& aDSF, const Standard_Boolean PerformNow = Standard_True);
//! <S1> - argument
//! <Pl> - tool
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const gp_Pln& Pl, const Standard_Boolean PerformNow = Standard_True);
//! <S1> - argument
//! <Sf> - tool
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const Handle(Geom_Surface)& Sf, const Standard_Boolean PerformNow = Standard_True);
//! <Sf> - argument
//! <S2> - tool
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const Handle(Geom_Surface)& Sf, const TopoDS_Shape& S2, const Standard_Boolean PerformNow = Standard_True);
//! <Sf1> - argument
//! <Sf2> - tool
//! <PerformNow> - the flag:
- //! if <PerformNow>=True - the algorithm is performed immediatly
+ //! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const Handle(Geom_Surface)& Sf1, const Handle(Geom_Surface)& Sf2, const Standard_Boolean PerformNow = Standard_True);
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
protected:
- //! is used by the constuctors above.
+ //! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
- //! returns the first point beeing fitted.
+ //! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
- //! returns the last point beeing fitted.
+ //! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.
Standard_EXPORT virtual void SetTolerance (const Standard_Real Tol3d, const Standard_Real Tol2d) Standard_OVERRIDE;
//! Get the barycentre of Surface. An very poor
- //! estimation is sufficent. This information is usefull
+ //! estimation is sufficient. This information is useful
//! to perform well conditioned rational approximation.
Standard_EXPORT virtual gp_Pnt BarycentreOfSurf() const Standard_OVERRIDE;
//! Returns the length of the maximum section. This
- //! information is usefull to perform well conditioned rational
+ //! information is useful to perform well conditioned rational
//! approximation.
Standard_EXPORT virtual Standard_Real MaximalSection() const Standard_OVERRIDE;
//! Compute the minimal value of weight for each poles
- //! of all sections. This information is usefull 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;
//! Approximation of the new Surface (and
//! eventually the 2d Curves on the support
//! surfaces).
- //! Normaly the 2d curve are
+ //! Normally the 2d curve are
//! approximated with an tolerance given by the
//! resolution on support surfaces, but if this
//! tolerance is too large Tol2d is used.
const TColStd_Array1OfInteger& SurfVMults() const;
- //! returns the maximum error in the suface approximation.
+ //! returns the maximum error in the surface approximation.
Standard_EXPORT Standard_Real MaxErrorOnSurf() const;
Standard_Integer NbCurves2d() const;
Standard_EXPORT Standard_Real TolCurveOnSurf (const Standard_Integer Index) const;
- //! diplay information on approximation.
+ //! display information on approximation.
Standard_EXPORT void Dump (Standard_OStream& o) const;
//=======================================================================
//function : BRepBlend_SurfRstEvolRad
-//purpose : Contructor
+//purpose : Constructor
//=======================================================================
BRepBlend_SurfRstEvolRad::BRepBlend_SurfRstEvolRad
(const Handle(Adaptor3d_Surface)& Surf,
//! Not done.
Standard_EXPORT BRepBuilderAPI_MakeFace();
- //! Load a face. Usefull to add wires.
+ //! Load a face. useful to add wires.
Standard_EXPORT BRepBuilderAPI_MakeFace(const TopoDS_Face& F);
//! Make a face from a plane.
//! these previous ones. Each must bound a closed volume.
Standard_EXPORT BRepBuilderAPI_MakeSolid(const TopoDS_Shell& S1, const TopoDS_Shell& S2, const TopoDS_Shell& S3);
- //! Make a solid from a solid. Usefull for adding later.
+ //! Make a solid from a solid. useful for adding later.
Standard_EXPORT BRepBuilderAPI_MakeSolid(const TopoDS_Solid& So);
//! Add a shell to a solid.
//! will raise an error, until a new connectable edge is added.
Standard_EXPORT BRepBuilderAPI_MakeWire(const TopoDS_Edge& E1, const TopoDS_Edge& E2, const TopoDS_Edge& E3, const TopoDS_Edge& E4);
- //! Make a Wire from a Wire. Usefull for adding later.
+ //! Make a Wire from a Wire. useful for adding later.
Standard_EXPORT BRepBuilderAPI_MakeWire(const TopoDS_Wire& W);
//! Add an edge to a wire.
}
}
- // Find all possible contigous edges
+ // Find all possible contiguous edges
TopTools_SequenceOfShape seqEdges;
seqEdges.Append(edge);
TopTools_MapOfShape mapEdges;
// . if multiple edge
// - length < 100.*myTolerance -> several free edge
// . if no multiple edge
-// - make the contigous edges sameparameter
+// - make the contiguous edges sameparameter
//=======================================================================
void BRepBuilderAPI_Sewing::EdgeProcessing(const Message_ProgressRange& theProgress)
//! Provides methods to
//!
-//! - identify possible contigous boundaries (for control
+//! - identify possible contiguous boundaries (for control
//! afterwards (of continuity: C0, C1, ...))
//!
-//! - assemble contigous shapes into one shape.
+//! - assemble contiguous shapes into one shape.
//! Only manifold shapes will be found. Sewing will not
//! be done in case of multiple edges.
//!
//! Gives each multiple edge
Standard_EXPORT const TopoDS_Edge& MultipleEdge (const Standard_Integer index) const;
- //! Gives the number of contigous edges (edge shared by two faces)
+ //! Gives the number of contiguous edges (edge shared by two faces)
Standard_EXPORT Standard_Integer NbContigousEdges() const;
- //! Gives each contigous edge
+ //! Gives each contiguous edge
Standard_EXPORT const TopoDS_Edge& ContigousEdge (const Standard_Integer index) const;
- //! Gives the sections (edge) belonging to a contigous edge
+ //! Gives the sections (edge) belonging to a contiguous edge
Standard_EXPORT const TopTools_ListOfShape& ContigousEdgeCouple (const Standard_Integer index) const;
//! Indicates if a section is bound (before use SectionToBoundary)
return myCstat;
}
- // Checks the number of occurence of an edge : maximum 2, and in this
+ // Checks the number of occurrence of an edge : maximum 2, and in this
// case, one time FORWARD and one time REVERSED
Standard_Boolean yabug = Standard_False;
//! **BRepCheck_NotConnected, if wire is not
//! topologically closed
//! **BRepCheck_RedundantEdge, if an edge is in wire
- //! more than 3 times or in case of 2 occurences if
+ //! more than 3 times or in case of 2 occurrences if
//! not with FORWARD and REVERSED orientation.
//! **BRepCheck_NoError
Standard_EXPORT BRepCheck_Status Closed (const Standard_Boolean Update = Standard_False);
//! The values can be either TopAbs_IN
//! ( the point is in the face)
//! or TopAbs_ON
- //! ( the point is on a boudary of the face).
+ //! ( the point is on a boundary of the face).
TopAbs_State State() const;
//! Returns the significant face used to determine
{
public:
- //! Creates new unitialized overlap tool.
+ //! Creates new uninitialized overlap tool.
BRepExtrema_OverlapTool();
//! Creates new overlap tool for the given element sets.
public:
- //! Creates unitialized self-intersection tool.
+ //! Creates uninitialized self-intersection tool.
Standard_EXPORT BRepExtrema_SelfIntersection (const Standard_Real theTolerance = 0.0);
//! Creates self-intersection tool for the given shape.
//! Clears internal fields and arguments.
Standard_EXPORT virtual void Clear() Standard_OVERRIDE;
- //! Initialyzes the object of local boolean operation.
+ //! Initializes the object of local boolean operation.
Standard_EXPORT void Init (const TopoDS_Shape& theShape);
- //! Initialyzes the arguments of local boolean operation.
+ //! Initializes the arguments of local boolean operation.
Standard_EXPORT void Init (const TopoDS_Shape& theShape, const TopoDS_Shape& theTool);
//! Sets the operation of local boolean operation.
//! Collects parts of the tool.
Standard_EXPORT void PartsOfTool (TopTools_ListOfShape& theLT);
- //! Initialyzes parts of the tool for second step of algorithm.
+ //! Initializes parts of the tool for second step of algorithm.
//! Collects shapes and all sub-shapes into myShapes map.
Standard_EXPORT void KeepParts (const TopTools_ListOfShape& theIm);
Standard_Real par1 = ElCLib::Parameter(ln1->Lin(), myFirstPnt);
Standard_Real par2 = ElCLib::Parameter(ln2->Lin(), myLastPnt);
if(par1 >= myTol || par2 >= myTol) {
- Concavite = 2; //paralel and concave
+ Concavite = 2; //parallel and concave
BRepLib_MakeEdge e1(myLastPnt, myFirstPnt);
WW.Add(e1);
}
TColStd_SequenceOfReal SR;
SR.Clear();
// the wire is always FORWARD
- // it is necesary to modify the parameter of cut6 if the edge is REVERSED
+ // it is necessary to modify the parameter of cut6 if the edge is REVERSED
if (E.Orientation() == TopAbs_FORWARD) {
for (j=1; j<=ndec; j++) SR.Append(paradec(j));
}
dec2(k) = dec(k);
}
- //Check of cuts: are all the new edges long enouph or not
+ //Check of cuts: are all the new edges long enough or not
TColStd_MapOfInteger CutsToRemove;
for (k = 1; k <= nbdec; k++)
{
// Find if one of two faces connected to the edge
// belongs to volevo. The edges on this face serve
// to eliminate certain vertices that can appear twice
- // on the parallel edge. These Vertices corespond to the
+ // on the parallel edge. These Vertices correspond to the
// nodes of the map.
//---------------------------------------------------------
TopoDS_Shape FaceControle;
//! 0 : It is connex (G0)
//! 1 : It is tangent (G1)
Standard_EXPORT Standard_Integer IsG1 (const Standard_Integer Index, const Standard_Real SpatialTolerance = 1.0e-7, const Standard_Real AngularTolerance = 1.0e-4) const;
-
- //! Apply the Law to a shape, for a given Curnilinear abscissa
+
+ //! Apply the Law to a shape, for a given Curvilinear abscissa
Standard_EXPORT void D0 (const Standard_Real Abscissa, TopoDS_Shape& Section);
-
- //! Find the index Law and the parmaeter, for a given
- //! Curnilinear abscissa
+
+ //! Find the index Law and the parameter, for a given Curvilinear abscissa
Standard_EXPORT void Parameter (const Standard_Real Abscissa, Standard_Integer& Index, Standard_Real& Param);
-
+
//! Return the curvilinear abscissa corresponding to a point
//! of the path, defined by <Index> of Edge and a
//! parameter on the edge.
//! Say if the Law is Constant.
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
- //! Give the law build on a concatened section
+ //! Give the law build on a concatenated section
Standard_EXPORT virtual Handle(GeomFill_SectionLaw) ConcatenedLaw() const Standard_OVERRIDE;
Standard_EXPORT virtual GeomAbs_Shape Continuity (const Standard_Integer Index, const Standard_Real TolAngular) const Standard_OVERRIDE;
Standard_EXPORT BRepFill_OffsetWire(const TopoDS_Face& Spine, const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
- //! Initialize the evaluation of Offseting.
+ //! Initialize the evaluation of Offsetting.
Standard_EXPORT void Init (const TopoDS_Face& Spine, const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
//! Performs an OffsetWire at an altitude <Alt> from
//! Possibilities are :
//! - Give one or sevral profile
//! - Give one profile and an homotetic law.
- //! - Automatic compute of correspondance between profile, and section
- //! on the sweeped shape
- //! - correspondance between profile, and section on the sweeped shape
- //! defined by a vertex of the spine
+ //! - Automatic compute of correspondence between profile, and section on the sweeped shape
+ //! - correspondence between profile, and section on the sweeped shape defined by a vertex of the spine
Standard_EXPORT void SetForceApproxC1 (const Standard_Boolean ForceApproxC1);
-
- //! Set an section. The corespondance with the spine, will
- //! be automaticaly performed.
+
+ //! Set an section. The correspondence with the spine, will be automaticaly performed.
Standard_EXPORT void Add (const TopoDS_Shape& Profile, const Standard_Boolean WithContact = Standard_False, const Standard_Boolean WithCorrection = Standard_False);
-
- //! Set an section. The corespondance with the spine, is
- //! given by <Location>
+
+ //! Set an section. The correspondence with the spine, is given by Location.
Standard_EXPORT void Add (const TopoDS_Shape& Profile, const TopoDS_Vertex& Location, const Standard_Boolean WithContact = Standard_False, const Standard_Boolean WithCorrection = Standard_False);
//! Set an section and an homotetic law.
//! Say if the Law is Constant.
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
- //! Give the law build on a concaneted section
+ //! Give the law build on a concatenated section
Standard_EXPORT virtual Handle(GeomFill_SectionLaw) ConcatenedLaw() const Standard_OVERRIDE;
Standard_EXPORT virtual GeomAbs_Shape Continuity (const Standard_Integer Index, const Standard_Real TolAngular) const Standard_OVERRIDE;
}
}
- // (3.1) Reverse the faces that have been built ealier
+ // (3.1) Reverse the faces that have been built earlier
for (ipath = 1; ipath <= NbPath; ipath++)
for (isec = 1; isec <= NbLaw; isec++)
if (IsBuilt(isec))
//! Set Approximation Tolerance
//! Tol3d : Tolerance to surface approximation
//! Tol2d : Tolerance used to perform curve approximation
- //! Normaly the 2d curve are approximated with a
+ //! Normally the 2d curve are approximated with a
//! tolerance given by the resolution on support surfaces,
//! but if this tolerance is too large Tol2d is used.
//! TolAngular : Tolerance (in radian) to control the angle
//! Sets the mode of chamfer
Standard_EXPORT void SetMode (const ChFiDS_ChamfMode theMode);
- //! return True if chamfer symetric false else.
+ //! return True if chamfer symmetric false else.
Standard_EXPORT Standard_Boolean IsSymetric (const Standard_Integer IC) const;
//! return True if chamfer is made with two distances false else.
//! - ChFi2d_NotPlanar if F is not planar,
//! - ChFi2d_NoFace if F is a null face.
Standard_EXPORT void Init (const TopoDS_Face& F);
-
- //! This initialize method allow to init the builder
- //! from a face <RefFace> and another face <ModFace>
- //! which derive from <RefFace>. This is usefull to
- //! modify a fillet or a chamfer already created on
- //! <ModFace> .
+
+ //! This initialize method allow to init the builder
+ //! from a face RefFace and another face ModFace which derive from RefFace.
+ //! This is useful to modify a fillet or a chamfer already created on ModFace.
Standard_EXPORT void Init (const TopoDS_Face& RefFace, const TopoDS_Face& ModFace);
-
+
//! Adds a fillet of radius Radius between the two edges
//! adjacent to the vertex V on the face modified by this
//! algorithm. The two edges do not need to be rectilinear.
//! It can be a curve as defined in the template CurveTool from
//! package GProp. This template gives the minimum of methods
//! required to evaluate the global properties of a curve 3D with
-//! the algorithmes of GProp.
+//! the algorithms of GProp.
class BRepGProp_Cinert : public GProp_GProps
{
public:
//! tolerance used two compare the derivative.
Standard_EXPORT static GeomAbs_Shape Continuity (const BRepAdaptor_Curve& C1, const BRepAdaptor_Curve& C2, const Standard_Real u1, const Standard_Real u2, const Standard_Real tl, const Standard_Real ta);
- //! The same as preciding but using the standard
- //! tolerances from package Precision.
+ //! The same as preceding but using the standard tolerances from package Precision.
Standard_EXPORT static GeomAbs_Shape Continuity (const BRepAdaptor_Curve& C1, const BRepAdaptor_Curve& C2, const Standard_Real u1, const Standard_Real u2);
//! -- -- MaxToleranceToCheck if so it will compute the
//! radius of -- the cylindrical pipe surface that
//! MinToleranceRequest is the minimum tolerance before it
- //! is usefull to start testing. Usually it should be arround
- //! 10e-5
- //! contains all -- the curve represenation of the edge
+ //! is useful to start testing.
+ //! Usually it should be arround 10e-5
+ //! contains all -- the curve representation of the edge
//! returns True if the Edge tolerance had to be updated
Standard_EXPORT static Standard_Boolean UpdateEdgeTol (const TopoDS_Edge& E, const Standard_Real MinToleranceRequest, const Standard_Real MaxToleranceToCheck);
//! Tolerance is smaller than MaxToleranceToCheck --
//! Returns True if at least one edge was updated --
//! MinToleranceRequest is the minimum tolerance before
- //! -- it -- is usefull to start testing. Usually it
- //! should be arround -- 10e-5--
+ //! -- it -- is useful to start testing.
+ //! Usually it should be arround -- 10e-5--
//!
//! Warning :The method is very slow as it checks all.
//! Use only in interfaces or processing assimilate batch
DEFINE_STANDARD_ALLOC
- //! Default contructor
+ //! Default constructor
BRepLib_CheckCurveOnSurface() {}
- //! Contructor
+ //! Constructor
Standard_EXPORT BRepLib_CheckCurveOnSurface(const TopoDS_Edge& theEdge,
const TopoDS_Face& theFace);
//=======================================================================
//function : BuildListConnexEdge
//purpose : giving one edge, build the list of connex edges which have
-// vertices that have only two connex edges. All the edges that are addes
+// vertices that have only two connex edges. All the edges that are added
// to the list must be added also to the mapUniq, in order for the caller
-// to not treat again theses edges.
+// to not treat again these edges.
// This list is always oriented in the "Forward" direction.
//=======================================================================
//! Not done.
Standard_EXPORT BRepLib_MakeFace();
- //! Load a face. Usefull to add wires.
+ //! Load a face. Useful to add wires.
Standard_EXPORT BRepLib_MakeFace(const TopoDS_Face& F);
//! Make a face from a plane.
//! Make a solid from three shells.
Standard_EXPORT BRepLib_MakeSolid(const TopoDS_Shell& S1, const TopoDS_Shell& S2, const TopoDS_Shell& S3);
- //! Make a solid from a solid. Usefull for adding later.
+ //! Make a solid from a solid. Useful for adding later.
Standard_EXPORT BRepLib_MakeSolid(const TopoDS_Solid& So);
//! Add a shell to a solid.
//! Make a Wire from four edges.
Standard_EXPORT BRepLib_MakeWire(const TopoDS_Edge& E1, const TopoDS_Edge& E2, const TopoDS_Edge& E3, const TopoDS_Edge& E4);
- //! Make a Wire from a Wire. Usefull for adding later.
+ //! Make a Wire from a Wire. Useful for adding later.
Standard_EXPORT BRepLib_MakeWire(const TopoDS_Wire& W);
//! Add an edge to a wire.
#include <gp_XYZ.hxx>
#include <NCollection_CellFilter.hxx>
-//! Auxilary class to find circles shot by the given point.
+//! Auxiliary class to find circles shot by the given point.
class BRepMesh_CircleInspector : public NCollection_CellFilter_InspectorXY
{
public:
myFaceMax = theMax;
}
- //! Retruns true if cell filter contains no circle.
+ //! Returns true if cell filter contains no circle.
Standard_Boolean IsEmpty () const
{
return mySelector.Circles ().IsEmpty ();
class gp_Pnt2d;
class CSLib_Class2d;
-//! Auxilary class intended for classification of points
+//! Auxiliary class intended for classification of points
//! regarding internals of discrete face.
class BRepMesh_Classifier : public Standard_Transient
{
#include <IMeshTools_Context.hxx>
-//! Class implemeting default context of BRepMesh algorithm.
+//! Class implementing default context of BRepMesh algorithm.
//! Initializes context by default algorithms.
class BRepMesh_Context : public IMeshTools_Context
{
//! Adds internal vertices to discrete polygon.
void addInternalVertices ();
- //Check deflection in 2d space for improvement of edge tesselation.
+ //Check deflection in 2d space for improvement of edge tessellation.
void splitByDeflection2d ();
void splitSegment (
Standard_EXPORT void RemoveLink(const Standard_Integer theIndex,
const Standard_Boolean isForce = Standard_False);
- //! Returns indices of elements conected to the link with the given index.
+ //! Returns indices of elements connected to the link with the given index.
//! @param theLinkIndex index of link whose data should be retrieved.
- //! @return indices of elements conected to the link.
+ //! @return indices of elements connected to the link.
const BRepMesh_PairOfIndex& ElementsConnectedTo(
const Standard_Integer theLinkIndex) const
{
-public: //! @name Auxilary API
+public: //! @name Auxiliary API
//! Dumps information about this structure.
//! @param theStream stream to be used for dump.
cleanupMesh();
// When the mesh has been cleaned up, try to process frontier edges
- // once again to fill the possible gaps that might be occured in case of "saw" -
+ // once again to fill the possible gaps that might be occurred in case of "saw" -
// situation when frontier edge has a triangle at a right side, but its free
// links cross another frontieres and meshLeftPolygonOf itself can't collect
// a closed polygon.
//=======================================================================
//function : fillBndBox
-//purpose : Add boundig box for edge defined by start & end point to
+//purpose : Add bounding box for edge defined by start & end point to
// the given vector of bounding boxes for triangulation edges
//=======================================================================
void BRepMesh_Delaun::fillBndBox(IMeshData::SequenceOfBndB2d& theBoxes,
if ( aRefLinkDir.SquareMagnitude() < Precision2 )
return Standard_True;
- // Auxilary structures.
+ // Auxiliary structures.
// Bounding boxes of polygon links to be used for preliminary
// analysis of intersections
IMeshData::SequenceOfBndB2d aBoxes;
// angle respect the given reference link.
// Each time the next link is found other neighbor links at the
// pivot node are marked as leprous and will be excluded from
-// consideration next time until a hanging end is occured.
+// consideration next time until a hanging end is occurred.
//=======================================================================
Standard_Integer BRepMesh_Delaun::findNextPolygonLink(
const Standard_Integer& theFirstNode,
//=======================================================================
//function : checkIntersection
//purpose : Check is the given link intersects the polygon boundaries.
-// Returns bounding box for the given link trough the
+// Returns bounding box for the given link through the
// <theLinkBndBox> parameter.
//=======================================================================
Standard_Boolean BRepMesh_Delaun::checkIntersection(
}
}
- // Add link to the survivers to avoid cycling
+ // Add link to the survivors to avoid cycling
theSurvivedLinks.Add( aNeighborLinkId );
killLinkTriangles( aNeighborLinkId, theLoopEdges );
}
// In this context only intersections between frontier edges
// are possible. If intersection between edges of different
- // types occured - treat this case as invalid (i.e. result
+ // types occurred - treat this case as invalid (i.e. result
// might not reflect the expectations).
if ( !theSkipped.IsNull() )
{
}
else if ( aIntFlag == BRepMesh_GeomTool::PointOnSegment )
{
- // Indentify chopping link
+ // Identify chopping link
Standard_Boolean isFirstChopping = Standard_False;
Standard_Integer aCheckPointIt = 0;
for ( ; aCheckPointIt < 2; ++aCheckPointIt )
continue;
}
- // Check is the test link crosses the polygon boudaries
+ // Check is the test link crosses the polygon boundaries
Standard_Boolean isIntersect = Standard_False;
for ( Standard_Integer aRefLinkNodeIt = 0; aRefLinkNodeIt < 2; ++aRefLinkNodeIt )
{
const Standard_Integer theCellsCountU,
const Standard_Integer theCellsCountV);
- //! Add boundig box for edge defined by start & end point to
+ //! Add bounding box for edge defined by start & end point to
//! the given vector of bounding boxes for triangulation edges.
void fillBndBox (IMeshData::SequenceOfBndB2d& theBoxes,
const BRepMesh_Vertex& theV1,
//! angle respect the given reference link.
//! Each time the next link is found other neighbor links at the pivot
//! node are marked as leprous and will be excluded from consideration
- //! next time until a hanging end is occured.
+ //! next time until a hanging end is occurred.
Standard_Integer findNextPolygonLink (const Standard_Integer& theFirstNode,
const Standard_Integer& thePivotNode,
const BRepMesh_Vertex& thePivotVertex,
Bnd_B2d& theNextLinkBndBox);
//! Check is the given link intersects the polygon boundaries.
- //! Returns bounding box for the given link trough the theLinkBndBox parameter.
+ //! Returns bounding box for the given link through the theLinkBndBox parameter.
Standard_Boolean checkIntersection (const BRepMesh_Edge& theLink,
const IMeshData::SequenceOfInteger& thePolygon,
const IMeshData::SequenceOfBndB2d& thePolyBoxes,
//! Checks if the given edge and this one have the same orientation.
//! @param theOther edge to be checked against this one.
- //! \retrun TRUE if edges have the same orientation, FALSE if not.
+ //! \return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsSameOrientation(const BRepMesh_Edge& theOther) const
{
return BRepMesh_OrientedEdge::IsEqual(theOther);
//! Auxiliary class checking wires of target face for self-intersections.
//! Explodes wires of discrete face on sets of segments using tessellation
//! data stored in model. Each segment is then checked for intersection with
-//! other ones. All collisions are registerd and returned as result of check.
+//! other ones. All collisions are registered and returned as result of check.
class BRepMesh_FaceChecker : public Standard_Transient
{
public: //! @name mesher API
if (thePointToCheck.IsEqual(thePoint1, aPrec) ||
thePointToCheck.IsEqual(thePoint2, aPrec))
{
- return -1; //coinsides with an end point
+ return -1; //coincides with an end point
}
return 1;
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
- //! @param theMinPointsNb minimum nuber of points to be produced.
+ //! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const BRepAdaptor_Curve& theCurve,
const Standard_Real theFirstParam,
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
- //! @param theMinPointsNb minimum nuber of points to be produced.
+ //! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const Handle(BRepAdaptor_Surface)& theSurface,
const GeomAbs_IsoType theIsoType,
const IMeshTools_Parameters& theParameters,
const Message_ProgressRange& theRange = Message_ProgressRange());
- //! Performs meshing ot the shape.
+ //! Performs meshing of the shape.
Standard_EXPORT virtual void Perform(const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Performs meshing using custom context;
Standard_EXPORT void CleanFrontierLinks();
//! Erases the given set of triangles.
- //! Fills map of loop edges forming the countour surrounding the erased triangles.
+ //! Fills map of loop edges forming the contour surrounding the erased triangles.
void EraseTriangles(const IMeshData::MapOfInteger& theTriangles,
IMeshData::MapOfIntegerInteger& theLoopEdges);
//! Class implements interface representing tool for discrete model building.
//!
//! The following statuses should be used by default:
-//! Message_Done1 - model has been sucessfully built.
+//! Message_Done1 - model has been successfully built.
//! Message_Fail1 - empty shape.
//! Message_Fail2 - model has not been build due to unexpected reason.
class BRepMesh_ModelBuilder : public IMeshTools_ModelBuilder
//! tolerances of 3D space only. This means that there are no specific
//! computations are made for the sake of determination of U and V tolerance.
//! Registers intersections on edges forming the face's shape and tries to
-//! amplify discrete represenation by decreasing of deflection for the target edge.
+//! amplify discrete representation by decreasing of deflection for the target edge.
//! Checks can be performed in parallel mode.
class BRepMesh_ModelHealer : public IMeshTools_ModelAlgo
{
//! Connects pcurves of previous and current edge on the specified face
//! according to topological connectivity. Uses next edge in order to
- //! identify closest point in case of signle vertex shared between both
+ //! identify closest point in case of single vertex shared between both
//! ends of edge (degenerative edge)
Standard_Boolean connectClosestPoints(
const IMeshData::IPCurveHandle& thePrevDEdge,
return aSteps.second;
}
- //! Splits 3D and all pcurves accoring using the specified step.
+ //! Splits 3D and all pcurves accordingly using the specified step.
Standard_Boolean splitEdge(const IMeshData::IEdgePtr& theDEdge,
const Standard_Real theDU) const
{
//! Checks this and other edge for equality.
//! @param theOther edge to be checked against this one.
- //! @retrun TRUE if edges have the same orientation, FALSE if not.
+ //! @return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsEqual(const BRepMesh_OrientedEdge& theOther) const
{
return (myFirstNode == theOther.myFirstNode && myLastNode == theOther.myLastNode);
return (myIndex[0] < 0);
}
- //! Returns number of initialized indeces.
+ //! Returns number of initialized indices.
Standard_Integer Extent() const
{
return (myIndex[0] < 0 ? 0 : (myIndex[1] < 0 ? 1 : 2));
namespace
{
- //! Auxilary struct to take a tolerance of edge.
+ //! Auxiliary struct to take a tolerance of edge.
struct EdgeTolerance
{
static Standard_Real Get(const TopoDS_Shape& theEdge)
}
};
- //! Auxilary struct to take a tolerance of vertex.
+ //! Auxiliary struct to take a tolerance of vertex.
struct VertexTolerance
{
static Standard_Real Get(const TopoDS_Shape& theVertex)
//=======================================================================
//function : addTriange34
-//purpose : auxilary for makeTrianglesUsingBRepMesh
+//purpose : auxiliary for makeTrianglesUsingBRepMesh
//=======================================================================
void BRepMesh_Triangulator::addTriange34(
const TColStd_SequenceOfInteger& theW,
//=======================================================================
//function : checkCondition
-//purpose : auxilary for addTriange34
+//purpose : auxiliary for addTriange34
//=======================================================================
Standard_Boolean BRepMesh_Triangulator::checkCondition(
const int (&theNodes)[4],
myIndices = new IMeshData::VectorOfInteger (wireNodesNb(myWires));
myMeshStructure = new BRepMesh_DataStructureOfDelaun (new NCollection_IncAllocator);
- // fill this structure created BRepMesh_Vertexes using 2d points recieved
+ // fill this structure created BRepMesh_Vertexes using 2d points received
// by projection initial 3d point on plane.
try
{
//=======================================================================
//function : triangulate
-//purpose : auxilary
+//purpose : auxiliary
//=======================================================================
Standard_Boolean BRepMesh_Triangulator::triangulate (NCollection_List<Poly_Triangle>& thePolyTriangles)
{
class Message_Messenger;
-//! Auxilary tool to generate triangulation
+//! Auxiliary tool to generate triangulation
class BRepMesh_Triangulator
{
public:
const NCollection_List<TColStd_SequenceOfInteger>& theWires,
const gp_Dir& theNorm);
- //! Perfroms triangulation of source wires and stores triangles the the output list.
+ //! Performs triangulation of source wires and stores triangles the the output list.
Standard_EXPORT Standard_Boolean Perform (NCollection_List<Poly_Triangle>& thePolyTriangles);
//! Set messenger for output information
private:
- // auxilary for makeTrianglesUsingBRepMesh
+ // auxiliary for makeTrianglesUsingBRepMesh
void addTriange34 (
const TColStd_SequenceOfInteger& theW,
NCollection_List<Poly_Triangle>& thePolyTriangles);
- // auxilary for addTriange34
+ // auxiliary for addTriange34
Standard_Boolean checkCondition(
const int (&theNodes)[4],
const TColStd_SequenceOfInteger& theWire);
// performs initialization of mesh data structure.
Standard_Boolean prepareMeshStructure();
- // auxilary for triangulation
+ // auxiliary for triangulation
Standard_Boolean triangulate (NCollection_List<Poly_Triangle>& thePolyTriangles);
private:
int points = inp_verts;
std::sort(vert_alloc, vert_alloc + points);
- // rmove dups
+ // remove dups
{
int w = 0, r = 1; // skip initial no-dups block
while (r < points && !Vert::overlap(vert_alloc + r, vert_alloc + w))
else
{
if (errlog_proc)
- errlog_proc(errlog_file, "[WRN] all input points are identical, returning signle point!\n");
+ errlog_proc(errlog_file, "[WRN] all input points are identical, returning single point!\n");
first_hull_vert = vert_alloc + 0;
vert_alloc[0].next = 0;
}
// so we calc all signs...
// why not testing sign of dot prod of 2 normals?
- // that way we'd fall into precission problems
+ // that way we'd fall into precision problems
Norm LvH = (*v - *last).cross(*head - *last);
bool lvh =
Face* _f = hull;
// 1. FIND FIRST VISIBLE FACE
- // simply iterate around last vertex using last added triange adjecency info
+ // simply iterate around last vertex using last added triangle adjecency info
while (_f->dot(*_q) <= 0)
{
_f = _f->Next(_p);
}
// if add<del+2 hungry hull has consumed some point
- // that means we can't do delaunay for some under precission reasons
- // althought convex hull would be fine with it
+ // that means we can't do delaunay for some under precision reasons
+ // although convex hull would be fine with it
assert(add == del + 2);
// 3. SEW SIDES OF CONE BUILT ON SLIHOUTTE SEGMENTS
if (aV1.IsSame(aCurVertex))
break;
}
- if (ind > aEseq.Length()) //error occured: wire is not closed
+ if (ind > aEseq.Length()) //error occurred: wire is not closed
break;
aBB.Add(aNewWire, aCurEdge);
//! Computes max safe offset value for the given tolerance.
Standard_Real GetSafeOffset(const Standard_Real theExpectedToler);
- //! Returnes result shape for the given one (if exists).
+ //! Returns result shape for the given one (if exists).
Standard_EXPORT const TopoDS_Shape Generated(const TopoDS_Shape& theShape) const;
- //! Returnes modified shape for the given one (if exists).
+ //! Returns modified shape for the given one (if exists).
Standard_EXPORT const TopoDS_Shape Modified(const TopoDS_Shape& theShape) const;
protected:
//!
//! Created(E) = E'
//! with: E = an edge of <Face>
- //! E' = the image of E in the offseting of
+ //! 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, const Standard_Boolean OffsetOutside = Standard_True, const GeomAbs_JoinType JoinType = GeomAbs_Arc);
Standard_EXPORT BRepOffset_Offset(const TopoDS_Edge& Path, const TopoDS_Edge& Edge1, const TopoDS_Edge& Edge2, const Standard_Real Offset, const TopoDS_Edge& FirstEdge, const TopoDS_Edge& LastEdge, const Standard_Boolean Polynomial = Standard_False, const Standard_Real Tol = 1.0e-4, const GeomAbs_Shape Conti = GeomAbs_C1);
//! Tol and Conti are only used if Polynomial is True
- //! (Used to perfrom the approximation)
+ //! (Used to perform the approximation)
Standard_EXPORT BRepOffset_Offset(const TopoDS_Vertex& Vertex, const TopTools_ListOfShape& LEdge, const Standard_Real Offset, const Standard_Boolean Polynomial = Standard_False, const Standard_Real Tol = 1.0e-4, const GeomAbs_Shape Conti = GeomAbs_C1);
Standard_EXPORT void Init (const TopoDS_Face& Face, const Standard_Real Offset, const Standard_Boolean OffsetOutside = Standard_True, const GeomAbs_JoinType JoinType = GeomAbs_Arc);
Standard_EXPORT void Init (const TopoDS_Edge& Path, const TopoDS_Edge& Edge1, const TopoDS_Edge& Edge2, const Standard_Real Offset, const TopoDS_Edge& FirstEdge, const TopoDS_Edge& LastEdge, const Standard_Boolean Polynomial = Standard_False, const Standard_Real Tol = 1.0e-4, const GeomAbs_Shape Conti = GeomAbs_C1);
//! Tol and Conti are only used if Polynomial is True
- //! (Used to perfrom the approximation)
+ //! (Used to perform the approximation)
Standard_EXPORT void Init (const TopoDS_Vertex& Vertex, const TopTools_ListOfShape& LEdge, const Standard_Real Offset, const Standard_Boolean Polynomial = Standard_False, const Standard_Real Tol = 1.0e-4, const GeomAbs_Shape Conti = GeomAbs_C1);
//! Only used in Rolling Ball. Pipe on Free Boundary
//! 1 - Remove all the free boundary and the faces
//! connex to such edges.
//! 2 - Remove all the shapes not valid in the result
- //! (according to the side of offseting)
- //! in this verion only the first point is implemented.
+ //! (according to the side of offsetting)
+ //! in this version only the first point is implemented.
Standard_EXPORT static TopoDS_Shape Deboucle3D (const TopoDS_Shape& S,
const TopTools_MapOfShape& Boundary);
//! the non-empty constructor or the Init function.
Standard_EXPORT const TopoDS_Shape& ProblematicShape() const;
- //! Returns an error status when an error has occured
- //! (Face, Edge or Vertex recomputaion 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
//! IsDone returns Standard_False.
class TopoDS_Edge;
-//! Provides methods to identify contigous boundaries
-//! for continuity control (C0, C1, ...)
+//! Provides methods to identify contiguous boundaries for continuity control (C0, C1, ...)
//!
//! Use this function as following:
//! - create an object
//! further shapes subsequently and then to repeat the call to Perform.
Standard_EXPORT void Perform();
- //! Gives the number of edges (free edges + contigous
- //! edges + multiple edge)
+ //! Gives the number of edges (free edges + contiguous edges + multiple edge)
Standard_EXPORT Standard_Integer NbEdges() const;
//! Returns the number of contiguous edges found by the
Standard_EXPORT BRepOffsetAPI_MakeOffset(const TopoDS_Wire& Spine, const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
- //! Initialize the evaluation of Offseting.
+ //! Initialize the evaluation of Offsetting.
Standard_EXPORT void Init (const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
//! Initializes the algorithm to construct parallels to the wire Spine.
//! Possibilities are :
//! - Give one or sevral section
//! - Give one profile and an homotetic law.
- //! - Automatic compute of correspondance between spine, and section
+ //! - Automatic compute of correspondence between spine, and section
//! on the sweeped shape
- //! - correspondance between spine, and section on the sweeped shape
+ //! - correspondence between spine, and section on the sweeped shape
//! defined by a vertex of the spine
Standard_EXPORT void SetMode (const TopoDS_Wire& AuxiliarySpine, const Standard_Boolean CurvilinearEquivalence, const BRepFill_TypeOfContact KeepContact = BRepFill_NoContact);
Standard_EXPORT void SetTransitionMode (const BRepBuilderAPI_TransitionMode Mode = BRepBuilderAPI_Transformed);
//! Simulates the resulting shape by calculating its
- //! cross-sections. The spine is devided by this
+ //! cross-sections. The spine is divided by this
//! cross-sections into (NumberOfSection - 1) equal
//! parts, the number of cross-sections is
//! NumberOfSection. The cross-sections are wires and
//! <d1><d2><d3> direction.
Standard_EXPORT gp_Pnt Point (const BRepPrim_Direction d1, const BRepPrim_Direction d2, const BRepPrim_Direction d3);
- //! Checkes a shape on degeneracy
+ //! Checks a shape on degeneracy
//! @return TRUE if a shape is degenerated
Standard_EXPORT Standard_Boolean IsDegeneratedShape();
//! raised if the radius is < Resolution.
Standard_EXPORT BRepPrim_Sphere(const Standard_Real Radius);
- //! Creates a Sphere with Center and Radius. Axes are
- //! the referrence axes. This is the STEP
- //! constructor.
+ //! Creates a Sphere with Center and Radius.
+ //! Axes are the reference axes.
+ //! This is the STEP constructor.
Standard_EXPORT BRepPrim_Sphere(const gp_Pnt& Center, const Standard_Real Radius);
//! Creates a sphere with given axes system.
{
if (anIt.Value().IsEqual(anE))
{
- //First occurence of initial deg. edge is not replaced
+ //First occurrence of initial deg. edge is not replaced
aCEL.Remove(anIt);
break;
}
if (anIt.Value().Orientation() == anE.Orientation())
{
- //All other occurences of anE are replaced by any copy
+ //All other occurrences of anE are replaced by any copy
//with suitable orientation
isReplaced = Standard_True;
aSubs.Replace(anE, anIt.Value());
Handle(GeomAdaptor_Curve) HC = new GeomAdaptor_Curve();
HC->Load(C, First, Last);
- //Checking coinsidence axe of revolution and basis curve
+ //Checking coincidence axe of revolution and basis curve
//This code is taken directly from GeomAdaptor_SurfaceOfRevolution
Standard_Integer Ratio = 1;
Standard_Real Dist;
Ratio++;
} while (Dist < Precision::Confusion() && Ratio < 100);
//
- if (Ratio >= 100) // edge coinsides with axes
+ if (Ratio >= 100) // edge coincides with axes
{
IsValid = Standard_True; //Such edges are allowed by revol algo and treated
- //by special way, so they must be concidered as valid
+ //by special way, so they must be considered as valid
}
else
{
Standard_EXPORT BRepSweep_Iterator();
- //! Rese
st the Iterator on sub-shapes of <aShape>.
+ //! Reset the Iterator on sub-shapes of <aShape>.
Standard_EXPORT void Init (const TopoDS_Shape& aShape);
//! Returns True if there is a current sub-shape.
//! The topology is like a grid of shapes. Each shape
//! of the grid must be addressable without confusion
//! by one or two objects from the generating or
-//! directing shapes. Here are exemples of correct
+//! directing shapes. Here are examples of correct
//! associations to address:
//!
//! - a vertex : GenVertex - DirVertex
//!
//! The method Has... is given because in some special
//! cases, a vertex, an edge or a face may be
-//! geometricaly nonexistant or not usefull.
+//! geometricaly nonexistant or not useful.
class BRepSweep_NumLinearRegularSweep
{
public:
Standard_EXPORT virtual Standard_Boolean GDDShapeIsToAdd (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirS, const Sweep_NumShape& aSubDirS) const = 0;
//! In some particular cases the topology of a
- //! generated face must be composed of independant
+ //! generated face must be composed of independent
//! closed wires, in this case this function returns
//! true.
Standard_EXPORT virtual Standard_Boolean SeparatedWires (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const TopoDS_Shape& aSubGenS, const Sweep_NumShape& aDirS) const = 0;
//! In some particular cases the topology of a
- //! generated Shell must be composed of independant
+ //! generated Shell must be composed of independent
//! closed Shells, in this case this function returns
- //! a Compound of independant Shells.
+ //! a Compound of independent Shells.
Standard_EXPORT virtual TopoDS_Shape SplitShell (const TopoDS_Shape& aNewShape) const;
//! Called to propagate the continuity of every vertex
Standard_EXPORT Standard_Boolean GDDShapeIsToAdd (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirS, const Sweep_NumShape& aSubDirS) const Standard_OVERRIDE;
//! In some particular cases the topology of a
- //! generated face must be composed of independant
+ //! generated face must be composed of independent
//! closed wires, in this case this function returns
- //! true. The only case in whitch the function may
+ //! true. The only case in which the function may
//! return true is a planar face in a closed revol.
Standard_EXPORT Standard_Boolean SeparatedWires (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const TopoDS_Shape& aSubGenS, const Sweep_NumShape& aDirS) const Standard_OVERRIDE;
//! In some particular cases the topology of a
- //! generated Shell must be composed of independant
+ //! generated Shell must be composed of independent
//! closed Shells, in this case this function returns
- //! a Compound of independant Shells.
+ //! a Compound of independent Shells.
Standard_EXPORT virtual TopoDS_Shape SplitShell (const TopoDS_Shape& aNewShape) const Standard_OVERRIDE;
//! Returns true if aDirS and aGenS addresses a
Standard_EXPORT Standard_Boolean GDDShapeIsToAdd (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirS, const Sweep_NumShape& aSubDirS) const;
//! In some particular cases the topology of a
- //! generated face must be composed of independant
+ //! generated face must be composed of independent
//! closed wires, in this case this function returns
//! true.
//! Here it always returns false.
//! proposed :
//!
//! - sharing basis elements (the generatrice can be
-//! modified , for exemples PCurves can be added on
+//! modified , for example PCurves can be added on
//! faces);
//!
//! - copying everything.
//! be called in the initialize.
Standard_EXPORT void Init();
- //! function called to analize the way of construction
+ //! function called to analyze the way of construction
//! of the shapes generated by aGenS and aDirV.
Standard_EXPORT Standard_Boolean Process (const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirV);
Standard_EXPORT virtual Standard_Boolean GDDShapeIsToAdd (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirS, const Sweep_NumShape& aSubDirS) const = 0;
//! In some particular cases the topology of a
- //! generated face must be composed of independant
+ //! generated face must be composed of independent
//! closed wires, in this case this function returns
//! true.
Standard_EXPORT virtual Standard_Boolean SeparatedWires (const TopoDS_Shape& aNewShape, const TopoDS_Shape& aNewSubShape, const TopoDS_Shape& aGenS, const TopoDS_Shape& aSubGenS, const Sweep_NumShape& aDirS) const = 0;
if (Inside==1) KeepInside = Standard_False;
MkDraft.Perform(Surf, KeepInside);
}
- else { // by Lenght
+ else { // by Length
Standard_Real L = Draw::Atof(a[7]);
if (L > 1.e-7) {
MkDraft.Perform(L);
di << " Make evolved profile on spine.\n";
di << " -solid means make closed solid.\n";
di << " -v means use alternative algorithm (volume mode).\n";
- di << " -a means referencial CS is automatically computed, otherwise global CS is used. \n";
+ di << " -a means referential CS is automatically computed, otherwise global CS is used. \n";
di << " -t sets the tolerance.\n";
di << " -parallel turns on parallel execution.\n";
return 0;
{
if (n == 1) {
di << "build sweep result [-M/-C/-R] [-S] [tol] : options are\n";
- di << " -M : Discontinuities are treated by Modfication of\n";
+ di << " -M : Discontinuities are treated by Modification of\n";
di << " the sweeping mode : it is the default\n";
di << " -C : Discontinuities are treated like Right Corner\n";
- di << " Treatement is Extent && Intersect\n";
+ di << " Treatment is Extent && Intersect\n";
di << " -R : Discontinuities are treated like Round Corner\n";
- di << " Treatement is Intersect and Fill\n";
+ di << " Treatment is Intersect and Fill\n";
di << " -S : To build a Solid\n";
return 0;
}
//! Update a compound (nothing is done)
Standard_EXPORT static void Update (const TopoDS_Compound& C);
- //! Update a shape, call the corect update.
+ //! Update a shape, call the correct update.
Standard_EXPORT static void Update (const TopoDS_Shape& S);
//! For each edge of the face <F> reset the UV points
{
// rem dub 16/09/97 : Make constant topology or not make at all.
// Do not make if CopySurface = 1
- // Atention, TRUE sewing edges (RealyClosed)
+ // Atention, TRUE sewing edges (ReallyClosed)
// stay even if CopySurface is true.
// check that edge contains two pcurves on this surface:
//! vertex, an edge or a face)
Standard_EXPORT Standard_Boolean IsCopied (const TopoDS_Shape& S) const;
- //! Returns the shape substitued to <S> in the Quilt.
+ //! Returns the shape substituted to <S> in the Quilt.
Standard_EXPORT const TopoDS_Shape& Copy (const TopoDS_Shape& S) const;
//! Returns a Compound of shells made from the current
// Workaround is following: Now we don`t use tellg for get position in stream.
// Now able to read file (when reading TopAbs_FACE) without tellg.
// We simple check the next string if there are value that equal 2
-// (It means a parametr for triangulation).
+// (It means a parameter for triangulation).
//=======================================================================
//! Returns True if <S> has been replaced .
Standard_EXPORT Standard_Boolean IsCopied (const TopoDS_Shape& S) const;
- //! Returns the set of shapes substitued to <S> .
+ //! Returns the set of shapes substituted to <S>.
Standard_EXPORT const TopTools_ListOfShape& Copy (const TopoDS_Shape& S) const;
const Standard_Integer Dimension,
Standard_Real& Poles)
{
- // First phase independant of U, compute the poles of the derivatives
+ // First phase independent of U, compute the poles of the derivatives
Standard_Integer i,j,iDim,min,Dmi,DDmi,jDmi,Degm1;
Standard_Real *knot = &Knots, *pole, coef, *tbis, *psav, *psDD, *psDDmDim;
psav = &Poles;
}
if (Periodic) {
- //for periodic B-Spline the requirement is that multiplicites of the first
+ //for periodic B-Spline the requirement is that multiplicities of the first
//and last knots must be equal (see Geom_BSplineCurve constructor for
//instance);
//respectively AddMults() must meet this requirement if AddKnots() contains
NbKnots++;
}
// We must add exactly until Degree + 1 ->
- // Supress the excedent.
+ // Suppress the excedent.
if ( sigma > Degree + 1)
NbPoles -= sigma - Degree - 1;
NbKnots++;
}
// We must add exactly until Degree + 1 ->
- // Supress the excedent.
+ // Suppress the excedent.
if ( sigma > Degree + 1)
NbPoles -= sigma - Degree - 1;
}
//! Used as argument for a flatknots evaluation.
static TColStd_Array1OfInteger* NoMults();
- //! Stores in LK the usefull knots for the BoorSchem
+ //! Stores in LK the useful knots for the BoorSchem
//! on the span Knots(Index) - Knots(Index+1)
Standard_EXPORT static void BuildKnots (const Standard_Integer Degree, const Standard_Integer Index, const Standard_Boolean Periodic, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger* Mults, Standard_Real& LK);
// will be homogeneous that is no division or multiplication
// by weigths will happen. On the contrary if HomogeneousFlag
// is 0 then the poles will be multiplied first by the weights
-// and after interpolation they will be devided by the weights
+// and after interpolation they will be divided by the weights
//=======================================================================
Standard_Integer
TopLoc_Location Loc;
Standard_Real Tol = Precision::Confusion();
- // Seach only isos on analytical surfaces.
+ // Search only isos on analytical surfaces.
Geom2dAdaptor_Curve C(Curve);
GeomAdaptor_Surface S(Surf);
GeomAbs_CurveType CTy = C.GetType();
const Standard_Boolean isMess = Standard_False,
const Message_ProgressRange& theRange = Message_ProgressRange());
- //! checks the shapes section can be correctly retreived.
+ //! checks the shapes section can be correctly retrieved.
Standard_EXPORT virtual void CheckShapeSection (const Storage_Position& thePos, Standard_IStream& theIS);
//! clears the reading-cash data in drivers if any.
//=======================================================================
//function : WriteInfoSection
-//purpose : Write info secton using FSD_BinaryFile driver
+//purpose : Write info section using FSD_BinaryFile driver
//=======================================================================
#define START_TYPES "START_TYPES"
//! attributes to store
Standard_EXPORT Standard_Boolean FirstPassSubTree (const TDF_Label& L, TDF_LabelList& ListOfEmptyL);
- //! Write info secton using FSD_BinaryFile driver
+ //! Write info section using FSD_BinaryFile driver
Standard_EXPORT void WriteInfoSection (const Handle(CDM_Document)& theDocument, Standard_OStream& theOStream);
Standard_EXPORT void UnsupportedAttrMsg (const Handle(Standard_Type)& theType);
} else
return Standard_False;
} else {
- // read the datum's trasformation
+ // read the datum's transformation
gp_Trsf aTrsf;
Standard_Real aScaleFactor;
}
//=============================================================================
-// calcul the distance betweem the point and the bissectrice. +
+// calcul the distance between the point and the bissectrice. +
// and orientation of the bissectrice. +
// apoint : point of passage. +
// abisector : calculated bissectrice. +
// gp_Dir2d(circle1.Location().X() - PMil.X(),
// circle1.Location().Y() - PMil.Y()));
if (!circle1.Location().IsEqual(PMil,PreConf)) {
- // PMil doesn't coinside with the circle location.
+ // PMil doesn't coincide with the circle location.
line = gp_Lin2d(PMil,
gp_Dir2d(circle1.Location().X() - PMil.X(),
circle1.Location().Y() - PMil.Y()));
} else if (radius1 >= PreConf) {
- // PMil coinsides with the circle location and radius is greater then 0.
+ // PMil coincides with the circle location and radius is greater then 0.
line = gp_Lin2d(circle1.Location(),
gp_Dir2d(P1.Y() - circle1.Location().Y(),
circle1.Location().X() - P1.X()));
{
// Bezier surface:
// All of poles used for any parameter,
- // thats why in case of trimmed parameters handled by grid algorithm.
+ // that's why in case of trimmed parameters handled by grid algorithm.
if (Abs(UMin-S.FirstUParameter()) > PTol ||
Abs(VMin-S.FirstVParameter()) > PTol ||
//!
//! Handle(CDM_Document) theDocument=myApplication->Retrieve("|user|cascade","box");
//!
- //! Since the version is not specified in this syntax, the latest wil be used.
+ //! Since the version is not specified in this syntax, the latest will be used.
//! A link is kept with the database through an instance of CDM_MetaData
Standard_EXPORT Handle(CDM_Document) Retrieve
(const TCollection_ExtendedString& aFolder,
Standard_EXPORT virtual TCollection_ExtendedString BuildFileName (const Handle(CDM_Document)& aDocument) = 0;
- //! this methods is usefull if the name of an object --
- //! depends on the metadatadriver. For example a Driver
+ //! this method is useful if the name of an object --
+ //! depends on the metadatadriver. For example a Driver
//! -- based on the operating system can choose to add
//! the extension of file to create to the object.
Standard_EXPORT virtual TCollection_ExtendedString SetName (const Handle(CDM_Document)& aDocument, const TCollection_ExtendedString& aName);
//! Returns empty sequence if no comments are associated.
Standard_EXPORT void Comments (TColStd_SequenceOfExtendedString& aComments) const;
- //! returns the first of associated comments. By defaut
- //! the comment is an empty string.
+ //! Returns the first of associated comments.
+ //! By default the comment is an empty string.
Standard_EXPORT Standard_ExtString Comment() const;
Standard_EXPORT Standard_Boolean IsStored() const;
//! defines the name under which the object should be stored.
Standard_EXPORT void SetRequestedName (const TCollection_ExtendedString& aName);
- //! determines under which the document is going to be
- //! store. By default the name of the document wil be --
- //! used. If the document has no name its presentation
- //! will be used.
+ //! Determines under which the document is going to be store.
+ //! By default the name of the document will be used.
+ //! If the document has no name its presentation will be used.
Standard_EXPORT TCollection_ExtendedString RequestedName();
Standard_EXPORT void SetRequestedPreviousVersion (const TCollection_ExtendedString& aPreviousVersion);
// calculate the total length of the curve
// calculate an approached point by assimilating the curve to a staight line
// calculate the length of the curve between the start point and the approached point
-// by succsessive iteration find the point and its associated parameter
+// by successive iteration find the point and its associated parameter
// call to FunctionRoot
#include <Adaptor2d_Curve2d.hxx>
Standard_EXPORT void Perform (const Standard_Real Abscissa, const Standard_Real U0, const Standard_Real Ui, const Standard_Real Resolution);
//! Computes the point at the distance <Abscissa> of
- //! the curve; performs more appropriate tolerance managment;
+ //! the curve; performs more appropriate tolerance management;
//! to use this method in right way it is necessary to call
- //! empty consructor. then call method Init with
+ //! empty constructor. then call method Init with
//! Tolerance = Resolution, then call AdvPermorm.
//! U0 is the parameter of the point from which the distance
//! is measured and Ui is the starting value for the iterative
{
myX0 = X0;
myL = L;
- myTol = -1; //to supress the tolerance
+ myTol = -1; //to suppress the tolerance
}
void CPnts_MyRootFunction::Init(const Standard_Real X0,
NormD2 = V2.CrossMagnitude(V1) / NormD1;
// passing of arrow starting from which the redivision is done is arbitrary
- // probably it will be necessary to readjust it (differenciate the first point
+ // probably it will be necessary to readjust it (differentiate the first point
// from the others) this test does not work on the points of inflexion
if (NormD2 > myDeflection / 5.0) {
//! If there is a singularity on the surface the previous method
//! cannot compute the local normal.
- //! This method computes an approched normal direction of a surface.
+ //! This method computes an approached normal direction of a surface.
//! It does a limited development and needs the second derivatives
//! on the surface as input data.
//! It computes the normal as follow :
//! . if DNu/DNv or DNv/DNu is lower or equal than Real Epsilon
//! Done = False, the normal is undefined
//! . if DNu IsNull and DNv is Null Done = False, there is an
- //! indetermination and we should do a limited developpement at
+ //! indetermination and we should do a limited development at
//! order 2 (it means that we cannot omit Eps).
//! . if DNu Is not Null and DNv Is not Null Done = False, there are
//! an infinity of normals at the considered point on the surface.
//! the fillet edge for any type of edges including
//! ellipses and b-splines.
//! The edges may even have no common point.
-//! ChFi2d_ChamferAPI - an algoroithm for construction of chamfers
+//! ChFi2d_ChamferAPI - an algorithm for construction of chamfers
//! between two linear edges of a plane.
//!
//! The algorithms ChFi2d_AnaFilletAlgo and ChFi2d_FilletAlgo may be used directly
#ifndef _ChFi2d_ConstructionError_HeaderFile
#define _ChFi2d_ConstructionError_HeaderFile
-//! error that can occur during the
-//! fillet construction on planar wire//! the face is not planar//! the face is null//! the two faces used for the initialisation are
-//! uncompatible.//! the parameters as distances or angle for
-//! chamfer are less or equal to zero.//! the initialization has been succesfull.//! the algorithm could not find a solution.//! the vertex given to locate the fillet or the
-//! chamfer is not connected to 2 edges.//! the two edges connected to the vertex are tangent.//! the first edge is degenerated.//! the last edge is degenerated.//! the two edges are degenerated.//! 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
+//! Error that can occur during the fillet construction on planar wire.
enum ChFi2d_ConstructionError
{
-ChFi2d_NotPlanar,
-ChFi2d_NoFace,
-ChFi2d_InitialisationError,
-ChFi2d_ParametersError,
-ChFi2d_Ready,
-ChFi2d_IsDone,
-ChFi2d_ComputationError,
-ChFi2d_ConnexionError,
-ChFi2d_TangencyError,
-ChFi2d_FirstEdgeDegenerated,
-ChFi2d_LastEdgeDegenerated,
-ChFi2d_BothEdgesDegenerated,
-ChFi2d_NotAuthorized
+ ChFi2d_NotPlanar, //!< the face is not planar
+ ChFi2d_NoFace, //!< the face is null
+ ChFi2d_InitialisationError, //!< the two faces used for the initialisation are uncompatible
+ ChFi2d_ParametersError, //!< the parameters as distances or angle for chamfer are less or equal to zero
+ ChFi2d_Ready, //!< the initialization has been successful
+ ChFi2d_IsDone,
+ ChFi2d_ComputationError, //!< the algorithm could not find a solution
+ ChFi2d_ConnexionError, //!< the vertex given to locate the fillet or the chamfer is not connected to 2 edges
+ ChFi2d_TangencyError, //!< the two edges connected to the vertex are tangent
+ ChFi2d_FirstEdgeDegenerated, //!< the first edge is degenerated
+ 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
};
#endif // _ChFi2d_ConstructionError_HeaderFile
//! 3. Using Newton search method take the point on the segment where function
//! value is most close to zero. If it is not enough close, step 2 and 3 are
//! repeated taking as start or end point the found point.
-//! 4. If solution is found, result is created on point on root of the function
-//! (as a start point), point of the projection onto second curve (as an end
-//! point) and center of arc in found center. Initial edges are cutted by
-//! the start and end point of tangency.
+//! 4. If solution is found, result is created on point on root of the function (as a start point),
+//! point of the projection onto second curve (as an end point) and center of arc in found center.
+//! Initial edges are cut by the start and end point of tangency.
class ChFi2d_FilletAlgo
{
public:
//! Stores roots in myResultParams.
void PerformNewton(FilletPoint*, FilletPoint*);
//! Splits segment by the parameter and calls Newton method for both segments.
- //! It supplies recursive iterations of the Newthon methods calls
+ //! It supplies recursive iterations of the Newton methods calls
//! (PerformNewton calls this function and this calls Netwton two times).
Standard_Boolean ProcessPoint(FilletPoint*, FilletPoint*, Standard_Real);
//! of failure WalkingFailure,TwistedSurface,Error, Ok
Standard_EXPORT ChFiDS_ErrorStatus StripeStatus (const Standard_Integer IC) const;
- //! Reset all results of compute and returns the algorythm
- //! in the state of the last acquisition to
- //! enable modification of contours or areas.
+ //! Reset all results of compute and returns the algorithm
+ //! in the state of the last acquisition to enable modification of contours or areas.
Standard_EXPORT void Reset();
//! Returns the Builder of topologic operations.
}
//=======================================================================
//function : ChFi3d_CircularSpine
-//purpose : Calculate a cicular guideline for the corner created from
-// tangent points and vectors calculated at the extremities
+//purpose : Calculate a circular guideline for the corner created from
+// tangent points and vectors calculated at the extremities
// of guidelines of start and end fillets.
//=======================================================================
Handle(Geom_Circle) ChFi3d_CircularSpine(Standard_Real& WFirst,
Dist = DistL; }
if (Dist <= maxtol + BRep_Tool::Tolerance(V[Index_min]) ) {
- // a prexisting vertex has been met
+ // a preexisting vertex has been met
CP.SetVertex(V[Index_min]); //the old vertex is loaded
CP.SetPoint( BRep_Tool::Pnt(V[Index_min]) );
maxtol = Max(BRep_Tool::Tolerance(V[Index_min]),maxtol);
if(nbl==0) {
// solution of adjustment for SGI
- // if the intersection of gs1 with gs2 doesnot worke
+ // if the intersection of gs1 with gs2 does not work
// then the intersection of gs2 with gs1 is attempted.
inter.Perform(gs2,gs1,tolap,1,1,1);
C3d = new Geom_TrimmedCurve(C3d,Uf,Ul);
Pc1 = new Geom2d_TrimmedCurve(Pc1,Uf,Ul);
Pc2 = new Geom2d_TrimmedCurve(Pc2,Uf,Ul);
- //is it necesary to invert ?
+ //is it necessary to invert ?
Standard_Real DistDebToDeb = ptestdeb.Distance(pdeb);
Standard_Real DistDebToFin = ptestdeb.Distance(pfin);
Standard_Real DistFinToFin = ptestfin.Distance(pfin);
}
}
if (Trouve < 2) return Standard_False;
- // Calculate the normal and the angles in the asssociated vector plane
+ // Calculate the normal and the angles in the associated vector plane
gp_Vec Normal;
Normal = Vec3d[0] ^ Vec3d[1];
if (Normal.SquareMagnitude() < Precision::Confusion()) {//Colinear case
PC = BRep_Tool::CurveOnSurface(cured,f1forward,Uf,Ul);
I1->Initialize((const Handle(Adaptor3d_Surface)&)HS1);
PC->D1(woned, P1, derive);
- // There are ponts on the border, and internal points are found
+ // There are points on the border, and internal points are found
if (derive.Magnitude() > Precision::PConfusion()) {
derive.Normalize();
derive.Rotate(M_PI/2);
else notons = 1;
const ChFiDS_CommonPoint& CPbis = SD->Vertex(isfirst,notons);
if (CPbis.IsOnArc()) { // It is checked if it is not the extension zone
- // In case CP is not at the end of surfdata and it is not necesary to take it into account
+ // In case CP is not at the end of surfdata and it is not necessary to take it into account
// except for separate cases (ie pointus) ...
//ts and tns were earlier CP.Parameter() and CPbis.Parameter, but sometimes they had no values.
Standard_Real ts=SD->Interference(ons).Parameter(isfirst), tns=SD->Interference(notons).Parameter(isfirst);
// To do: modify for intcouture
#define VARIANT1
- // First of all the ponts are cut with the edge of the spine.
+ // First of all the points are cut with the edge of the spine.
Standard_Integer IArcspine = DStr.AddShape(Arcspine);
Standard_Integer IVtx = DStr.AddShape(Vtx);
TopAbs_Orientation OVtx = TopAbs_FORWARD;
/***********************************************************************/
// find faces intersecting with the fillet and edges limiting intersections
- // nbface is the nb of faces intersected, Face[i] contais the faces
- // to intersect (i=0.. nbface-1). Edge[i] contains edges limiting
- // the intersections (i=0 ..nbface)
+ // nbface is the nb of faces intersected, Face[i] contains the faces
+ // to intersect (i=0.. nbface-1). Edge[i] contains edges limiting
+ // the intersections (i=0 ..nbface)
/**********************************************************************/
Standard_Integer nb = 1,nbface;
if (isOnSame1 ? shrink [nb+1] : !shrink [nb]) break;
Handle(Geom_Curve) Cend = DStr.Curve(indcurve[nb]).Curve();
Handle(Geom2d_Curve) PCend = InterfPS[nb]->PCurve();
- // point near which self intersection may occure
+ // point near which self intersection may occur
TopOpeBRepDS_Point& Pds = DStr.ChangePoint(midIpoint);
const gp_Pnt& Pvert = Pds.Point();
Standard_Real tol = Pds.Tolerance();
Handle(ChFiDS_Stripe) Stripe;
Handle(ChFiDS_Spine) Spine;
- // A value of symetric extension is calculated
+ // A value of symmetric extension is calculated
for ( ; itel.More(); itel.Next()) {
Stripe = itel.Value();
Spine = Stripe->Spine();
//! Set the radius of the contour of index IC.
Standard_EXPORT void SetRadius (const Handle(Law_Function)& C, const Standard_Integer IC, const Standard_Integer IinC);
- //! Returns true the contour is flaged as edge constant.
+ //! Returns true the contour is flagged as edge constant.
Standard_EXPORT Standard_Boolean IsConstant (const Standard_Integer IC);
//! Returns the vector if the contour is flagged as edge
void ChFiDS_ChamfSpine::GetDist(Standard_Real& Dis) const
{
- if (mChamf != ChFiDS_Sym) throw Standard_Failure("Chamfer is not symetric");
+ if (mChamf != ChFiDS_Sym)
+ {
+ throw Standard_Failure ("Chamfer is not symmetric");
+ }
Dis = d1;
}
//! arc returned by the method Arc().
Standard_EXPORT Standard_Real ParameterOnArc() const;
- //! Returns the parameter the paramter on the spine
+ //! Returns the parameter on the spine
Standard_EXPORT Standard_Real Parameter() const;
//! Returns the 3d point
// changes due to the fact the parameters of the chamfer must go increasing
// from surface S1 to surface S2
if (!plandab) {
- gcyl->VReverse();// be carefull : the SemiAngle was changed
+ gcyl->VReverse();// be careful : the SemiAngle was changed
ChamfAx3 = gcyl->Position();
}
// changes due to the fact the parameters of the chamfer must go increasing
// from surface S1 to surface S2
if (!plandab) {
- gcon->VReverse();// be carefull : the SemiAngle was changed
+ gcon->VReverse();// be careful : the SemiAngle was changed
ChamfAx3 = gcon->Position();
SemiAngl = gcon->SemiAngle();
}
// changes due to the fact the parameters of the chamfer must go increasing
// from surface S1 to surface S2
if ( (dedans && !plandab) || (!dedans && plandab) ) {
- gcon->VReverse();// be carefull : the SemiAngle was changed
+ gcon->VReverse();// be careful : the SemiAngle was changed
ConAx3 = gcon->Position();
SemiAngl = gcon->SemiAngle();
}
// changes due to the fact the parameters of the chamfer must go increasing
// from surface S1 to surface S2
if ( (dedans && !plandab) || (!dedans && plandab) ) {
- gcon->VReverse();// be carefull : the SemiAngle was changed
+ gcon->VReverse();// be careful : the SemiAngle was changed
ChamfAx3 = gcon->Position();
SemiAngl = gcon->SemiAngle();
}
// changes due to the fact the parameters of the chamfer must go increasing
// from surface S1 to surface S2
if ( (dedans && !plandab) || (!dedans && plandab) ) {
- gcon->VReverse();// be carefull : the SemiAngle was changed
+ gcon->VReverse();// be careful : the SemiAngle was changed
ConAx3 = gcon->Position();
SemiAngl = gcon->SemiAngle();
}
Contap_Point& thevtx = Line.Vertex(i);
if (Abs(thevtx.ParameterOnLine()-paramp) <= toler) {
thevtx.SetInternal();
- ok = Standard_False; // on a correspondance
+ ok = Standard_False; // on a correspondence
}
}
if (ok) { // il faut alors rajouter le point
//! Definition of a vertex on the contour line.
//! Most of the time, such a point is an intersection
//! between the contour and a restriction of the surface.
-//! When it is not tyhe method IsOnArc return False.
+//! When it is not the method IsOnArc return False.
//! Such a point is contains geometrical information (see
//! the Value method) and logical information.
class Contap_Point
// U + V
// 2 2
// such that the derivative at the domain bounds of U + V is 0.0e0
-// with is helpfull when having to make a C1 BSpline by merging two
-// BSpline toghether
+// with is helpful when having to make a C1 BSpline by merging two BSpline together
//=======================================================================
void CosAndSinRationalC1(Standard_Real Parameter,
if (alpha_2 < 1.0e-7)
{
// Fixed degenerate case, when obtain 0 / 0 uncertainty.
- // According to Taylor aprroximation:
+ // According to Taylor approximation:
// b (gamma) = -6.0 / 15.0 + o(gamma^2)
p_param = -6.0 / 15.0;
}
//! framework for storing and consulting this computed data.
//! This data may then be used to construct a
//! Geom_BSplineSurface surface, for example.
-//! All those classes define algorithmes to convert an
+//! All those classes define algorithms to convert an
//! ElementarySurface into a B-spline surface.
//! This abstract class implements the methods to get
//! the geometric representation of the B-spline surface.
//! This values defined the parametric domain of the Polynomial Equation.
//!
//! Coefficients :
- //! The <Coefficients> have to be formated than an "C array"
+ //! The <Coefficients> have to be formatted than an "C array"
//! [MaxUDegree+1] [MaxVDegree+1] [3]
Standard_EXPORT Convert_GridPolynomialToPoles(const Standard_Integer MaxUDegree, const Standard_Integer MaxVDegree, const Handle(TColStd_HArray1OfInteger)& NumCoeff, const Handle(TColStd_HArray1OfReal)& Coefficients, const Handle(TColStd_HArray1OfReal)& PolynomialUIntervals, const Handle(TColStd_HArray1OfReal)& PolynomialVIntervals);
//! this is the true parameterisation for the composite surface
//!
//! Coefficients :
- //! The Coefficients have to be formated than an "C array"
+ //! The Coefficients have to be formatted than an "C array"
//! [NbVSurfaces] [NBUSurfaces] [MaxUDegree+1] [MaxVDegree+1] [3]
//! raises DomainError if <NumCoeffPerSurface> is not a
//! [1, NbVSurfaces*NbUSurfaces, 1,2] array.
projects / occt.git / commitdiff