Name
Abstract | ||
|---|---|---|
In this paper, we introduce a new generalization of the well-known Frechet distance between two polygonal curves, and provide an efficient algorithm for computing it. The classical Frechet distance between two polygonal curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-negative speeds. Here, we consider a problem instance in which the speed of traversal along each segment of the curves is restricted to be within a specified range. We provide an efficient algorithm that decides in O(n^2logn) time whether the Frechet distance with speed limits between two polygonal curves is at most @e, where n is the number of segments in the curves, and @e=0 is an input parameter. We then use our solution to this decision problem to find the exact Frechet distance with speed limits in O(n^2log^2n) time. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.comgeo.2010.09.008 | Comput. Geom. |
Keywords | Field | DocType |
speed limit,frechet distance,fréchet distance,arbitrary non-negative speed,maximum distance,exact frechet distance,well-known frechet distance,classical frechet distance,efficient algorithm,polygonal curve,speed constraints,polygonal curves corresponds,decision problem | Discrete mathematics,Combinatorics,Polygon,Decision problem,Tree traversal,Fréchet distance,Mathematics,Traverse | Journal |
Volume | Issue | ISSN |
44 | 2 | Computational Geometry: Theory and Applications |
Citations | PageRank | References |
11 | 0.66 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anil Maheshwari | 1 | 869 | 104.47 |
| Jörg-Rüdiger Sack | 2 | 1099 | 166.07 |
| Kaveh Shahbaz | 3 | 33 | 3.45 |
| Hamid Zarrabi-Zadeh | 4 | 111 | 13.63 |