• Publications
  • Influence
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria
TLDR
This article is a revised and expanded version of a paper that appeared at ACM SIGSPATIAL 2010 [9]. Expand
  • 101
  • 7
  • PDF
Detecting Commuting Patterns by Clustering Subtrajectories
TLDR
We focus on the problem of detecting commuting patterns in a trajectory. Expand
  • 158
  • 6
  • PDF
Connect the dot: Computing feed-links for network extension
TLDR
This paper is a merged and expanded version of two conference papers that appeared at ACM SIGSPATIAL 2008 [3] and WADS 2009 [4]. Expand
  • 13
  • 5
  • PDF
Finding long and similar parts of trajectories
TLDR
We present a linear-time algorithm to find, for a piece-wise monotone function, an interval of at least a given length that has minimum average value. Expand
  • 69
  • 4
  • PDF
Exact algorithms for partial curve matching via the Fréchet distance
TLDR
We present the first exact algorithm that runs in polynomial time to compute fδ(P, Q), the partial Frechet similarity between P and Q, under the L1 and L∞ norms. Expand
  • 89
  • 3
  • PDF
Can We Compute the Similarity between Surfaces?
  • H. Alt, M. Buchin
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 2 March 2007
TLDR
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fréchet distance. Expand
  • 51
  • 3
  • PDF
Four Soviets Walk the Dog - with an Application to Alt's Conjecture
TLDR
We show how to break the quadratic barrier for the discrete version of the Frechet distance, where one considers sequences of points instead of polygonal curves. Expand
  • 62
  • 2
  • PDF
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
TLDR
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. Expand
  • 69
  • 2
Constrained free space diagrams: a tool for trajectory analysis
TLDR
We show how to leverage between the temporal and non-temporal approaches of curve analysis by extending a tool from curve analysis, namely the free space diagram. Expand
  • 59
  • 2
  • PDF
Computing the Fréchet distance between simple polygons
TLDR
We present the first polynomial-time algorithm for computing the Frechet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes. Expand
  • 47
  • 2
  • PDF
...
1
2
3
4
5
...