Computing the distance between piecewise-linear bivariate functions

Guillaume Moroz, Boris Aronov

    Research output: Contribution to journalArticle

    Abstract

    We consider the problem of computing the distance between two piecewise-linear bivariate functions f and g defined over a common domain M, induced by the L2 norm-that is, ∥ f - g∥2 = √ ∫M( f - g)2. If f is defined by linear interpolation over a triangulation of M with n triangles and g is defined over another such triangulation, the obvious naive algorithm requires Θ (n2) arithmetic operations to compute this distance.We show that it is possible to compute it in O(nlog4 nlog log n) arithmetic operations by reducing the problem to multipoint evaluation of a certain type of polynomials. We also present several generalizations and an application to terrain matching.

    Original languageEnglish (US)
    Article number3
    JournalACM Transactions on Algorithms
    Volume12
    Issue number1
    DOIs
    StatePublished - Feb 1 2016

    Fingerprint

    Piecewise Linear
    Triangulation
    Linear Interpolation
    Computing
    Triangle
    Norm
    Polynomial
    Evaluation
    Generalization

    Keywords

    • Multipoint evaluation
    • Piecewise-linear function
    • Polyhedral terrain

    ASJC Scopus subject areas

    • Mathematics (miscellaneous)

    Cite this

    Computing the distance between piecewise-linear bivariate functions. / Moroz, Guillaume; Aronov, Boris.

    In: ACM Transactions on Algorithms, Vol. 12, No. 1, 3, 01.02.2016.

    Research output: Contribution to journalArticle

    Moroz, Guillaume ; Aronov, Boris. / Computing the distance between piecewise-linear bivariate functions. In: ACM Transactions on Algorithms. 2016 ; Vol. 12, No. 1.
    @article{91420ecb3db04ed9ba6e6a5f0257792f,
    title = "Computing the distance between piecewise-linear bivariate functions",
    abstract = "We consider the problem of computing the distance between two piecewise-linear bivariate functions f and g defined over a common domain M, induced by the L2 norm-that is, ∥ f - g∥2 = √ ∫M( f - g)2. If f is defined by linear interpolation over a triangulation of M with n triangles and g is defined over another such triangulation, the obvious naive algorithm requires Θ (n2) arithmetic operations to compute this distance.We show that it is possible to compute it in O(nlog4 nlog log n) arithmetic operations by reducing the problem to multipoint evaluation of a certain type of polynomials. We also present several generalizations and an application to terrain matching.",
    keywords = "Multipoint evaluation, Piecewise-linear function, Polyhedral terrain",
    author = "Guillaume Moroz and Boris Aronov",
    year = "2016",
    month = "2",
    day = "1",
    doi = "10.1145/2847257",
    language = "English (US)",
    volume = "12",
    journal = "ACM Transactions on Algorithms",
    issn = "1549-6325",
    publisher = "Association for Computing Machinery (ACM)",
    number = "1",

    }

    TY - JOUR

    T1 - Computing the distance between piecewise-linear bivariate functions

    AU - Moroz, Guillaume

    AU - Aronov, Boris

    PY - 2016/2/1

    Y1 - 2016/2/1

    N2 - We consider the problem of computing the distance between two piecewise-linear bivariate functions f and g defined over a common domain M, induced by the L2 norm-that is, ∥ f - g∥2 = √ ∫M( f - g)2. If f is defined by linear interpolation over a triangulation of M with n triangles and g is defined over another such triangulation, the obvious naive algorithm requires Θ (n2) arithmetic operations to compute this distance.We show that it is possible to compute it in O(nlog4 nlog log n) arithmetic operations by reducing the problem to multipoint evaluation of a certain type of polynomials. We also present several generalizations and an application to terrain matching.

    AB - We consider the problem of computing the distance between two piecewise-linear bivariate functions f and g defined over a common domain M, induced by the L2 norm-that is, ∥ f - g∥2 = √ ∫M( f - g)2. If f is defined by linear interpolation over a triangulation of M with n triangles and g is defined over another such triangulation, the obvious naive algorithm requires Θ (n2) arithmetic operations to compute this distance.We show that it is possible to compute it in O(nlog4 nlog log n) arithmetic operations by reducing the problem to multipoint evaluation of a certain type of polynomials. We also present several generalizations and an application to terrain matching.

    KW - Multipoint evaluation

    KW - Piecewise-linear function

    KW - Polyhedral terrain

    UR - http://www.scopus.com/inward/record.url?scp=84964424955&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84964424955&partnerID=8YFLogxK

    U2 - 10.1145/2847257

    DO - 10.1145/2847257

    M3 - Article

    VL - 12

    JO - ACM Transactions on Algorithms

    JF - ACM Transactions on Algorithms

    SN - 1549-6325

    IS - 1

    M1 - 3

    ER -