2016
DOI: 10.15414/meraa.2016.02.01.01-07
|View full text |Cite
|
Sign up to set email alerts
|

Derivations of the Bezier curve

Abstract: On selected polygon of control points we create Bézier curve. This we differentiate using a direct derivation of the polygon and receive hodograph of a new Bézier curve. The process is repeated for the second derivation, and these results are compared with numerical derivation of the parametric specified curve.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…Due to thick generated edges having uncertainty values, the thinning process is required by implementing skeletonization [43], applying a fast parallel algorithm using two sub-iterations deleting systems, as shown in Figure 3. In solving the gap caused by an unknown area, 3 points of Bezier [44] are defined to maintain the curve position fully, as shown in Figure 4. We adopt De Castelijau's algorithm [45] in building the 3-point Bezier curve (red curve) of B 1 (x, y), B 2 (x, y), B 3 (x, y) :…”
Section: A Cohesive Laplacian Fusionmentioning
confidence: 99%
“…Due to thick generated edges having uncertainty values, the thinning process is required by implementing skeletonization [43], applying a fast parallel algorithm using two sub-iterations deleting systems, as shown in Figure 3. In solving the gap caused by an unknown area, 3 points of Bezier [44] are defined to maintain the curve position fully, as shown in Figure 4. We adopt De Castelijau's algorithm [45] in building the 3-point Bezier curve (red curve) of B 1 (x, y), B 2 (x, y), B 3 (x, y) :…”
Section: A Cohesive Laplacian Fusionmentioning
confidence: 99%