Skip to Main content Skip to Navigation
New interface
Journal articles

Computing the minimum distance between two Bézier curves

Xiao-Diao Chen 1 Linqiang Chen 2 Yigang Wang 2 Gang Xu 2 Jun-Hai Yong 1, 3 Jean-Claude Paul 3, 1 
3 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : A sweeping sphere clipping method is presented for computing the minimum distance between two Bézier curves. The sweeping sphere is constructed by rolling a sphere with its center point along a curve. The initial radius of the sweeping sphere can be set as the minimum distance between an end point and the other curve. The nearest point on a curve must be contained in the sweeping sphere along the other curve, and all of the parts outside the sweeping sphere can be eliminated. A simple sufficient condition when the nearest point is one of the two end points of a curve is provided, which turns the curve/curve case into a point/curve case and leads to higher efficiency. Examples are shown to illustrate efficiency and robustness of the new method.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Thss Tsinghua Connect in order to contact the contributor
Submitted on : Friday, September 17, 2010 - 9:13:03 AM
Last modification on : Friday, February 4, 2022 - 3:12:52 AM
Long-term archiving on: : Saturday, December 18, 2010 - 2:54:53 AM


Files produced by the author(s)




Xiao-Diao Chen, Linqiang Chen, Yigang Wang, Gang Xu, Jun-Hai Yong, et al.. Computing the minimum distance between two Bézier curves. Journal of Computational and Applied Mathematics, 2009, 229 (1), pp.194-301. ⟨10.1016/⟩. ⟨inria-00518351⟩



Record views


Files downloads