Presentation 2014/11/13
New Algorithms and Lower Bounds for the Discrete Frechet Distance
KARL BRINGMANN, WOLFGANG MULZER,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Frechet distance is a popular and widespread distance measure for point sequences and curves. About two years ago, Agarwal et al presented a new subquadratic algorithm for the discrete version of the problem. This has spawned a flurry of activity that has led to several new algorithms and lower bounds. Building on a recent result by Bringmann, we present a new lower bound that shows that it is unlikely that one can obtain a subquadratic algorithm for the discrete Frechet distance, even in the one-dimensional case and even if we allow the solution to be approximate by a factor of 1.4. We also present the first non-trivial subquadratic approximation algorithm for the general discrete Frechet distance: given to sequences P and Q of n points in d dimensions, an a-approximation for the discrete Frechet distance between P and Q can be computed in time O(n log n + n^2/α), for any α ∈ (1, ... , n].
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # Vol.2014-AL-150 No.29
Date of Issue

Conference Information
Committee CAS
Conference Date 2014/11/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) New Algorithms and Lower Bounds for the Discrete Frechet Distance
Sub Title (in English)
Keyword(1)
1st Author's Name KARL BRINGMANN
1st Author's Affiliation ETH Zurich()
2nd Author's Name WOLFGANG MULZER
2nd Author's Affiliation Institut fur Informatik, Freie Universitat Berlin
Date 2014/11/13
Paper # Vol.2014-AL-150 No.29
Volume (vol) vol.114
Number (no) 312
Page pp.pp.-
#Pages 6
Date of Issue