Improved algebraic algorithm on point projection for bézier curves

Proceedings - 2nd International Multi-Symposiums on Computer and Computational Sciences, IMSCCS'07

Volumn , Issue , 2007, Pages 158-163

  Chen, Xiao Diao ^a,c   Zhou, Yin ^a   Shu, Zhenyu ^a   Su, Hua ^b   Paul, Jean Claude ^b,c  

^a ZHEJIANG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

^c INRIA   (France)

Author keywords

Algebraic pruning method; Continued fraction method; NURBS curve; Point projection

Indexed keywords

BOOLEAN ALGEBRA; CURVES (ROAD); MATRIX ALGEBRA; SPLINES;

ALGEBRAIC ALGORITHMS; COMPUTATIONAL SCIENCES; CONTINUED FRACTIONS; INTERNATIONAL (CO); NEW METHODS; NON-UNIFORM RATIONAL B-SPLINE (NURBS) CURVES; ROOT-FINDING;

COMPUTATIONAL METHODS;

EID: 46449095468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IMSCCS.2007.4392595     Document Type: Conference Paper

References (33)

1. Acton F.S., Witkins W. Numerical methods that work(2nd printing). Washington : Mathematical Association of America, 1990.
2. Abramchuk V.S., Lyashko S.I. Solution of equations with one variable. Journal of Mathematical Sciences 2002, 109(4): 1669-1679.
3. Aliashvili T. Counting real roots of polynomial endomorphisms. Journal of Mathematical Sciences 2003, 118(5):5325-5346.
4. Boehm, W. Inserting new knots into B-spline curves. Computer-Aided Design 1980, 12(2): 199-201.
5. Chen X.D., Su H., Yong J.H., Paul J.C., Sun J.G. A counterexample on point inversion and projection for NURBS curve. Computer Aided Geometric Design 2007, 24:302.
6. Cohen E., Lyche T., Riesebfeld R. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Computer Graphics and Image Processing 1980, 14(2):87-111.
7. Collins G.E., Akritas A.G. Polynomial real root isolation using Descarte's rule of signs. Proceedings of the third ACM symposium on Symbolic and algebraic computation, 1976, pp. 272-275.
8. Collins G.E. Polynomial minimum root separation. Journal of Symbolic Computation 2001, 32(5):467-473.
9. Elber G., Kim M.S. Geometric constraint solver using multivariate rational spline functions. Proceedings of the sixth ACM symposium on Solid modeling and applications, 2001, pp.1-10.
10. Hansen E. R., Greenberg R. I. Interval Newton method. Applied Mathematics and Computation 1983, 12(2-3):89-98.
11. Hu S.M., Wallner J. A second order algorithm for orthogonal projection onto curves and surfaces. Computer Aided Geometric Design 2005, 22(3):251-260.
12. Johnson D.E., Cohen E. A framework for efficient minimum distance computations. Proceedings of IEEE International Conference on Robotics & Automation 1998, pp. 3678-3684.
13. Johnson D.E., Cohen E. Distance extrema for spline models using tangent cones. Proceedings of the 2005 conference on Graphics Interface 2005, pp.169-175.
14. Ma Y.L., Hew W.T. Point inversion and projection for NURBS curve and surface: Control polygon approach. Computer Aided Geometric Design 2003, 20(2):79-99.
15. Mishina A.P., Proskuryakov I.V. Higher algebra: linear algebra, polynomials, general algebra (1st English edition). Oxford, Pergamon Press Ltd., 1965.
16. Mortenson M.E. Geometric modeling. New York : Wiley, 1985.
17. Patrikalakis N., Maekawa T. Shape interrogation for computer aided design and manufacturing. Springer, 2001.
18. Pegna J., Wolter F.E. Surface curve design by orthogonal projection of space curves onto free-form surfaces. Journal of Mechanical Design, ASME Transactions 1996, 118(1):45-52.
19. Petkovic M., Petkovic L., Ilic S. The guaranteed convergence of Laguerre-like method. Computers and Mathematics with Applications 2003, 46(2):239-251.
20. Phien H.N., Dejdumrong N. Efficient algorithms for Bézier curves. Computer Aided Geometric Design 2000, 17(3):247-250.
21. Piegl L., Tiller W. The NURBS book. New York: Springer, 1995.
22. Piegl L., Tiller W. Parametrization for surface fitting in reverse engineering. Computer-Aided Design 2001, 33(8):593-603.
23. Press W.H., Teukolsky S.A., Vetterling W.T., Flannery B.P. Numerical recipes in C: the art of scientific computing (Second Edition). New York : Cambridge University Press, 1992.
24. 3n) algorithm for the real root problem. Foundations of Computer Science 1993, pp.626-635.
25. Rouillier F., Zimmermann P. Efficient isolation of polynomial's real roots. Journal of Computational and Applied Mathematics 2004, 162(1):33-50.
26. Sederberg T.W., Nishita T. Curve intersection using Bezier clipping. Computer-Aided Design 1990, 22(9):538-549.
27. Ilijas Selimovic. Improved algorithms for the projection of points on NURBS curves and surfaces. Computer Aided Geometric Design 2006, 23:439-445.
28. Wait R. The Numerical Solution of Algebraic Equations. Wiley, Chichester, 1979.
29. Wu X., Fu D. New High-order convergence iteration methods without employing derivatives for solving nonlinear equations. Computers and Mathematics with Applications, 2001, 41(3):489-495.
30. Yang H.P., Wang W.P., Sun J.G. . Control point adjustment for b-spline curve approximation. Computer-Aided Design 2004, 36(7):639-652.
31. Yang L., Zhang J.Z., Hou X.L. Non-linear equation system and automated theory proving (in chinese). Shanghai : Shanghai press of science, technique and edution, 1996.
32. Ye Y. Combining binary search and Newton's method to compute real roots for a class of real functions. Journal of Complexity 1994, 10(3):271-280.
33. Zhou, J.M., Sherbrooke, E.C., Patrikalakis, N. Computation of stationary points of distance functions. Engineering with Computers, 1993, 9:231-246.