Computing intersections of planar spline curves using knot insertion
暂无分享,去创建一个
[1] L. Schumaker. Spline Functions: Basic Theory , 1981 .
[2] W. Boehm. Inserting New Knots into B-spline Curves , 1980 .
[3] G. Farin. Curves and Surfaces for Cagd: A Practical Guide , 2001 .
[4] Sintef Ict,et al. Aspects of Intersection Algorithms and Approximation , 2000 .
[5] Richard F. Riesenfeld,et al. A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Christian Schulz. Bézier clipping is quadratically convergent , 2009, Comput. Aided Geom. Des..
[7] Chee-Keng Yap. Complete subdivision algorithms, I: intersection of Bezier curves , 2006, SCG '06.
[8] Ulrich Reif. Best bounds on the approximation of polynomials and splines by their control structure , 2000, Comput. Aided Geom. Des..
[9] Tomoyuki Nishita,et al. Curve intersection using Bézier clipping , 1990, Comput. Aided Des..
[10] Bernard Mourrain,et al. Subdivision methods for solving polynomial equations , 2009, J. Symb. Comput..
[11] Martin Reimers,et al. An unconditionally convergent method for computing zeros of splines and polynomials , 2007, Math. Comput..