Efficient trajectory queries under the Fréchet distance (GIS Cup)

Kevin Buchin, Tom van Diggelen, Yago Diez, Wouter Meulemans

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Consider a set P of trajectories (polygonal lines in R2), and a query given by a trajectory Q and a threshold > 0. To answer the query, we wish to find all trajectories P ? P such that F(P, Q) ?, where F denotes the Fréchet distance. We present an approach to efficiently answer a large number of queries for the same set P. Key ingredients are (a) precomputing a spatial hash that allows us to quickly find trajectories that have endpoints near Q; (b) precomputing simplifications on all trajectories in P; (c) using the simplifications and optimizations of the decision algorithm to efficiently decide F(P, Q) ? for most P ? P.

Original languageEnglish
Title of host publicationGIS
Subtitle of host publicationProceedings of the ACM International Symposium on Advances in Geographic Information Systems
EditorsSiva Ravada, Erik Hoel, Roberto Tamassia, Shawn Newsam, Goce Trajcevski, Goce Trajcevski
PublisherAssociation for Computing Machinery
ISBN (Print)9781450354905
DOIs
Publication statusPublished - 2017 Nov 7
Event25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017 - Redondo Beach, United States
Duration: 2017 Nov 72017 Nov 10

Publication series

NameGIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
Volume2017-November

Other

Other25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017
CountryUnited States
CityRedondo Beach
Period17/11/717/11/10

Keywords

  • Fréchet distance
  • Range searching
  • Trajectories

ASJC Scopus subject areas

  • Earth-Surface Processes
  • Computer Science Applications
  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Information Systems

Fingerprint Dive into the research topics of 'Efficient trajectory queries under the Fréchet distance (GIS Cup)'. Together they form a unique fingerprint.

  • Cite this

    Buchin, K., van Diggelen, T., Diez, Y., & Meulemans, W. (2017). Efficient trajectory queries under the Fréchet distance (GIS Cup). In S. Ravada, E. Hoel, R. Tamassia, S. Newsam, G. Trajcevski, & G. Trajcevski (Eds.), GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems [101] (GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems; Vol. 2017-November). Association for Computing Machinery. https://doi.org/10.1145/3139958.3140064