Abstract
A information-algorithmic method of spline interpolation of plane curved lines defined by a set of reference points (scattered data) is proposed. The method gives both smooth curves and curves with fractures. To obtain fractures, the reference points are supplemented with new reference points that affect the directions of the tangents to the curve portion. The coordinates of the additional reference points are from the condition of passing the curve sections through the intermediate reference points. A list information structure has been created to store the coordinates of the reference points. The logic of the algorithm working with it is described. The algorithm always bypasses the list by the same law, regardless of the presence or absence of fractures. The method differs from interpolation by Catmull-Rom splines in the possibility of obtaining fractures at the reference points. The difference from Bezier spline interpolation is that the method does not require tangents to the segments in the case of their smooth conjugation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have