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

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

doi:10.1145/3139958.3140064

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

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

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

Consider a set P of trajectories (polygonal lines in R²), 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 language	English
Title of host publication	GIS
Subtitle of host publication	Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
Editors	Siva Ravada, Erik Hoel, Roberto Tamassia, Shawn Newsam, Goce Trajcevski, Goce Trajcevski
Publisher	Association for Computing Machinery
ISBN (Print)	9781450354905
DOIs	https://doi.org/10.1145/3139958.3140064
Publication status	Published - 2017 Nov 7
Event	25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017 - Redondo Beach, United States Duration: 2017 Nov 7 → 2017 Nov 10

Publication series

Name	GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
Volume	2017-November

Other

Other	25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017
Country	United States
City	Redondo Beach
Period	17/11/7 → 17/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

Access to Document

10.1145/3139958.3140064

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

Efficient trajectory queries under the Fréchet distance (GIS Cup). / Buchin, Kevin; van Diggelen, Tom; Diez, Yago; Meulemans, Wouter.

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems. ed. / Siva Ravada; Erik Hoel; Roberto Tamassia; Shawn Newsam; Goce Trajcevski; Goce Trajcevski. Association for Computing Machinery, 2017. 101 (GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems; Vol. 2017-November).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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, 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017, Redondo Beach, United States, 17/11/7. https://doi.org/10.1145/3139958.3140064

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

Buchin, Kevin ; van Diggelen, Tom ; Diez, Yago ; Meulemans, Wouter. / Efficient trajectory queries under the Fréchet distance (GIS Cup). GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems. editor / Siva Ravada ; Erik Hoel ; Roberto Tamassia ; Shawn Newsam ; Goce Trajcevski ; Goce Trajcevski. Association for Computing Machinery, 2017. (GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems).

@inproceedings{3d734153a99e4d47ace9fa69b6a057d0,

title = "Efficient trajectory queries under the Fr{\'e}chet distance (GIS Cup)",

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{\'e}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.",

keywords = "Fr{\'e}chet distance, Range searching, Trajectories",

author = "Kevin Buchin and {van Diggelen}, Tom and Yago Diez and Wouter Meulemans",

year = "2017",

month = nov,

day = "7",

doi = "10.1145/3139958.3140064",

language = "English",

isbn = "9781450354905",

series = "GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems",

publisher = "Association for Computing Machinery",

editor = "Siva Ravada and Erik Hoel and Roberto Tamassia and Shawn Newsam and Goce Trajcevski and Goce Trajcevski",

booktitle = "GIS",

note = "25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017 ; Conference date: 07-11-2017 Through 10-11-2017",

}

TY - GEN

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

AU - Buchin, Kevin

AU - van Diggelen, Tom

AU - Diez, Yago

AU - Meulemans, Wouter

PY - 2017/11/7

Y1 - 2017/11/7

N2 - 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.

AB - 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.

KW - Fréchet distance

KW - Range searching

KW - Trajectories

UR - http://www.scopus.com/inward/record.url?scp=85040993242&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040993242&partnerID=8YFLogxK

U2 - 10.1145/3139958.3140064

DO - 10.1145/3139958.3140064

M3 - Conference contribution

AN - SCOPUS:85040993242

SN - 9781450354905

T3 - GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

BT - GIS

A2 - Ravada, Siva

A2 - Hoel, Erik

A2 - Tamassia, Roberto

A2 - Newsam, Shawn

A2 - Trajcevski, Goce

PB - Association for Computing Machinery

T2 - 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2017

Y2 - 7 November 2017 through 10 November 2017

ER -