Skip to Main content Skip to Navigation
Journal articles

Computing the minimum distance between a point and a NURBS curve

Xiao-Diao Chen 1, 2 Jun-Hai Yong 3 Guozhao Wang 4, 5 Jean-Claude Paul 2, 3 Gang Xu 1, 4, 5
2 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : A new method is presented for computing the minimum distance between a point and a NURBS curve. It utilizes a circular clipping technique to eliminate the curve parts outside a circle with the test point as its center point. The radius of the elimination circle becomes smaller and smaller during the subdivision process. A simple condition for terminating the subdivision process is provided, which leads to very few subdivision steps in the new method. Examples are shown to illustrate the efficiency and robustness of the new method.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00518359
Contributor : Thss Tsinghua <>
Submitted on : Friday, September 17, 2010 - 9:42:57 AM
Last modification on : Tuesday, June 1, 2021 - 2:34:07 PM
Long-term archiving on: : Saturday, December 18, 2010 - 2:55:59 AM

File

Xiao-DiaoChen2008b.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Xiao-Diao Chen, Jun-Hai Yong, Guozhao Wang, Jean-Claude Paul, Gang Xu. Computing the minimum distance between a point and a NURBS curve. Computer-Aided Design, Elsevier, 2008, 40 (10-11), pp.1051-1054. ⟨10.1016/j.cad.2008.06.008⟩. ⟨inria-00518359⟩

Share

Metrics

Record views

531

Files downloads

3405