10182

# Subdivision Algorithm for Bézier Curves

This Demonstration illustrates the convergence of the de Casteljau-based subdivision algorithm for Bézier curves.

### DETAILS

The subdivision algorithm follows from the de Casteljau algorithm that calculates a current point , for , of a polynomial Bézier curve , for , where are the control points, by applying the following recurrence formula:
for
for .
For any value of between and , we have
.
The subdivision algorithm associates to the polygon the two polygons and . They constitute the control polygons of the two parts of the curve , respectively for in and :
and
.
When , varies over and varies over .
This Demonstration illustrates repeated application of the above procedure (the control "k" denotes the number of iterations). Obviously, the resulting polygon sequence converges very quickly to the curve .

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.