CODEWITHSUNDEEP
c++algorithmhaskellbezierspline
eigen_enthused
eigen_enthused

Reputation: 535

Spline fitting - Douglas-Peucker algorithm

I am planning on using the Douglas-Peucker algorithm for point reduction (unless someone knows of a better example). The data is 1D and the curve being constructed is 2D

Give a reduced hull of points I need a spline that will travel through all the points (I think Lagrange interpolation does this)

The main objective is to solve the tangent handles on something like a hermite curve so that the spline matches the original data curve as closely as possible.

Does anyone know of a an approach to this kind of problem?

Upvotes: 0

Views: 1094

Answers (1)

Mike 'Pomax' Kamermans
Mike 'Pomax' Kamermans

Reputation: 53607

Did you solve this? A spline that travels through your points is easily constructed as a Catmull-Rom spline (which map to Bezier curves, but represent the interpolation differently).

Upvotes: 1

Related Questions