Show simple item record

dc.contributor.authorAgarwal, Pankaj
dc.contributor.authorAronov, Boris
dc.contributor.authorKreveld, Marc van
dc.contributor.authorLöffler, Maarten
dc.contributor.authorSilveira, Rodrigo Ignacio
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2011-03-25T17:22:31Z
dc.date.available2011-03-25T17:22:31Z
dc.date.created2010
dc.date.issued2010
dc.identifier.citationAgarwal, P.K. [et al.]. Computing similarity between piecewise-linear functions. A: ACM Symposium on Computational Geometry. "2010 annual symposium on Computational geometry". Snowbird, Utah: ACM Press. Association for Computing Machinery, 2010, p. 375-383.
dc.identifier.isbn978-1-4503-0016-2
dc.identifier.urihttp://hdl.handle.net/2117/12090
dc.description.abstractWe study the problem of computing the similarity between two piecewise-linear bivariate functions de ned over a common domain, where the surfaces they de ne 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=p") time, for any xed " > 0. The (1 + ")- approximation algorithm for the bivariate version, where volume is minimized, runs in O(n="2) time, for any xed " > 0, provided the two functions are de ned over the same triangulation of their domain.
dc.format.extent9 p.
dc.language.isoeng
dc.publisherACM Press. Association for Computing Machinery
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
dc.subject.lcshGeometric programming
dc.titleComputing similarity between piecewise-linear functions
dc.typeConference report
dc.subject.lemacProgramació geomètrica
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.identifier.doi10.1145/1810959.1811020
dc.subject.inspecClassificació INSPEC::Optimisation::Mathematical programming::Geometric programming
dc.relation.publisherversionhttp://doi.acm.org/10.1145/1810959.1811020
dc.rights.accessOpen Access
drac.iddocument4496846
dc.description.versionPostprint (author’s final draft)
upcommons.citation.authorAgarwal, P.K.; Aronov, B.; Kreveld, M. van; Löffler, M.; Silveira, R.I.
upcommons.citation.contributorACM Symposium on Computational Geometry
upcommons.citation.pubplaceSnowbird, Utah
upcommons.citation.publishedtrue
upcommons.citation.publicationName2010 annual symposium on Computational geometry
upcommons.citation.startingPage375
upcommons.citation.endingPage383


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain