Improved Algebraic Algorithm on Point projection for B´eziercurves
暂无分享,去创建一个
Xiao-Diao Chen | Hua Su | Yin Zhou | Zhenyu Shu | Xiao-Diao Chen | Zhenyu Shu | Yin Zhou | Hua Su
[1] R. A. Walt,et al. The numerical solution of algebraic equations , 1979 .
[2] Elaine Cohen,et al. A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[3] A. Mishina,et al. Higher algebra: linear algebra, polynomials, general algebra , 1965 .
[4] YingLiang Ma,et al. Point inversion and projection for NURBS curve and surface: Control polygon approach , 2003, Comput. Aided Geom. Des..
[5] Franz-Erich Wolter,et al. Surface Curve Design by Orthogonal Projection of Space Curves Onto Free-Form Surfaces , 1996 .
[6] Forman S. Acton,et al. Numerical methods that work , 1970 .
[7] R. Baker Kearfott,et al. Interval Newton Methods , 2009, Encyclopedia of Optimization.
[8] Elaine Cohen,et al. Distance extrema for spline models using tangent cones , 2005, Graphics Interface.
[9] George E. Collins,et al. Polynomial Minimum Root Separation , 2001, J. Symb. Comput..
[10] S. I. Lyashko,et al. Solution of Equations with One Variable , 2002 .
[11] P. Zimmermann,et al. Efficient isolation of polynomial's real roots , 2004 .
[12] Tomoyuki Nishita,et al. Curve intersection using Bézier clipping , 1990, Comput. Aided Des..
[13] Shi-Min Hu,et al. A second order algorithm for orthogonal projection onto curves and surfaces , 2005, Comput. Aided Geom. Des..
[14] Jun-Hai Yong,et al. A counterexample on point inversion and projection for NURBS curve , 2007, Comput. Aided Geom. Des..
[15] Alkiviadis G. Akritas,et al. Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.
[16] Yinyu Ye. Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions , 1994, J. Complex..
[17] Xinyuan Wu,et al. New high-order convergence iteration methods without employing derivatives for solving nonlinear equations , 2001 .
[18] Wenping Wang,et al. Control point adjustment for B-spline curve approximation , 2004, Comput. Aided Des..
[19] John H. Reif. An O(nlog/sup 3/ n) algorithm for the real root problem , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[20] William H. Press,et al. The Art of Scientific Computing Second Edition , 1998 .
[21] Ilijas Selimovic,et al. Improved algorithms for the projection of points on NURBS curves and surfaces , 2006, Comput. Aided Geom. Des..
[22] Tom Lyche,et al. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .
[23] Michael E. Mortenson,et al. Geometric Modeling , 2008, Encyclopedia of GIS.
[24] Les A. Piegl,et al. Parametrization for surface fitting in reverse engineering , 2001, Comput. Aided Des..
[25] T. Aliashvili. Counting Real Roots of Polynomial Endomorphisms , 2003 .
[26] Nicholas M. Patrikalakis,et al. Computation of stationary points of distance functions , 1993, Engineering with Computers.
[27] L. Piegl,et al. The NURBS Book , 1995, Monographs in Visual Communications.
[28] Gershon Elber,et al. Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.
[29] Nicholas M. Patrikalakis,et al. Shape Interrogation for Computer Aided Design and Manufacturing , 2002, Springer Berlin Heidelberg.
[30] Natasha Dejdumrong,et al. Efficient algorithms for Bézier curves , 2000, Comput. Aided Geom. Des..
[31] W. Boehm. Inserting New Knots into B-spline Curves , 1980 .
[32] Slobodan Ilic,et al. The guaranteed convergence of Laguerre-like method , 2003 .