IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v199y2023i2d10.1007_s10957-023-02292-3.html
   My bibliography  Save this article

An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products

Author

Listed:
  • Andreas Bärmann

    (Discrete Optimization)

  • Robert Burlacu

    (Discrete Optimization)

  • Lukas Hager

    (Discrete Optimization)

  • Katja Kutzer

    (Discrete Optimization)

Abstract

We investigate the optimal piecewise linear interpolation of the bivariate product xy over rectangular domains. More precisely, our aim is to minimize the number of simplices in the triangulation underlying the interpolation, while respecting a prescribed approximation error. First, we show how to construct optimal triangulations consisting of up to five simplices. Using these as building blocks, we construct a triangulation scheme called crossing swords that requires at most - times the number of simplices in any optimal triangulation. In other words, we derive an approximation algorithm for the optimal triangulation problem. We also show that crossing swords yields optimal triangulations in the case that each simplex has at least one axis-parallel edge. Furthermore, we present approximation guarantees for other well-known triangulation schemes, namely for the red refinement and longest-edge bisection strategies as well as for a generalized version of K1-triangulations. Thereby, we are able to show that our novel approach dominates previous triangulation schemes from the literature, which is underlined by illustrative numerical examples.

Suggested Citation

  • Andreas Bärmann & Robert Burlacu & Lukas Hager & Katja Kutzer, 2023. "An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products," Journal of Optimization Theory and Applications, Springer, vol. 199(2), pages 569-599, November.
    • Handle: RePEc:spr:joptap:v:199:y:2023:i:2:d:10.1007_s10957-023-02292-3
    DOI: 10.1007/s10957-023-02292-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02292-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-023-02292-3?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.

    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:spr:joptap:v:199:y:2023:i:2:d:10.1007_s10957-023-02292-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.