Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Visiting All Sites with Your Dog (1211.4559v1)

Published 19 Nov 2012 in cs.CG

Abstract: Given a polygonal curve P, a pointset S, and an \epsilon > 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 \epsilon 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.