B-spline curve fitting based on adaptive curve refinement using dominant points

被引:210
作者
Park, Hyungjun
Lee, Joo-Haeng
机构
[1] Chosun Univ, Dept Ind Engn, Kwangju 501759, South Korea
[2] Elect & Telecommun Res Inst, Digital Actor Team, Taejon 305350, South Korea
关键词
B-spline curve fitting; knot placement; dominant point selection; adaptive curve refinement; local modification;
D O I
10.1016/j.cad.2006.12.006
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we present a new approach of B-spline curve fitting to a set of ordered points, which is motivated by an insight that properly selected points called dominant points can play an important role in producing better curve approximation. The proposed approach takes four main steps: parameterization, dominant point selection, knot placement, and least-squares minimization. The approach is substantially different from the conventional approaches in knot placement and dominant point selection. In the knot placement, the knots are determined by averaging the parameter values of the dominant points, which basically transforms B-spline curve fitting into the problem of dominant point selection. We describe the properties of the knot placement including the property of local modification useful for adaptive curve retinement. We also present an algorithm for dominant point selection based on the adaptive refinement paradigm. The approach adaptively refines a B-spline curve by selecting fewer dominant points at flat regions but more at complex regions. For the same number of control points, the proposed approach can generate a B-spline curve with less deviation than the conventional approaches. When adopted in error-bounded curve approximation, it can generate a B-spline curve with far fewer control points while satisfying the desired shape fidelity. Some experimental results demonstrate its usefulness and quality. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:439 / 451
页数:13
相关论文
共 26 条
[1]  
Boehm W, 1993, NUMERICAL METHODS
[2]  
CELNIKER G, 1991, COMP GRAPH, V25, P257, DOI 10.1145/127719.122746
[3]  
Cook W., 1998, Combinatorial Optimization
[4]  
De Boor C., 1978, PRACTICAL GUIDE SPLI, DOI DOI 10.1007/978-1-4612-6333-3
[5]   MULTIDIMENSIONAL CURVE-FITTING TO UNORGANIZED DATA POINTS BY NONLINEAR MINIMIZATION [J].
FANG, L ;
GOSSARD, DC .
COMPUTER-AIDED DESIGN, 1995, 27 (01) :48-58
[6]   Spline curve approximation and design by optimal control over the knots [J].
Goldenthal, R ;
Bercovier, M .
COMPUTING, 2004, 72 (1-2) :53-64
[7]   DATA POINT SELECTION FOR PIECEWISE-LINEAR CURVE APPROXIMATION [J].
HAMANN, B ;
CHEN, JL .
COMPUTER AIDED GEOMETRIC DESIGN, 1994, 11 (03) :289-301
[8]   INTRINSIC PARAMETERIZATION FOR APPROXIMATION. [J].
Hoschek, J. .
Computer Aided Geometric Design, 1988, 5 (01) :27-31
[9]  
Hoschek J., 1993, Fundamentals of computer aided geometric design
[10]   OPTIMIZATION OF A NURBS REPRESENTATION [J].
LAURENTGENGOUX, P ;
MEKHILEF, M .
COMPUTER-AIDED DESIGN, 1993, 25 (11) :699-710