arXiv subjects

Paul Accisano

Publications and source records attributed to Paul Accisano.

3 recordsLinked to original sources

arXiv2014

Finding a Curve in a Point Set

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 $\varepsilon$. 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.

cs.CG↗

arXiv2014

Matching Curves to Imprecise Point Sets using Fréchet Distance

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 the Fréchet distance from $P$ is less than a given $\varepsilon$. We consider eight variations of the problem based on the distance metric used and the omittability or repeatability of the points. We provide closure to a recent series of complexity results for the case where $S$ consists of precise points. More importantly, we formulate a more realistic version of the problem that takes into account measurement errors. This new problem is posed as the matching of a given curve to a set of imprecise points. We prove that all three variations of the problem that are in P when $S$ consists of precise points become NP-complete when $S$ consists of imprecise points. We also discuss approximation results.

cs.CG↗

arXiv2012

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

Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fréchet distance from $P$ is less than a given epsilon. We show that this problem is NP-complete, regardless of whether or not points from S are allowed be visited more than once. However, we also show that if the problem instance satisfies certain restrictions, the problem is polynomial-time solvable, and we briefly outline an algorithm that computes Q.

cs.CG↗