Paul Accisano

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

7 citations · 9 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2014★ 2 cited

Finding a Curve in a Point Set

Paul Accisano, Alper Üngör

Let $P$ be a polygonal curve in $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…

cs.CG2014

Matching Curves to Imprecise Point Sets using Fréchet Distance

Paul Accisano, Alper Üngör

Let $P$ be a polygonal curve in $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…

cs.CG2012★ 7 cited

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

Paul Accisano, Alper Üngör

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…