Graphs in metric spaces appear in a wide range of data sets, and there is a large body of
work focused on comparing, matching, or analyzing collections of graphs in different …

Comparing two road maps is a basic operation that arises in a variety of situations. A map
comparison method that is commonly used, mainly in the context of comparing reconstructed …

On Computing the Fréchet Distance Between Surfaces Schloss Dagstuhl - LZI - Logo
DROPS Series LIPIcs – Leibniz International Proceedings in Informatics OASIcs – Open …

Comparing two road maps is a basic operation that arises in a variety of situations. A map
comparison method that is commonly used, mainly in the context of comparing reconstructed …

In this paper we study similarity measures for moving curves which can, for example, model
changing coastlines or retreating glacier termini. Points on a moving curve have two …

The Frechet distance is often used to measure distances between paths, with applications in
areas ranging from map matching to GPS trajectory analysis to handwriting recognition …

Let gamma be a generic closed curve in the plane. The area of a homotopy is the area
swept by the homotopy. We consider the problem of computing the minimum null-homotopy …

We show that the Fréchet distance between two piecewise linear surfaces can be decided in
finite time, hence, the problem is decidable. For the special case that one of the surfaces is a …

Simplifying graphs is a very applicable problem in numerous domains, especially in
computational geometry. Given a geometric graph and a threshold, the minimum-complexity …

For a metric space Y, the Fréchet distance is a metric on trajectories f, g:[0, 1]→ Y that
minimizes max t∊[0, 1] dY (f (t), g (h (t))) over continuous reparameterizations h of time. One …