TP9 submission deadline is Thursday, 13/04/2017 at 23:59. The TP on Friday 14/04 will start at 13:30 (instead of 15:15).

TP4 : Subdivision curves

3 March 2017 in

Code

Subdivision Curves

A subdivision curve is defined as the limit of recursive refinement of the input polyline $\mathbf x_i = \mathbf x_i^0$. Your today’s task is to implement three curve subdivision schemes from the lecture. For the sake of simplicity, we’ll be working with closed curves only.

Generally, one iteration of curve subdivision has the following form:

  1. Topological step: curve is upsampled by inserting a new vertex between each two adjacent vertices. This doubles the number of vertices: if there were $n$ vertices, now there is $2n$ of them.
  2. Geometric step: new positions are computed for all vertices.


subdivision-animation

There are two kinds of schemes: approximating schemes change the positions of old vertices, while the interpolating schemes don’t.

Chaikin’s scheme

Introduced in 1974 by George Chaikin, this algorithm revolutionized the world of numerical geometry. Limit curve is a uniform quadratic B-spline.

chaikin-scheme

Corner-cutting

Generalization of Chaikin’s algorithm with two parameters $ 0 < a < b < 1 $.

Setting $a=0.25, b=0.75$ gives Chaikin. The following example uses $a = 0.1, b = 0.6$:

4-point

Four-point

Unlike corner cutting, the four-point scheme is interpolatory.

4-point

ToDo

  1. Implement the three subdivision schemes.
  2. Experiment with different values of $a,b$ in corner cutting. Specifically, try using
    • $b=a+\frac12$
    • $b \neq a+\frac12$

    What do you observe?

  3. Generalized four-point uses the mask $[-\omega,\frac12+\omega,\frac12+\omega,-\omega].$
    ($\omega=\frac1{16}$ in the original scheme.) Modify your implementation of this algorithm to account for the tension parameter $\omega$ and try varying its value. You should get $\mathcal C^1$ limit curves for $\omega \in \left[0,(\sqrt 5 - 1)/8 \approx 0.154 \right]$.

Resources