Fetching the paper…
Reading the bibliography…
The discrete Fr\'echet distance is a popular measure for comparing polygonal curves.
Applying parallel computation algorithms in the design of serial algorithms
Nimrod Megiddo · 1983
Earlier work this paper cites.
Scaling and related techniques for geometry problems
Harold N. Gabow, Jon Louis Bentley, and Robert Endre Tarjan · 1984
Earlier work this paper cites.
Slowing down sorting networks to obtain faster sorting algorithms
Richard Cole · 1987
Earlier work this paper cites.
A functional approach to data structures and its use in multidimensional searching
Bernard Chazelle · 1988
Earlier work this paper cites.
Improvements on geometric pattern matching problems
L. Paul Chew and Klara Kedem · 1992
Earlier work this paper cites.
The upper envelope of voronoi surfaces and its applications
Daniel P Huttenlocher, Klara Kedem, and Micha Sharir · 1993
Earlier work this paper cites.
A fully dynamic data structure for reachability in planar digraphs
Sairam Subramanian · 1993
Earlier work this paper cites.
Computing discrete Fréchet distance
Thomas Eiter and Heikki Mannila · 1994
Earlier work this paper cites.
Computing the Fréchet distance between two polygonal curves
Helmut Alt and Michael Godau · 1995
Earlier work this paper cites.
Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
W. J. Rucklidge · 1996
Earlier work this paper cites.
A fully dynamic approximation scheme for shortest paths in planar graphs
Philip N. Klein and Sairam Subramanian · 1998
Earlier work this paper cites.
Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification
Mario E. Munich and Pietro Perona · 1999
Earlier work this paper cites.
Matching polygonal curves with respect to the Fréchet distance
Helmut Alt, Christian Knauer, and Carola Wenk · 2001
Earlier work this paper cites.
Pattern matching for sets of segments
Alon Efrat, Piotr Indyk, and Suresh Venkatasubramanian · 2001
Earlier work this paper cites.
On the complexity of k-SAT
Russell Impagliazzo and Ramamohan Paturi · 2001
Earlier work this paper cites.
Approximate nearest neighbor algorithms for Fréchet distance via product metrics
Piotr Indyk · 2002
Earlier work this paper cites.
Shape matching in higher dimensions
Carola Wenk · 2002
Earlier work this paper cites.
On map-matching vehicle tracking data
Sotiris Brakatsoulas, Dieter Pfoser, Randall Salas, and Carola Wenk · 2005
Earlier work this paper cites.
Approximately matching polygonal curves with respect to the Fréchet distance
Axel Mosig and Michael Clausen · 2005
Cited alongside, same era.
A new algorithm for optimal 2-constraint satisfaction and its implications
Ryan Williams · 2005
Cited alongside, same era.
Fully dynamic orthogonal range reporting on RAM
Christian Worm Mortensen · 2006
Cited alongside, same era.
Dynamic plane transitive closure
Krzysztof Diks and Piotr Sankowski · 2007
Cited alongside, same era.
Protein structure–structure alignment with discrete Fréchet distance
Minghui Jiang, Ying Xu, and Binhai Zhu · 2008
Cited alongside, same era.
Exact algorithms for partial curve matching via the Fréchet distance
Kevin Buchin, Maike Buchin, and Yusu Wang · 2009
Cited alongside, same era.
Why walking the dog takes time: Fréchet distance has no strongly subquadratic algorithms unless SETH fails
Karl Bringmann · 2014
Later among the works it cites.
Improved Algorithms for Partial Curve Matching
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh · 2014
Later among the works it cites.
The discrete and semicontinuous Fréchet distance with shortcuts via approximate distance counting and selection
Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, and Micha Sharir · 2015
Later among the works it cites.
A faster algorithm for the discrete Fréchet distance under translation
Rinat Ben Avraham, Haim Kaplan, and Micha Sharir · 2015
Later among the works it cites.
Omrit Filtser and Matthew J. Katz · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Can we compute the similarity between surfaces?
Helmut Alt and Maike Buchin · 2010
Cited alongside, same era.
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Erin Wolf Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, and Shripad Thite · 2010
Cited alongside, same era.
Geodesic Fréchet distance inside a simple polygon
A. F. Cook and Carola Wenk · 2010
Cited alongside, same era.
Detecting commuting patterns by clustering subtrajectories
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, and Jun Luo · 2011
Cited alongside, same era.
Improved algorithms for min cut and max flow in undirected planar graphs
Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, and Christian Wulff-Nilsen · 2011
Cited alongside, same era.
Fréchet distance with speed limits
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, and Hamid Zarrabi-Zadeh · 2011
Cited alongside, same era.
Popular conjectures as a barrier for dynamic planar graph algorithms
Amir Abboud and Søren Dahlgaard · 2016
Later among the works it cites.
A fast implementation of near neighbors queries for Fréchet distance (GIS Cup)
Julian Baldus and Karl Bringmann · 2017
Later among the works it cites.
Efficient trajectory queries under the Fréchet distance (GIS Cup)
Kevin Buchin, Yago Diez, Tom van Diggelen, and Wouter Meulemans · 2017
Later among the works it cites.
Dynamic orthogonal range searching on the ram, revisited
Timothy M. Chan and Konstantinos Tsakalidis · 2017
Later among the works it cites.
A filter-and-refinement-algorithm for range queries based on the Fréchet distance (GIS Cup)
Fabian Dütsch and Jan Vahrenhold · 2017
Later among the works it cites.
Computing the Fréchet Gap Distance
Chenglin Fan and Benjamin Raichel · 2017
Later among the works it cites.
Decremental single-source reachability in planar digraphs
Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki, and Piotr Sankowski · 2017
Later among the works it cites.
Tighter connections between Formula-SAT and shaving logs
Amir Abboud and Karl Bringmann · 2018
Closest in time.
O ~ ( n 1 / 3 ) \widetilde{O}(n^{1/3}) -space algorithm for the grid graph reachability problem
Ryo Ashida and Kotaro Nakagawa · 2018
Closest in time.
Algorithms for the Discrete Fréchet Distance Under Translation
Omrit Filtser and Matthew J. Katz · 2018
Closest in time.
Fréchet distance under translation: Conditional hardness and an algorithm via offline dynamic grid reachability
Karl Bringmann, Marvin Künnemann, and André Nusser · 2019
Closest in time.
Walking the dog fast in practice: Algorithm engineering of the Fréchet distance
Karl Bringmann, Marvin Künnemann, and André Nusser · 2019
Closest in time.