Related papers: Computing the Similarity Between Moving Curves
All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…
The discrete Fr{\'e}chet distance is a measure of similarity between point sequences which permits to abstract differences of resolution between the two curves, approximating the original Fr{\'e}chet distance between curves. Such distance…
Map matching is a common task when analysing GPS tracks, such as vehicle trajectories. The goal is to match a recorded noisy polygonal curve to a path on the map, usually represented as a geometric graph. The Fr\'echet distance is a…
Due to its many applications, \emph{curve simplification} is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information science, etc. Given a polygonal curve $P$ with $n$ vertices,…
The Frechet 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 Frechet distance a Frechet matching. There are often many different Frechet…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
A connection is established between the soliton equations and curves moving in a three dimensional space $V_{3}$. The sign of the self-interacting terms of the soliton equations are related to the signature of $V_{3}$. It is shown that…
Let $m$ and $n$ be the numbers of vertices of two polygonal curves in $\mathbb{R}^d$ for any fixed $d$ such that $m \leq n$. Since it was known in 1995 how to compute the Fr\'{e}chet distance of these two curves in $O(mn\log (mn))$ time, it…
We discuss two versions of the Fr\'echet 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…
The discrete Fr\'echet distance is a popular measure for comparing polygonal curves. An important variant is the discrete Fr\'echet distance under translation, which enables detection of similar movement patterns in different spatial…
We study the Dirichlet problem associated to the equation for self-similar surfaces for graphs over the Euclidean plane with a disk removed. We show the existence of a solution provided the boundary conditions on the boundary circle are…
We propose a two-dimensional flow model of a viscous fluid between two close moving surfaces. We show that its asymptotic behavior, when the distance between the two surfaces tends to zero, is the same as that of the the Navier-Stokes…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let $\mathcal{C}$ be a set of $n$ polygonal curves, each of size $m$. In the nearest-neighbor problem, the goal…
Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fr\'echet distance from $P$ is less than a given…
We consider a system of three surfaces, graphs over a bounded domain in ${\mathbb R}^2$, intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to…
A unifying moving mesh method is developed for general $m$-dimensional geometric objects in $d$-dimensions ($d \ge 1$ and $1\le m \le d$) including curves, surfaces, and domains. The method is based on mesh equidistribution and alignment…
Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…
We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain…
In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…