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...
|
| TypeName ("bezier") |
|
| bezier (const pointField &points, const edge &fromTo, const pointField &control) |
|
| bezier (const pointField &points, const label from, const label to, const pointField &control) |
|
| bezier (const dictionary &dict, const label index, const searchableSurfaces &, const pointField &points, Istream &is) |
|
virtual | ~bezier ()=default |
|
point | position (const scalar lambda) const |
|
scalar | length () const |
|
| TypeName ("blockEdge") |
|
| 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 edge &fromTo) |
|
| blockEdge (const dictionary &dict, const label index, const pointField &points, Istream &is) |
|
virtual autoPtr< blockEdge > | clone () const |
|
virtual | ~blockEdge ()=default |
|
bool | valid () const noexcept |
|
label | start () const noexcept |
|
label | end () const noexcept |
|
const point & | firstPoint () const |
|
const point & | lastPoint () const |
|
int | compare (const blockEdge &e) const |
|
int | compare (const edge &e) const |
|
int | compare (const label start, const label end) const |
|
point | linearPosition (const scalar lambda) const |
|
virtual tmp< pointField > | position (const scalarList &lambdas) const |
|
void | write (Ostream &os, const dictionary &dict) const |
|
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 57 of file bezier.H.