English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup)

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

arXiv:1803.00806.pdf
(Preprint), 157KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Baldus, J., & Bringmann, K. (2018). A Fast Implementation of Near Neighbors Queries for Fréchet Distance (GIS Cup). Retrieved from http://arxiv.org/abs/1803.00806.


Cite as: http://hdl.handle.net/21.11116/0000-0001-3E1A-E
Abstract
This paper describes an implementation of fast near-neighbours queries (also known as range searching) with respect to the Fr\'echet distance. The algorithm is designed to be efficient on practical data such as GPS trajectories. Our approach is to use a quadtree data structure to enumerate all curves in the database that have similar start and endpoints as the query curve. On these curves we run positive and negative filters to narrow the set of potential results. Only for those trajectories where these heuristics fail, we compute the Fr\'echet distance exactly, by running a novel recursive variant of the classic free-space diagram algorithm. Our implementation won the ACM SIGSPATIAL GIS Cup 2017.