FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS
Yam Ki Cheung, Ovidiu Daescu · Discrete Mathematics Algorithms and Applications · 2010
We discuss two versions of the Fréchet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases, we give algorithms for finding a (1 + ∊)-factor approximation of the Fréchet distance between two polygonal curves. We also consider the Fréchet distance between two polygonal curves among polyhedral obstacles in [Formula: see text] (1/∞ weighted region problem) and present a (1 + ∊)-factor approximation algorithm.