Contour Smoothing Algorithm Based on Bezier Curves and Application

In the process of plotting contours by rectangular grids, many polylines appeared in the contour map. To improve it, this paper uses cubic Bezier curves to fit contours. First, scan all the known points and divide them into groups of 4. Then, draw cubic Bezier curves in groups. But cuspidal points turn up. And to avoid cuspidal points, de Casteljau Algorithm has been used. Add a new point at the middle position of the third and the fourth point in the previous group. Add another point at the middle position of the first and the second point in the next group. So there are three points between adjacent cubic Bezier curves. Plot another curve following the idea of de Casteljau Algorithm during these three points. Experiments show a combination of these two methods brings pretty good result.