Open CASCADE Technology
7.3.0
|
This class intended to build knots sequence on discrete set of points for further approximation into bspline curve. More...
#include <ApproxInt_KnotTools.hxx>
Static Public Member Functions | |
static void | BuildKnots (const TColgp_Array1OfPnt &thePntsXYZ, const TColgp_Array1OfPnt2d &thePntsU1V1, const TColgp_Array1OfPnt2d &thePntsU2V2, const math_Vector &thePars, const Standard_Boolean theApproxXYZ, const Standard_Boolean theApproxU1V1, const Standard_Boolean theApproxU2V2, const Standard_Integer theMinNbPnts, NCollection_Vector< Standard_Integer > &theKnots) |
Main function to build optimal knot sequence. At least one set from (thePntsXYZ, thePntsU1V1, thePntsU2V2) should exist. More... | |
This class intended to build knots sequence on discrete set of points for further approximation into bspline curve.
Short description of algorithm: 1) Build discrete curvature on points set. 2) According to special rules build draft knots sequence. 3) Filter draft sequence to build output sequence.
For more details look at: Anshuman Razdan - Knot Placement for B-Spline curve Approximation.
|
static |
Main function to build optimal knot sequence. At least one set from (thePntsXYZ, thePntsU1V1, thePntsU2V2) should exist.
thePntsXYZ | - Set of 3d points. |
thePntsU1V1 | - Set of 2d points. |
thePntsU2V2 | - Set of 2d points. |
thePars | - Expected parameters assoiated with set. |
theApproxXYZ | - Flag, existence of 3d set. |
theApproxU1V1 | - Flag existence of first 2d set. |
theApproxU2V2 | - Flag existence of second 2d set. |
theMinNbPnts | - Minimal number of points per knot interval. |
theKnots | - output knots sequence. |