Skip to Main content Skip to Navigation
Conference papers

Improved Algebraic Algorithm On Point Projection For Bézier Curves

Xiao-Diao Chen 1, 2 Yin Zhou 1 Zhenyu Shu 1 Hua Su 3 Jean-Claude Paul 2, 3
2 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : This paper presents an improved algebraic pruning method for point projection for Bézier curves. It first turns the point projection into a root finding problem, and provides a simple but easily overlooked method to avoid finding invalid roots which is obviously irrelative to the closest point. The continued fraction method and its expansion are utilized to strengthen its robustness. Since NURBS curves can be easily turned into Bézier form, the new method also works with NURBS curves. Examples are presented to illustrate the efficiency and robustness of the new method.
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Thss Tsinghua <>
Submitted on : Friday, September 17, 2010 - 10:44:10 AM
Last modification on : Tuesday, June 1, 2021 - 2:34:07 PM
Long-term archiving on: : Saturday, December 18, 2010 - 2:58:55 AM


Files produced by the author(s)




Xiao-Diao Chen, Yin Zhou, Zhenyu Shu, Hua Su, Jean-Claude Paul. Improved Algebraic Algorithm On Point Projection For Bézier Curves. Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2007), The University of Iowa, Iowa City, Iowa, USA, Aug 2007, Iowa, United States. pp.158-163, ⟨10.1109/IMSCCS.2007.17⟩. ⟨inria-00518379⟩