Locally correct Fréchet matchings

K. Buchin; M. Buchin; W. Meulemans; B. Speckmann

Locally correct Fréchet matchings

K. Buchin
, M. Buchin
, W. Meulemans
, B. Speckmann

Research output: Contribution to conference › Paper › Academic

284 Downloads (Pure)

Abstract

The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to "natural" matchings and to this end introduce locally correct Fréchet matchings. We prove that at least one such a matching exists for two polygonal curves and give an algorithm to compute it.

Original language	English
Pages	81-84
Number of pages	4
Publication status	Published - 2012
Event	30th European Workshop on Computational Geometry (EuroCG 2012) - Assisi, Italy Duration: 19 Mar 2012 → 21 Mar 2012 Conference number: 30

Conference

Conference	30th European Workshop on Computational Geometry (EuroCG 2012)
Abbreviated title	EuroCG 2012
Country/Territory	Italy
City	Assisi
Period	19/03/12 → 21/03/12

Access to Document

publishers versionFinal published version, 164 KB

Cite this

@conference{21e6becfd69548a2bd586be683cab816,

title = "Locally correct Fr{\'e}chet matchings",

abstract = "The Fr{\'e}chet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fr{\'e}chet distance a Fr{\'e}chet matching. There are often many different Fr{\'e}chet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fr{\'e}chet matchings to {"}natural{"} matchings and to this end introduce locally correct Fr{\'e}chet matchings. We prove that at least one such a matching exists for two polygonal curves and give an algorithm to compute it.",

author = "K. Buchin and M. Buchin and W. Meulemans and B. Speckmann",

year = "2012",

language = "English",

pages = "81--84",

note = "30th European Workshop on Computational Geometry (EuroCG 2012), EuroCG 2012 ; Conference date: 19-03-2012 Through 21-03-2012",

}

TY - CONF

T1 - Locally correct Fréchet matchings

AU - Buchin, K.

AU - Buchin, M.

AU - Meulemans, W.

AU - Speckmann, B.

N1 - Conference code: 30

PY - 2012

Y1 - 2012

N2 - The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to "natural" matchings and to this end introduce locally correct Fréchet matchings. We prove that at least one such a matching exists for two polygonal curves and give an algorithm to compute it.

AB - The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to "natural" matchings and to this end introduce locally correct Fréchet matchings. We prove that at least one such a matching exists for two polygonal curves and give an algorithm to compute it.

M3 - Paper

SP - 81

EP - 84

T2 - 30th European Workshop on Computational Geometry (EuroCG 2012)

Y2 - 19 March 2012 through 21 March 2012

ER -

Locally correct Fréchet matchings

Abstract

Conference

Access to Document

Fingerprint

Cite this