252 citations · 334 across the 5 of their papers we have counts for
7 papers
A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories
Joachim Gudmundsson, Michael Horton, John Pfeifer +1
We present a scalable approach for range and nearest neighbor queries under computationally expensive metrics, like the continuous Fréchet distance on trajectory data. Based on…
On beta-Plurality Points in Spatial Voting Games
Boris Aronov, Mark de Berg, Joachim Gudmundsson +1
Let be a set of points in , called voters. A point is a plurality point for when the following holds: for every the…
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Boris Aronov, Omrit Filtser, Michael Horton +2
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let be a set of polygonal curves,…
Approximating -center clustering for curves
Kevin Buchin, Anne Driemel, Joachim Gudmundsson +4
The Euclidean -center problem is a classical problem that has been extensively studied in computer science. Given a set of points in Euclidean space, the probl…
Spatio-Temporal Analysis of Team Sports -- A Survey
Joachim Gudmundsson, Michael Horton
Team-based invasion sports such as football, basketball and hockey are similar in the sense that the players are able to move freely around the playing area; and that player and te…
Compact Flow Diagrams for State Sequences
Kevin Buchin, Maike Buchin, Joachim Gudmundsson +2
We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representatio…
Classification of Passes in Football Matches using Spatiotemporal Data
Michael Horton, Joachim Gudmundsson, Sanjay Chawla +1
A knowledgeable observer of a game of football (soccer) can make a subjective evaluation of the quality of passes made between players during the game. We investigate the problem o…