<p>Subdivision can be used for curves in 2D just as easily as for surfaces in 3D. Usually the subdivision algorithms applied to 2D are called subdivision curves. Subdivision curves do not suffer from the problem that subdivision surfaces have around extraordinary points and therefore all subdivision surfaces can easily be converted to (uniform) B-splines. This means that it equals to working with Bézier curves in most cases. This latter representation might be more advantageous as it possesses a closed form representation, such that curves can be evaluated easily at arbitrary parameter values.</p>

<p>A simple subdivision algorithm for curves is the following. Consider a polyline consisting out of <span class="math-container">$n$</span> points <span class="math-container">$P_0 \ldots P_{n-1}$</span>. Than for every iteration do the following steps:</p>

<p>Every exisiting position <span class="math-container">$P_i =&gt; (P_{i-1} + 6 P_{i} + P_{i+1})/8$</span> then add new positions on every edge between existing points using <span class="math-container">$(4 P_i + 4 P_{i+1})/8$</span> and repeat. In the limit this procedure will converge to uniform cubic B-splines.</p>

<p>Some useful extensions for subdivison curves exists such as <a href="https://www.rug.nl/research/portal/files/50538260/Creases_and_boundary_conditions.pdf" rel="nofollow noreferrer">(semi-sharp) creases and boundary conditions</a> </p>

CC BY-SA 4.0
2019-01-18T16:45:04.917Z
2019-01-21T13:43:30.953Z
2019-01-21T13:43:30.953Z
Reynolds
<p>I've seen how subdivision surfaces are good for 3D curves/modeling, but haven't seen anything on if it's good, or even usable, in 2D.</p>

<p>My question is just that, if (a) you can even use subdivision surfaces in 2D, and (b) if you can use it for 2D, if it's a good solution for modeling curves in 2D, or if not, what a good solution for modeling curves in 2D might be (if it's just bezier curves, or ideally something better / more powerful).</p>

<p><a href="https://www.cl.cam.ac.uk/teaching/1617/AdvGraph/6.%20Subdivision%20surfaces.pdf" rel="nofollow noreferrer">Here</a> it suggests subdivision surfaces could be used in 2D, but not sure if they would be considered good for it.</p>

<p><a href="https://i.sstatic.net/CpFQz.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/CpFQz.png" alt="enter image description here"></a></p>

<3d><2d><curve><subdivision>
If you can use subdivision surfaces for 2D curves
Lance Pollard
# If you can use subdivision surfaces for 2D curves

(Asked by: username_0 on 2019-01-18)

I've seen how subdivision surfaces are good for 3D curves/modeling, but haven't seen anything on if it's good, or even usable, in 2D.

My question is just that, if (a) you can even use subdivision surfaces in 2D, and (b) if you can use it for 2D, if it's a good solution for modeling curves in 2D, or if not, what a good solution for modeling curves in 2D might be (if it's just bezier curves, or ideally something better / more powerful).

[Here](https://www.cl.cam.ac.uk/teaching/1617/AdvGraph/6.%20Subdivision%20surfaces.pdf) it suggests subdivision surfaces could be used in 2D, but not sure if they would be considered good for it.

[![enter image description here](https://i.sstatic.net/CpFQz.png)](https://i.sstatic.net/CpFQz.png)

**Tags:** 3d, 2d, curve, subdivision


---

## 1 answers

### Answer by username_1 on 2019-01-18. Score: 4 | Accepted answer

Subdivision can be used for curves in 2D just as easily as for surfaces in 3D. Usually the subdivision algorithms applied to 2D are called subdivision curves. Subdivision curves do not suffer from the problem that subdivision surfaces have around extraordinary points and therefore all subdivision surfaces can easily be converted to (uniform) B-splines. This means that it equals to working with Bézier curves in most cases. This latter representation might be more advantageous as it possesses a closed form representation, such that curves can be evaluated easily at arbitrary parameter values.

A simple subdivision algorithm for curves is the following. Consider a polyline consisting out of $n$ points $P\_0 \ldots P\_{n-1}$. Than for every iteration do the following steps:

Every exisiting position $P\_i => (P\_{i-1} + 6 P\_{i} + P\_{i+1})/8$ then add new positions on every edge between existing points using $(4 P\_i + 4 P\_{i+1})/8$ and repeat. In the limit this procedure will converge to uniform cubic B-splines.

Some useful extensions for subdivison curves exists such as [(semi-sharp) creases and boundary conditions](https://www.rug.nl/research/portal/files/50538260/Creases_and_boundary_conditions.pdf)


---

