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

Point Orthogonal Projection onto a Spatial Algebraic Curve

Author

Listed:
  • Taixia Cheng

    (Graduate School, Guizhou Minzu University, Guiyang 550025, China
    These authors contributed equally to this work.)

  • Zhinan Wu

    (School of Mathematics and Computer Science, Yichun University, Yichun 336000, China
    These authors contributed equally to this work.)

  • Xiaowu Li

    (College of Data Science and Information Engineering, Guizhou Minzu University, Guiyang 550025, China
    These authors contributed equally to this work.)

  • Chan Wang

    (School of Finance, Central University of Finance and Economics, Beijing 100081, China
    These authors contributed equally to this work.)

Abstract

Point orthogonal projection onto a spatial algebraic curve plays an important role in computer graphics, computer-aided geometric design, etc. We propose an algorithm for point orthogonal projection onto a spatial algebraic curve based on Newton’s steepest gradient descent method and geometric correction method. The purpose of Algorithm 1 in the first step of Algorithm 4 is to let the initial iteration point fall on the spatial algebraic curve completely and successfully. On the basis of ensuring that the iteration point fallen on the spatial algebraic curve, the purpose of the intermediate for loop body including Step 2 and Step 3 is to let the iteration point gradually approach the orthogonal projection point (the closest point) such that the distance between them is very small. Algorithm 3 in the fourth step plays an important double acceleration and orthogonalization role. Numerical example shows that our algorithm is very robust and efficient which it achieves the expected and ideal result.

Suggested Citation

  • Taixia Cheng & Zhinan Wu & Xiaowu Li & Chan Wang, 2020. "Point Orthogonal Projection onto a Spatial Algebraic Curve," Mathematics, MDPI, vol. 8(3), pages 1-23, March.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:3:p:317-:d:326743
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/3/317/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/3/317/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhinan Wu & Xiaowu Li, 2019. "An Improved Curvature Circle Algorithm for Orthogonal Projection onto a Planar Algebraic Curve," Mathematics, MDPI, vol. 7(10), pages 1-24, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:8:y:2020:i:3:p:317-:d:326743. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.