Abstract
Given a polygonal curve P, a pointset S, and an ε> 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to εto curve P. In this problem, Q must visit every point in S and we are allowed to reuse points of pointset in building Q. First, we show that this problem in NP-Complete. Then, we present a polynomial time algorithm for a special cases of this problem, when P is a convex polygon.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.