American Journal of Computer Science and Engineering Survey Open Access
ISSN: 2349-7238
Journal h-index: 9
Journal CiteScore: 1.72
Journal Impact Factor: 1.11
Average acceptance to publication time (5-7 days)
Average article processing time (30-45 days)
Less than 5 volumes 30 days
8 - 9 volumes 40 days
10 and more volumes 45 days
Abstract
An Algorithm for Computing the Shortest Distance between a Point and Quadratic Bezier Curve
Nouri Ahmad Suleiman
The problem of data fitting using Bezier curve is one of the most important problems in the modern science, during this process, the problem of determining the shortest distance between a point and Bezier curve arises, so when we use a second degree Bezier curve for fitting data points, the problem will be changed into solving third degree polynomial, but when we use third degree Bezier curve, the problem is changed into finding roots of polynomial too, but in this case the polynomial is fifth degree, in this paper we will discuss the minimum distance between a point and a Bezier curve with three control points, i.e. quadratic Bezier curve.
