Abstract
A method to compute curvature minima and maxima of parametric curves (represented in NURBS format) is presented in this paper. Since the curvature changes vary rapidly along the path of (even smooth) curves, a biarc filter is employed to approximate the curvature function with a piecewise constant function. This allows the isolation of curvature extreme values that are found within-engineering tolerances via repeated biarc approximation followed by golden section search. Because the derivative of the curvature is numerically very unstable, only optimization without derivatives is feasible. However, given the excellent isolation property of biarc filters, curvature extremes are found within 10–20 steps even for high accuracy requirements ranging from 10−4 to 10−6.
Similar content being viewed by others
References
Ahn YJ, Kim HO, Lee KY (1998) Arc spline approximation of quadratic Bezier curves. Comput Aided Des 30:615–620
Bolton K (1975) Biarc curves. Comput Aided Des 7:89–92
Chuang SHF, Kao CZ (1999) One-sided arc approximation of B-spline curves for interference-free offsetting. Comput Aided Des 31:111–118
Dannenberg L, Nowacki H (1985) Approximate conversion of surface representations with polynomial bases. Comput Aided Geometric Des 2:123–131
Degen WLF (1992) Best approximation of parametric curves by splines. In: Lyche T, Schumaker LL (eds) Mathematical methods in CAGD II. Academic Press, New York, NY, pp 171–184
Do Carmo M (1976) Differential geometry of curves and surfaces. Prentice Hall, NJ
Dokken T, Lyche T (1994) Spline conversion: existing solutions and open problems. In: Laurent P-J, Le Mehaute A, Schumaker LL (eds) Curves and surfaces in geometric design. A. K. Peters, Wellesley, pp 121–130
Drysdale RL, Rote G, Sturm A (2008) Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comput Geometry 41:31–47
Eck M (1993) Degree reduction of Bezier curves. Comput Aided Geometric Des 10:237–251
Eck M, Hadenfeld J (1994) A stepwise algorithm for converting B-splines. In: Laurent P-J, Le Mehaute A, Schumaker LL (eds) Curves and surfaces in geometric design. A. K. Peters, Wellesley, pp 131–138
Farouki RT, Neff CA (1991) Analytic properties of plane offset curves. Comput Aided Geometric Des 7:83–99
Filip D, Magedson R, Markot R (1986) Surface algorithms using bounds on derivatives. Comput Aided Geometric Des 3:295–311
Floater M (1995) High-order approximation of conic sections by quadratic splines. Comput Aided Geometric Des 12:617–637
Hagen H, Hahmann S, Schreiber T (1995) Visualization and computation of curvature behavior of free-form curves and surfaces. Comput Aided Des 27:545–552
Harik RF, Derigent WJ, Ris G (2008) Computer-aided process planning in aircraft manufacturing. Comput Aided Des Appl 5:953–962
Held M, Eibl J (2005) Biarc approximation of polygons within asymmetric tolerance bands. Comput Aided Des 37:357–371
Holzle GE (1983) Knot placement for piecewise polynomial approximation of curves. Comput Aided Des 15:295–296
Hoschek J (1987) Approximate conversion of spline curves. Comput Aided Geometric Des 4:59–66
Hoschek J (1992) Circular splines. Comput Aided Des 24:611–618
Hoschek J, Schneider F-J (1994) Approximate conversion and data compression of integral and rational B-spline surfaces. In: Laurent P-J, Le Mehaute A, Schumaker LL (eds) Curves and surfaces in geometric design. A. K. Peters, Wellesley, pp 241–250
Hoschek J, Wissel N (1988) Optimal approximate conversion of spline curves and spline approximation of offset curves. Comput Aided Des 20:475–483
Kallay M (1987) Approximating a composite cubic curve by one with fewer pieces. Comput Aided Des 19:536–543
Li Z, Meek DS (2005) Smoothing an arc spline. Comput Graph 29:576–587
Meek DS, Walton DJ (1992) Approximation of discrete data by G 1 arc splines. Comput Aided Des 24:301–306
Meek DS, Walton DJ (1993) Approximating quadratic NURBS curves by arc splines. Comput Aided Des 25:371–376
Meek DS, Walton DJ (1995) Approximating smooth planar curves by arc splines. J Comput Appl Math 59:221–231
Meek DS, Walton DJ (2008) The family of biarcs that matches planar, two-point G 1 Hermite data. J Comput Appl Math 212:31–45
Ong CJ, Wong YS, Loh HT, Hong XG (1996) An optimization approach for biarc curve-fitting of B-spline curves. Comput Aided Des 28:951–959
Park H (2004) Error-bounded biarc approximation of planar curves. Comput Aided Des 36:1241–1251
Parkinson DB (1992) Optimized biarc curves with tension. Comput Aided Geometric Des 9:207–218
Parkinson DB, Moreton DN (1991) Optimal biarc-curve fitting. Comput Aided Des 23:411–419
Patrikalakis NM (1989) Approximate conversion of rational splines. Comput Aided Geometric Des 6:155–165
Piegl LA, Tiller W (1997) The NURBS book. Springer-Verlag, New York, NY
Piegl LA, Tiller W (1997) Symbolic operators for NURBS. Comput Aided Des 29:361–368
Piegl LA, Tiller W (2002) Data approximation using biarcs. Eng Comput 18:59–65
Piegl LA, Tiller W (2002) Biarc approximation of NURBS curves. Comput Aided Des 34:807–814
Pratt MJ, Goult RJ, Ye L (1993) On rational parametric curve approximation. Comput Aided Geometric Des 10:363–377
Qiu H, Cheng K, Li Y (1997) Optimal circular arc interpolation for NC tool path generation in curve contour manufacturing. Comput Aided Des 29:751–760
Sabin MA (1977) The use of piecewise forms for the numerical representation of shape. Report 60/1977, Computer and Automation Institute, Hungarian Academy of Sciences
Schoenherr J (1993) Smooth biarc curves. Comput Aided Des 25:365–370
Sederberg T, Kakimoto M (1991) Approximating rational curves using polynomial curves. In: Farin G (ed) NURBS for curve and surface design. SIMA, Philadelphia, PA, pp 149–158
Sir Z, Feichtinger R, Juttler B (2006) Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics. Comput Aided Des 38:608–618
Smarodzinava O, Rajab K, Piegl LA, Valavanis KP (2008) From CT to NURBS: bio-modeling with B-spline curves. The Visual Computer, submitted
Wolter FE (1992) Approximation of high-degree and procedural curves. Eng Comput 8:61–80
Xidias EK, Azariadis PN, Aspragathos NA (2008) Path planning of holonomic and non-holonomic robots using bump-surfaces. Comput Aided Des Appl 5:497–507
Yang X, Chen ZC (2008) A practical approach to G 1 biarc approximations for making accurate, smooth and non-gouged profile features in CNC contouring. Comput Aided Des 38:1205–1213
Yang X, Wang G (2001) Planar point set fairing and fitting by arc splines. Comput Aided Des 33:35–43
Yang H, Wang W, Sun J (2004) Control point adjustment for B-spline curve approximation. Comput Aided Des 36:639–652
Yeung M, Walton DJ (1994) Curve fitting with arc splines for NC toolpath generation. Comput Aided Des 26:845–849
Yong JH, Hu SM, Sun JG (2000) Bisection algorithms for approximating quadratic Bezier curves by G 1 arc splines. Comput Aided Des 32:253–260
Acknowledgments
The work reported in this paper was supported by the US National Science Foundation under grant number DMI-0758231, awarded to the University of South Florida. All opinions, findings, conclusions and recommendations expressed in this paper are those of the author and do not necessarily reflect the views of the National Science Foundation or the University of South Florida.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Piegl, L.A., Rajab, K., Smarodzinava, V. et al. Using a biarc filter to compute curvature extremes of NURBS curves. Engineering with Computers 25, 379–387 (2009). https://doi.org/10.1007/s00366-009-0131-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00366-009-0131-8