IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0314756.html
   My bibliography  Save this article

Fast surface reconstruction algorithm with adaptive step size

Author

Listed:
  • Jingguo Dai
  • Yeqing Yi
  • Chengzhi Liu

Abstract

In (Dai et al. 2023), the authors proposed a fast algorithm for surface reconstruction that converges rapidly from point cloud data by alternating Anderson extrapolation with implicit progressive iterative approximation (I-PIA). This algorithm employs a fixed step size during iterations to enhance convergence. To further improve the computational efficiency, an adaptive step size adjustment strategy for surface reconstruction algorithm is investigated. During each iteration, the step size is adaptively chosen based on the current residual—larger residuals may necessitate larger steps, while smaller ones might permit smaller steps. Numerical experiments indicate that, for equivalent reconstruction errors, the adaptive step size algorithm demands substantially fewer iterations and less computation time than the fixed step size approach. These improvements robustly enhance computational performance in surface reconstruction, offering valuable insights for further research and applications.

Suggested Citation

  • Jingguo Dai & Yeqing Yi & Chengzhi Liu, 2025. "Fast surface reconstruction algorithm with adaptive step size," PLOS ONE, Public Library of Science, vol. 20(1), pages 1-19, January.
  • Handle: RePEc:plo:pone00:0314756
    DOI: 10.1371/journal.pone.0314756
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0314756
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0314756&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0314756?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
    ---><---

    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:plo:pone00:0314756. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.