Finding a Curve in a Point Set

Abstract

Let $P$ be a polygonal curve in ${\mathbb{R}}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fréchet distance from $P$ is less than a given $\epsilon$. In this paper, we consider this problem with the added freedom to transform the input curve $P$ by translating it, rotating it, or applying an arbitrary affine transform. We present exact and approximation algorithms for several variations of this problem.

References in corpus (1)

• Hardness Results on Curve/Point Set Matching with Fréchet Distance