IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i20p3766-d940577.html
   My bibliography  Save this article

Progressive Iterative Approximation of Non-Uniform Cubic B-Spline Curves and Surfaces via Successive Over-Relaxation Iteration

Author

Listed:
  • Huahao Shou

    (College of Science, Zhejiang University of Technology, Hangzhou 310023, China)

  • Liangchen Hu

    (School of Computer and Information, Anhui Normal University, Wuhu 241002, China)

  • Shiaofen Fang

    (Department of Computer & Information Science, Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202, USA)

Abstract

Geometric iteration (GI) is one of the most efficient curve- or surface-fitting techniques in recent years, which is famous for its remarkable geometric significance. In essence, GI can be thought of as the sum of iterative methods for solving systems of linear equations, such as progressive iterative approximation (PIA) which relies on the theory of Richardson iteration. Thus, when the curve- or surface-fitting error is at a desired level, we want to have as few iterations as possible to improve efficiency when dealing with large data sets. Based on the idea of successive over-relaxation (SOR) iteration, we formulate a faster PIA curve and surface interpolation scheme using classical non-uniform cubic B-splines, named SOR-PIA. The genetic algorithm is utilized to estimate the best approximate relaxation factor of SOR-PIA. Similar to standard PIA, SOR-PIA can also be regarded as a process in which the control points move in one direction, but it can greatly reduce the number of iterations in the iterative process with the same fitting accuracy. By comparing with the standard PIA and WPIA algorithms, the effectiveness of the SOR-PIA iterative interpolation algorithm can be verified.

Suggested Citation

  • Huahao Shou & Liangchen Hu & Shiaofen Fang, 2022. "Progressive Iterative Approximation of Non-Uniform Cubic B-Spline Curves and Surfaces via Successive Over-Relaxation Iteration," Mathematics, MDPI, vol. 10(20), pages 1-17, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:20:p:3766-:d:940577
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/20/3766/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/20/3766/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:20:p:3766-:d:940577. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.