IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i15p4448-4474.html
   My bibliography  Save this article

NURBS curve interpolation algorithm based on tool radius compensation method

Author

Listed:
  • Bo Zhou
  • Jibin Zhao
  • Lun Li
  • Renbo Xia

Abstract

This paper focuses on developing an algorithm that can generate toolpaths in NURBS form for smooth, high speed and accurate machining. The initial toolpaths are obtained by tool radius compensation method which is based on the workpiece boundary offsetting. According to different lengths and the continuous short block (CSB) criterion, these offset linear segments can be regarded as CSBs or long straight segments. Junctions are located where the curvature value is greater than the preset curvature threshold value or where it changes abruptly, or at the two end points of any long straight segment. During machining, the NURBS fitting module first looks ahead several CSBs and converts them into parametric curves in real time. During the conversion, continuities of the position, slope or even curvature at the transition of the parametric curves and unfitted line segments can be guaranteed. Then the acceleration/deceleration feedrate-planning scheme is proposed to determine the transition feedrate at the junction between the fitted curves and unfitted long straight segments, and the corner feedrate within the fitted curve. Simulations and experiments show that the proposed algorithm can significantly improve machining accuracy and reduce cutting time to satisfy today’s high-speed and high-accurate machining requirements.

Suggested Citation

  • Bo Zhou & Jibin Zhao & Lun Li & Renbo Xia, 2016. "NURBS curve interpolation algorithm based on tool radius compensation method," International Journal of Production Research, Taylor & Francis Journals, vol. 54(15), pages 4448-4474, August.
  • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:15:p:4448-4474
    DOI: 10.1080/00207543.2015.1062933
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1062933
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2015.1062933?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:54:y:2016:i:15:p:4448-4474. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.