bezier Class Reference

Nth order bezier curve edge. Only interior control points should be specified. The outer points are taken as start and end. Note that the calculation of each point takes 0(N^2) time, where N is the number of control points. This edge type shouldn't therefore be used for finely discretised line data; polyLine or similar will be more appropriate for such cases. Beziers are useful for simple curved shapes such as aerofoils, or when you want an edge to match a specific direction at one, or both, or its endpoints. In comparison with BSplines, the grading of bezier edges should be smoother, and the code is much simpler. The algorithmic order is worse, however, and the edge will not follow the control points as closely. More...

Inheritance diagram for bezier:
[legend]
Collaboration diagram for bezier:
[legend]

Public Member Functions

 TypeName ("bezier")
 
 bezier (const pointField &points, const label start, const label end, const pointField &control)
 Construct from components. More...
 
 bezier (const dictionary &dict, const label index, const searchableSurfaces &geometry, const pointField &, Istream &)
 Construct from Istream. More...
 
virtual ~bezier ()=default
 Destructor. More...
 
point position (const scalar lambda) const
 Return the point position corresponding to the curve parameter. More...
 
scalar length () const
 Return the length of the curve. More...
 
- Public Member Functions inherited from blockEdge
 TypeName ("blockEdge")
 Runtime type information. More...
 
 declareRunTimeSelectionTable (autoPtr, blockEdge, Istream,(const dictionary &dict, const label index, const searchableSurfaces &geometry, const pointField &points, Istream &is),(dict, index, geometry, points, is))
 
 blockEdge (const pointField &points, const label start, const label end)
 Construct from components. More...
 
 blockEdge (const dictionary &dict, const label index, const pointField &, Istream &)
 Construct from Istream setting pointsList. More...
 
virtual autoPtr< blockEdgeclone () const
 Clone function. More...
 
virtual ~blockEdge ()=default
 Destructor. More...
 
label start () const
 Return label of start point. More...
 
label end () const
 Return label of end point. More...
 
int compare (const blockEdge &) const
 Compare the given start and end points with this curve. More...
 
int compare (const edge &) const
 Compare the given start and end points with this curve. More...
 
int compare (const label start, const label end) const
 Compare the given start and end points with this curve. More...
 
virtual tmp< pointFieldposition (const scalarList &) const
 Return the point positions corresponding to the curve parameters. More...
 
void write (Ostream &, const dictionary &) const
 Write edge with variable backsubstitution. More...
 

Additional Inherited Members

- Static Public Member Functions inherited from blockEdge
static autoPtr< blockEdgeNew (const dictionary &dict, const label index, const searchableSurfaces &geometry, const pointField &, Istream &)
 New function which constructs and returns pointer to a blockEdge. More...
 
- Static Protected Member Functions inherited from blockEdge
static pointField appendEndPoints (const pointField &, const label start, const label end, const pointField &otherKnots)
 Return a complete point field by appending the start/end points. More...
 
- Protected Attributes inherited from blockEdge
const pointFieldpoints_
 
const label start_
 
const label end_
 

Detailed Description

Nth order bezier curve edge. Only interior control points should be specified. The outer points are taken as start and end. Note that the calculation of each point takes 0(N^2) time, where N is the number of control points. This edge type shouldn't therefore be used for finely discretised line data; polyLine or similar will be more appropriate for such cases. Beziers are useful for simple curved shapes such as aerofoils, or when you want an edge to match a specific direction at one, or both, or its endpoints. In comparison with BSplines, the grading of bezier edges should be smoother, and the code is much simpler. The algorithmic order is worse, however, and the edge will not follow the control points as closely.

Source files

Definition at line 61 of file bezier.H.

Constructor & Destructor Documentation

◆ bezier() [1/2]

bezier ( const pointField points,
const label  start,
const label  end,
const pointField control 
)

Construct from components.

Definition at line 47 of file bezier.C.

◆ bezier() [2/2]

bezier ( const dictionary dict,
const label  index,
const searchableSurfaces geometry,
const pointField points,
Istream is 
)

Construct from Istream.

Definition at line 60 of file bezier.C.

◆ ~bezier()

virtual ~bezier ( )
virtualdefault

Destructor.

Member Function Documentation

◆ TypeName()

TypeName ( "bezier"  )

◆ position()

Foam::point position ( const scalar  lambda) const
virtual

Return the point position corresponding to the curve parameter.

0 <= lambda <= 1

Implements blockEdge.

Definition at line 75 of file bezier.C.

References forAll, and lambda().

Here is the call graph for this function:

◆ length()

Foam::scalar length ( ) const
virtual

Return the length of the curve.

Implements blockEdge.

Definition at line 94 of file bezier.C.

References NotImplemented.


The documentation for this class was generated from the following files: