# Computing similarity between piecewise-linear functions

Published

Journal Article

We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D-polyhedral terrains-can be transformed vertically by a linear transformation of the third coordinate (scaling and translation). We present a randomized algorithm that minimizes the maximum vertical distance between the graphs of the two functions, over all linear transformations of one of the terrains, in O(n4/3 polylog n) expected time, where n is the total number of vertices in the graphs of the two functions. We also study the computation of similarity between two univariate or bivariate functions by minimizing the area or volume between their graphs. For univariate functions we give a (1+ε)-approximation algorithm for minimizing the area that runs in O(n/√ε) time, for any fixed ε > 0. The (1 + ε)-approximation algorithm for the bivariate version, where volume is minimized, runs in O(n/ε2) time, for any fixed ε > 0, provided the two functions are defined over the same triangulation of their domain.

### Full Text

### Duke Authors

### Cited Authors

- Agarwal, PK; Aronov, B; Van Kreveld, M; Löffler, M; Silveira, RI

### Published Date

- July 30, 2010

### Published In

- Proceedings of the Annual Symposium on Computational Geometry

### Start / End Page

- 375 - 383

### Digital Object Identifier (DOI)

- 10.1145/1810959.1811020

### Citation Source

- Scopus