Questions tagged [de-casteljau]

De Casteljau's algorithm is a recursive method to evaluate polynomials in Bernstein form or Bézier curves, named after its inventor Paul de Casteljau. De Casteljau's algorithm can also be used to split a single Bézier curve into two Bézier curves at an arbitrary parameter value.

More information here : De Casteljau's algorithm

4 questions
1
vote
0 answers

Threading Decasteljau algorithm in golang

I'm trying to write a threaded Decasteljau algorithm for control polygons with any set of points in golang but can't get the goroutines to work right because their work randomly and i can't manage to get all the goroutines to work . here's my code…
Tawfik
  • 59
  • 5
1
vote
1 answer

How many stacks are required to implement the iterative version of De Casteljau's algorithm?

I guess only 1 stack wouldn't be enough, because the following logic doesn't look very viable to me: De-Casteljau's-algorithm
user366312
  • 16,949
  • 65
  • 235
  • 452
0
votes
0 answers

How to choose control points to draw Bezier curve more smoothly?

Given a series of points' coordinates, I used an algorithm in the below link to add control points to draw Bezier curve. current_algorithm But you can load the below html code in the browser and see that the outcome is not so good. It is not very…
jena_kk
  • 1
  • 2
0
votes
1 answer

How do I specify the specific the control points in a De Casteljau algorithm, if I am using nested for loops to iterate?

I know using De Casteljau's algorithm is not the best way to draw a Bezier curve, but I need to implement it for an assignment I am defining my algorithm based on the following equations (from Drexel). Where: defines the control points. I am…
cl40
  • 11
  • 5