Progress in Spatial Data Handling 2006
DOI: 10.1007/3-540-35589-8_25
|View full text |Cite
|
Sign up to set email alerts
|

Coastline Matching Process Based on the Discrete Fréchet Distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0
3

Year Published

2007
2007
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(23 citation statements)
references
References 7 publications
0
20
0
3
Order By: Relevance
“…Considering the nature of flight trajectories, the discrete Fréchet distance as defined in Eiter and Mannila (), which is a computationally efficient approximation to the Fréchet distance, is used in the present study. Following the methodology described in Mascret et al (), for a given pair of trajectories L 1 and L 2 with n and m waypoints, respectively, a Fréchet matrix M F of size n × m is computed with its element defined as follows: MF()i,j=max()centerdE()L1()i,L2()jcentermin()centerMF()i1,jcenterMF()i,j1centerMF()i1,j1 where 1 ≤ i ≤ n , 1 ≤ j ≤ m and d E ( L 1 ( i ), L 2 ( j )) denotes the Euclidean distance between the i th waypoint on L 1 and j th waypoint on L 2 . After iterating through all the possible combinations of i and j , the discrete Fréchet distance d Fd between L 1 and L 2 is given by the last element in M F , that is, M F ( n , m ).…”
Section: Methodsmentioning
confidence: 99%
“…Considering the nature of flight trajectories, the discrete Fréchet distance as defined in Eiter and Mannila (), which is a computationally efficient approximation to the Fréchet distance, is used in the present study. Following the methodology described in Mascret et al (), for a given pair of trajectories L 1 and L 2 with n and m waypoints, respectively, a Fréchet matrix M F of size n × m is computed with its element defined as follows: MF()i,j=max()centerdE()L1()i,L2()jcentermin()centerMF()i1,jcenterMF()i,j1centerMF()i1,j1 where 1 ≤ i ≤ n , 1 ≤ j ≤ m and d E ( L 1 ( i ), L 2 ( j )) denotes the Euclidean distance between the i th waypoint on L 1 and j th waypoint on L 2 . After iterating through all the possible combinations of i and j , the discrete Fréchet distance d Fd between L 1 and L 2 is given by the last element in M F , that is, M F ( n , m ).…”
Section: Methodsmentioning
confidence: 99%
“…In the matching of the same type patterns (event 1), the similarity can be measured by distances like nearest distance, Hausdorff distance, and Fréchet distance (Alt and Godau 1995;Mascret et al 2006). In the matching of the same type patterns (event 1), the similarity can be measured by distances like nearest distance, Hausdorff distance, and Fréchet distance (Alt and Godau 1995;Mascret et al 2006).…”
Section: Methods For Automatic Matching Processmentioning
confidence: 99%
“…Other distances between lines may be defined to go further. Measures based on the Fréchet distance are for example particularly pertinent to compare very sinuous lines like coastlines [1], [8], [15], but detailing these measures is out of the scope of this paper.…”
Section: Comparing Geometries Of Nodes and Arcsmentioning
confidence: 99%