Accessibility navigation

Finding the point on Bezier Curves with the normal vector passing an external point

Hong, X. ORCID: and Harwin, W.S. ORCID: (2006) Finding the point on Bezier Curves with the normal vector passing an external point. International Journal of Modelling Identification and Control, 1 (4).

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1504/IJMIC.2006.012620


Two algorithms for finding the point on non-rational/rational Bezier curves of which the normal vector passes through a given external point are presented. The algorithms are based on Bezier curves generation algorithms of de Casteljau's algorithm for non-rational Bezier curve or Farin's recursion for rational Bezier curve, respectively. Orthogonal projections from the external point are used to guide the directional search used in the proposed iterative algorithms. Using Lyapunov's method, it is shown that each algorithm is able to converge to a local minimum for each case of non-rational/rational Bezier curves. It is also shown that on convergence the distance between the point on curves to the external point reaches a local minimum for both approaches. Illustrative examples are included to demonstrate the effectiveness of the proposed approaches.

Item Type:Article
Divisions:Life Sciences > School of Biological Sciences > Department of Bio-Engineering
Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:15283
Uncontrolled Keywords:Keywords: Bezier curves; de Casteljau algorithm; derivatives; haptics; Lyapunov method; normal vector; Farin recursion; haptic rendering.

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation