The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Geodesic Fréchet Distance Inside a Simple Polygon
[article]
2008
arXiv
pre-print
We unveil an alluring alternative to parametric search that applies to both the non-geodesic and geodesic Fréchet optimization problems. This randomized approach is based on a variant of red-blue intersections and is appealing due to its elegance and practical efficiency when compared to parametric search. We present the first algorithm for the geodesic Fréchet distance between two polygonal curves A and B inside a simple bounding polygon P. The geodesic Fréchet decision problem is solved
arXiv:0802.2846v1
fatcat:l2n3oybxu5hplcra4teqzrx5sq