Abstract
In this paper, curve fitting of 3-D points generated by G01 codes and interpolation based on quadratic B-splines are studied. Feature points of G01 codes are selected using an adaptive method. Next, quadratic B-splines are obtained as the fitting curve by interpolating these feature points. Computations required in implementing the velocity planning algorithm mentioned by Timer et al. are very complicated because of the appearance of high-order curves. An improved time-optimal method for the quadratic B-spline curves is presented to circumvent this issue. The algorithms are verified with simulations as well as on real CNC machines.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
