Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails

Bringmann, K. (2014). Why Walking the Dog Takes Time: Frechet Distance Has no Strongly Subquadratic Algorithms Unless SETH Fails. Retrieved from http://arxiv.org/abs/1404.1448.

Item is

Basisdaten

einblenden: ausblenden:
Genre: Forschungspapier
Latex : Why Walking the Dog Takes Time: {Frechet} Distance Has no Strongly Subquadratic Algorithms Unless {SETH} Fails

Dateien

einblenden: Dateien
ausblenden: Dateien
:
arXiv:1404.1448.pdf (Preprint), 303KB
Name:
arXiv:1404.1448.pdf
Beschreibung:
File downloaded from arXiv at 2014-11-27 09:04
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Bringmann, Karl1, Autor                 
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: Computer Science, Computational Geometry, cs.CG
 Zusammenfassung: The Frechet distance is a well-studied and very popular measure of similarity of two curves. Many variants and extensions have been studied since Alt and Godau introduced this measure to computational geometry in 1991. Their original algorithm to compute the Frechet distance of two polygonal curves with n vertices has a runtime of O(n^2 log n). More than 20 years later, the state of the art algorithms for most variants still take time more than O(n^2 / log n), but no matching lower bounds are known, not even under reasonable complexity theoretic assumptions. To obtain a conditional lower bound, in this paper we assume the Strong Exponential Time Hypothesis or, more precisely, that there is no O*((2-delta)^N) algorithm for CNF-SAT for any delta > 0. Under this assumption we show that the Frechet distance cannot be computed in strongly subquadratic time, i.e., in time O(n^{2-delta}) for any delta > 0. This means that finding faster algorithms for the Frechet distance is as hard as finding faster CNF-SAT algorithms, and the existence of a strongly subquadratic algorithm can be considered unlikely. Our result holds for both the continuous and the discrete Frechet distance. We extend the main result in various directions. Based on the same assumption we (1) show non-existence of a strongly subquadratic 1.001-approximation, (2) present tight lower bounds in case the numbers of vertices of the two curves are imbalanced, and (3) examine realistic input assumptions (c-packed curves).

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2014-04-052014-07-312014
 Publikationsstatus: Online veröffentlicht
 Seiten: 21 p.
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: arXiv: 1404.1448
URI: http://arxiv.org/abs/1404.1448
BibTex Citekey: bringmann_walking_arXiv_2014
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: