Computing the minimum distance between a point and a NURBS curve

被引：49

作者：

Chen, Xiao-Diao

Yong, Jun-Hai ^{[2
]}

Wang, Guozhao ^{[3
,4
]}

Paul, Jean-Claude ^{[2
,5
]}

Xu, Gang ^{[1
,3
,4
]}

机构：

[1] Hangzhou Dianzi Univ, Coll Comp, Inst Graph & Image, Hangzhou 310018, Peoples R China

[2] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China

[3] Zhejiang Univ, Inst Comp Graph & Image Proc, Hangzhou 310027, Peoples R China

[4] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China

[5] INRIA, Sophia Antipolis, France

来源：

COMPUTER-AIDED DESIGN | 2008年 / 40卷 / 10-11期

基金：

美国国家科学基金会;

关键词：

Point projection; NURBS curve; Subdivision; Root isolation; Newton's method;

D O I：

10.1016/j.cad.2008.06.008

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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. (c) 2008 Elsevier Ltd. All rights reserved.

引用

页码：1051 / 1054

页数：4

共 24 条

[1] A METHOD FOR REGISTRATION OF 3-D SHAPES [J].