Click here to Skip to main content
Click here to Skip to main content

Draw a Smooth Curve through a Set of 2D Points with Bezier Primitives

, , 24 Mar 2009 CPOL
Rate this:
Please Sign up or sign in to vote.
Calculate piecewise Bezier curve control points to make it a spline

Introduction

From time to time, I am faced with the question: how to draw a smooth curve through a set of 2D points? It seems strange, but we don't have out of the box primitives to do so. Yes, we can draw a polyline, Bezier polyline, or a piece-wise cardinal spline, but they are all not what is desired: polyline isn't smooth; with Bezier and cardinal spline, we have a headache with additional parameters like Bezier control points or tension. Very often, we don't have any data to evaluate these additional parameters. And, very often, all we need is to draw the curve which passes through the points given and is smooth enough. Let's try to find a solution.

We have interpolation methods at hand. The cubic spline variations, for example, give satisfactory results in most cases. We could use it and draw the result of the interpolation, but there are some nasty drawbacks:

  1. Cubic spline is a cubic polynomial, but Win32, .NET Forms, or WPF do not provide methods to draw a piecewise cubic polynomial curve. So, to draw that spline, we have to invent an effective algorithm to approximate a cubic polynomial with polyline, which isn't trivial (word “effective” is a point!).
  2. Cubic spline algorithms are usually designed to deal with functions in the Cartesian coordinates, y=f(x). This implies that the function is single valued; it isn't always appropriate.

On the other hand, the platform provides us with a suite of Bezier curve drawing methods. Bezier curve is a special representation of a cubic polynomial expressed in the parametric form (so it isn't the subject of single valued function restriction). Bezier curves start and end with two points often named “knots”; the form of the curve is controlled by two more points known as “control points”.

Bezier spline is a sequence of individual Bezier curves joined to form a whole curve. The trick to making it a spline is to calculate control points in such a way that the whole spline curve has two continuous derivatives.

I spent some time Googling for a code in any C-like language for a Bezier spline, but couldn't found any cool, ready-to-use code.

Here, we'll deal with open-ended curves, but the same approach could be applied to the closed curves.

Bezier Curve Representation

A Bezier curve on a single interval is expressed as:

B(t)=(1-t)<sup>3</sup>P<sub>0</sub>+3(1-t)<sup>2</sup>tP<sub>1</sub>+3(1-t)t<sup>2</sup>P<sub>2</sub>+t<sup>3</sup>P<sub>3</sub> (1) 

where t is in [0,1], and

  1. P0 – first knot point
  2. P1 – first control point (close to P0)
  3. P2 – second control point (close to P3)
  4. P3 – second knot point

The first derivative of (1) is:

B’(t)=-3(1-t)<sup>2</sup>P<sub>0</sub>+3(3t<sup>2</sup>–4t+1)P<sub>1</sub>+3(2t–3t<sup>2</sup>)P<sub>2</sub>+3t<sup>2</sup>P<sub>3</sub> 

The second derivative of (1) is:

B’’(t)=6(1 - t)P<sub>0</sub>+3(6t-4)P<sub>1</sub>+3(2–6t)P<sub>2</sub>+6tP<sub>3</sub> 

Single Segment

If we have just two knot points, our "smooth" Bezier curve should be a straight line, i.e. in (1) the coefficients in the members with the power 2 and 3 should be zero. It's easy to deduce that its control points should be calculated as:

3P<sub>1</sub> = 2P<sub>0</sub> + P<sub>3</sub> P<sub>2</sub> = 2P<sub>1</sub> – P<sub>0</sub> 

Multiple Segments

This is the case where we have more than two points. One more time: to make a sequence of individual Bezier curves to be a spline, we should calculate Bezier control points so that the spline curve has two continuous derivatives at knot points.

Considering a set of piecewise Bezier curves with n+1 points and n subintervals, the (i-1)-th curve should connect to the i-th one. Now we will denote the points as follows:

  1. Piith knot point (i=1,..,n)
  2. P1i – first control point close to Pi
  3. P2i – second control point close to Pi

At the ith subinterval, the Bezier curve will be:

B<sub>i</sub>(t)=(1-t)<sup>3</sup>P<sub>i-1</sub>+3(1-t)<sup>2</sup>tP1<sub>i</sub>+3(1-t)t<sup>2</sup>P2<sub>i</sub>+t<sup>3</sup>P<sub>i</sub>; (i=1,..,n) 

The first derivative at the ith subinterval is:

B’<sub>i</sub>(t)=-3(1-t)<sup>2</sup>P<sub>i-1</sub>+3(3t<sup>2</sup>-4t+1)P1<sub>i</sub>+3(2t-3t<sup>2</sup>)P2<sub>i</sub>+3t<sup>2</sup>P<sub>i</sub>; (i=1,..,n) 

The first derivative continuity condition B’i-1(1)=B’i(0) gives:

P1<sub>i</sub>+P2<sub>i-1</sub> = 2P<sub>i-1</sub>; (i=2,..,n) (2) 

The second derivative at the ith subinterval is:

B’’<sub>i</sub>(t)=6(1-t)P<sub>i-1</sub>+6(3t-2)P1<sub>i</sub>+6(1-3t)P2<sub>i</sub>+6tP<sub>i</sub>; (i=1,..,n) 

The second derivative continuity condition B’’i-1(1)=B’’i(0) gives:

P1<sub>i-1</sub>+2P1<sub>i</sub>=P2<sub>i</sub>+2P2<sub>i-1</sub>; (i=2,..,n) (3) 

Then, as always with splines, we'll add two more conditions at the ends of the total interval. These will be the “natural conditions” B’’1(0) = 0 and B’’n(1) = 0.

2P1<sub>1</sub>-P2<sub>1</sub> = P<sub>0</sub> (4) 2P2<sub>n</sub>-P1<sub>n</sub> = P<sub>n</sub> (5) 

Now, we have 2n conditions (2-5) for n control points P1 and n control points P2. Excluding P2, we'll have n equations for n control points P1:

2P1<sub>1</sub> + P1<sub>2</sub> = P<sub>0</sub> + 2P<sub>1</sub> P1<sub>1</sub> + 4P1<sub>2</sub> + P1<sub>3</sub> = 4P<sub>1</sub> + 2P<sub>2</sub> .... P1<sub>i-1</sub> + 4P1<sub>i</sub> + P1<sub>i+1</sub> = 
    4P<sub>i-1</sub> + 2P<sub>i</sub> (6) .... P1<sub>n-2</sub> + 4P1<sub>n-1</sub> + P1<sub>n</sub> = 4P<sub>n-2</sub> + 2P<sub>n-1</sub> 2P1<sub>n-1</sub> + 7P1<sub>n</sub> = 8P<sub>n-1</sub> + P<sub>n</sub> 

System (6) is the tridiagonal one with the diagonal dominance, hence we can solve it by simple variable elimination without any tricks.

When P1 is found, P2 could be calculated from (2) and (5).

The Code

/// <summary>
/// Bezier Spline methods
/// </summary>
public static class BezierSpline
{
	/// <summary>
	/// Get open-ended Bezier Spline Control Points.
	/// </summary>
	/// <param name="knots">Input Knot Bezier spline points.</param>
	/// <param name="firstControlPoints">Output First Control points
	/// array of knots.Length - 1 length.</param>
	/// <param name="secondControlPoints">Output Second Control points
	/// array of knots.Length - 1 length.</param>
	/// <exception cref="ArgumentNullException"><paramref name="knots"/>
	/// parameter must be not null.</exception>
	/// <exception cref="ArgumentException"><paramref name="knots"/>
	/// array must contain at least two points.</exception>
	public static void GetCurveControlPoints(Point[] knots,
		out Point[] firstControlPoints, out Point[] secondControlPoints)
	{
		if (knots == null)
			throw new ArgumentNullException("knots");
		int n = knots.Length - 1;
		if (n < 1)
			throw new ArgumentException
			("At least two knot points required", "knots");
		if (n == 1)
		{ // Special case: Bezier curve should be a straight line.
			firstControlPoints = new Point[1];
			// 3P1 = 2P0 + P3
			firstControlPoints[0].X = (2 * knots[0].X + knots[1].X) / 3;
			firstControlPoints[0].Y = (2 * knots[0].Y + knots[1].Y) / 3;

			secondControlPoints = new Point[1];
			// P2 = 2P1 – P0
			secondControlPoints[0].X = 2 *
				firstControlPoints[0].X - knots[0].X;
			secondControlPoints[0].Y = 2 *
				firstControlPoints[0].Y - knots[0].Y;
			return;
		}

		// Calculate first Bezier control points
		// Right hand side vector
		double[] rhs = new double[n];

		// Set right hand side X values
		for (int i = 1; i < n - 1; ++i)
			rhs[i] = 4 * knots[i].X + 2 * knots[i + 1].X;
		rhs[0] = knots[0].X + 2 * knots[1].X;
		rhs[n - 1] = (8 * knots[n - 1].X + knots[n].X) / 2.0;
		// Get first control points X-values
		double[] x = GetFirstControlPoints(rhs);

		// Set right hand side Y values
		for (int i = 1; i < n - 1; ++i)
			rhs[i] = 4 * knots[i].Y + 2 * knots[i + 1].Y;
		rhs[0] = knots[0].Y + 2 * knots[1].Y;
		rhs[n - 1] = (8 * knots[n - 1].Y + knots[n].Y) / 2.0;
		// Get first control points Y-values
		double[] y = GetFirstControlPoints(rhs);

		// Fill output arrays.
		firstControlPoints = new Point[n];
		secondControlPoints = new Point[n];
		for (int i = 0; i < n; ++i)
		{
			// First control point
			firstControlPoints[i] = new Point(x[i], y[i]);
			// Second control point
			if (i < n - 1)
				secondControlPoints[i] = new Point(2 * knots
					[i + 1].X - x[i + 1], 2 *
					knots[i + 1].Y - y[i + 1]);
			else
				secondControlPoints[i] = new Point((knots
					[n].X + x[n - 1]) / 2,
					(knots[n].Y + y[n - 1]) / 2);
		}
	}

	/// <summary>
	/// Solves a tridiagonal system for one of coordinates (x or y)
	/// of first Bezier control points.
	/// </summary>
	/// <param name="rhs">Right hand side vector.</param>
	/// <returns>Solution vector.</returns>
	private static double[] GetFirstControlPoints(double[] rhs)
	{
		int n = rhs.Length;
		double[] x = new double[n]; // Solution vector.
		double[] tmp = new double[n]; // Temp workspace.

		double b = 2.0;
		x[0] = rhs[0] / b;
		for (int i = 1; i < n; i++) // Decomposition and forward substitution.
		{
			tmp[i] = 1 / b;
			b = (i < n - 1 ? 4.0 : 3.5) - tmp[i];
			x[i] = (rhs[i] - x[i - 1]) / b;
		}
		for (int i = 1; i < n; i++)
			x[n - i - 1] -= tmp[n - i] * x[n - i]; // Backsubstitution.

		return x;
	}
}

Although I compiled this code in C# 3.0, I don’t see why it can’t be used without any modification in C# 2.0, and even in C# 1.0 if you remove the keyword “static” from the class declaration.

Note that the code uses the System.Windows.Point structure, so it is intended for use with Windows Presentation Foundation, and the using System.Windows; directive is required. But all you should do to use it with Windows Forms is to replace the System.Windows.Point type with System.Drawing.PointF. Equally, it is straightforward to convert this code to C/C++, if desired.

The Sample

The sample supplied with this article is a Visual Studio 2008 solution targeted at .NET 3.5. It contains a WPF Windows Application project designed to demonstrate some curves drawn with the Bezier spline above. You can select one of the curves from the combo box at the top of the window, experiment with the point counts, and set appropriate XY scales. You can even add your own curve, but this requires coding as follows:

  1. Add your curve name to the CurveNames enum.
  2. Add your curve implementation to the Curves region.
  3. Add a call to your curve in the OnRender override.

In the sample, I use Path elements on the custom Canvas to render the curve, but in a real application, you would probably use a more effective approach like visual layer rendering.

History

  • 18th December, 2008: Initial post
  • 23rd March, 2009: Second article revision with the following corrections and additions:
    1. The most important is the bug fix. This bug as well as its correction was found by Peter Lee. A lot of thanks to him! This bug produced visually distinguishable behavior in the case of small knot points count.
    2. GetCurveControlPoints now throw exceptions if invalid parameter is passed.
    3. Added special handling of the case where knots array has just two points
    4. Unit tests added.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Authors

Oleg V. Polikarpotchkin
Team Leader
Russian Federation Russian Federation
No Biography provided

Peter Lee

United States United States
No Biography provided

Comments and Discussions

 
SuggestionA brief clarification Pinmembera1jrj1-Dec-12 1:09 
QuestionI don't know how these formula can become to that codes....? PinmemberJeffrey639416-Oct-12 23:27 
QuestionCannot see equation PinmemberAlexandr.Pi21-Jun-12 3:34 
AnswerRe: Cannot see equation PinmemberPeter Lee22-Jun-12 21:09 
QuestionProblem with drawing Bezier spline Pinmemberyamelkaya14-Jun-12 22:43 
QuestionYour HTML is showing Pinmemberviaducting16-Mar-12 4:41 
Questionhow can i generate different number of Points from constant number of knots Pinmemberengkhaledd28-Feb-12 10:49 
GeneralMy vote of 5 PinmemberMember 820478518-Jan-12 3:35 
QuestionGreat Job! Pinmembercdrake19-Dec-11 7:59 
GeneralMy vote of 5 PinmemberBlazeCell1-Dec-11 16:59 
QuestionBlocks of lines appearing while drawing the curve. Pinmemberdeeptigp22-Oct-11 7:16 
GeneralMy vote of 5 PinmemberSusan Spencer11-Jun-11 8:34 
GeneralSmoth curves for signature PinmemberGauravKP21-Feb-11 1:24 
QuestionUse in graph sketching... Pinmemberxian12323-Oct-10 7:21 
Questiontridiagonal system Pinmembercalonix23-May-10 10:27 
GeneralMore than one control points Pinmemberdineshreddy.cs8-Mar-10 23:35 
GeneralCurl between 2 knots PinmemberJean-LucM30-Sep-09 5:09 
GeneralRe: Curl between 2 knots PinmemberOleg V. Polikarpotchkin1-Oct-09 19:41 
GeneralRe: Curl between 2 knots PinmemberJean-LucM2-Oct-09 5:43 
GeneralRe: Curl between 2 knots PinmemberOleg V. Polikarpotchkin2-Oct-09 18:40 
GeneralRe: Curl between 2 knots PinmemberJean-LucM3-Oct-09 2:34 
GeneralRe: Curl between 2 knots PinmemberOleg V. Polikarpotchkin3-Oct-09 19:10 
GeneralRe: Curl between 2 knots PinmemberJean-LucM6-Oct-09 5:59 
GeneralRe: Curl between 2 knots PinmemberOleg V. Polikarpotchkin7-Oct-09 20:06 
GeneralRe: Curl between 2 knots PinmemberOleg V. Polikarpotchkin7-Oct-09 20:24 
GeneralRe: Curl between 2 knots PinmemberJean-LucM16-Oct-09 3:53 
QuestionQuestion about the equation Pinmemberneo30816-Sep-09 12:29 
AnswerRe: Question about the equation PinmemberOleg V. Polikarpotchkin16-Sep-09 19:36 
GeneralRe: Question about the equation Pinmemberneo30818-Sep-09 3:34 
GeneralVisual layer rendering. Pinmembertinatran3022-Jul-09 16:28 
GeneralRe: Visual layer rendering. PinmemberOleg V. Polikarpotchkin22-Jul-09 17:47 
NewsI used this algorithm in a project very dear to me. PinmemberAkatz71221-Jul-09 15:51 
GeneralExcellent PinmvpLuc Pattyn25-Mar-09 0:58 
GeneralRe: Excellent PinmemberOleg V. Polikarpotchkin25-Mar-09 3:21 
NewsA mistake in the last equation which causes a strange behavior (corrected) PinmemberPeter Lee16-Mar-09 4:35 
GeneralRe: A mistake in the last equation which causes a strange behavior (corrected) PinmemberPeter Lee16-Mar-09 4:47 
GeneralRe: A mistake in the last equation which causes a strange behavior (corrected) PinmemberOleg V. Polikarpotchkin18-Mar-09 23:55 
GeneralRe: A mistake in the last equation which causes a strange behavior (corrected) Pinmembertwerd.ster12-Dec-09 7:51 
Questionalgorithm behavior Pinmemberbstrack9-Mar-09 13:45 
AnswerRe: algorithm behavior PinmemberOleg V. Polikarpotchkin9-Mar-09 18:36 
GeneralNeed Help on the closed curves Pinmemberwang200226-Feb-09 15:08 
GeneralRe: Need Help on the closed curves PinmemberOleg V. Polikarpotchkin27-Feb-09 17:14 
GeneralRe: Need Help on the closed curves PinmemberOleg V. Polikarpotchkin1-Mar-09 4:27 
GeneralGreat article PinmvpCedric Moonen18-Dec-08 8:12 
GeneralRe: Great article PinmemberOleg V. Polikarpotchkin18-Dec-08 16:58 
GeneralVariable Names PinmvpJohn Simmons / outlaw programmer18-Dec-08 1:11 
GeneralRe: Variable Names PinmemberOleg V. Polikarpotchkin18-Dec-08 16:39 
GeneralRe: Variable Names PinmemberHerbert Sauro22-Dec-08 11:03 
AnswerRe: Variable Names PinmemberOleg V. Polikarpotchkin22-Dec-08 16:15 
GeneralRe: Variable Names PinmemberCristian Bejenariu24-Mar-09 21:50 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Mobile
Web03 | 2.8.141015.1 | Last Updated 24 Mar 2009
Article Copyright 2008 by Oleg V. Polikarpotchkin, Peter Lee
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid