Related papers: Closed Curves and Elementary Visual Object Identif…
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…
Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.
In the first part of this thesis, we consider an instance of Frechet distance problem in which the speed of traversal along each segment of the curves is restricted to be within a specfied range. This setting is more realistic than the…
We introduce an orientation-preserving landmark-based distance for continuous curves, which can be viewed as an alternative to the \Frechet or Dynamic Time Warping distances. This measure retains many of the properties of those measures,…
Modern time series analysis requires the ability to handle datasets that are inherently high-dimensional; examples include applications in climatology, where measurements from numerous sensors must be taken into account, or inventory…
The Fr\'echet distance is a popular measure of dissimilarity for polygonal curves. It is defined as a min-max formulation that considers all direction-preserving continuous bijections of the two curves. Because of its susceptibility to…
The paper is devoted to differential geometric invariants determining a Frenet curve in up to a direct similarity These invariants can be presented by the Euclidean curvatures in terms of an arc lengths of the spherical indicatrices. Then,…
It is unlikely that the discrete Fr\'echet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to…
In many domains where data are represented as graphs, learning a similarity metric among graphs is considered a key problem, which can further facilitate various learning tasks, such as classification, clustering, and similarity search.…
We show by reduction from the Orthogonal Vectors problem that algorithms with strongly subquadratic running time cannot approximate the Fr\'echet distance between curves better than a factor $3$ unless SETH fails. We show that similar…
The distance on a set is a comparative function. The smaller the distance between two elements of that set, the closer, or more similar, those elements are. Fr\'echet axiomatized the distance into what is today known as a metric. In this…
This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…
The Fr\'{e}chet distance is a popular distance measure between curves $P$ and $Q$. Conditional lower bounds prohibit $(1 + \varepsilon)$-approximate Fr\'{e}chet distance computations in strongly subquadratic time, even when preprocessing…
The paper presents a discrete variation of the Frechet distance between closed curves, which can be seen as an approximation of the continuous measure. A rather straightforward approach to compute the discrete Frechet distance between two…
We prove that the length difference between a closed periodic curve and its parallel curve at a sufficiently small distance is proportional to the rotation index. As an application, the rotation index of a curve could be estimated by means…
The Fr\'{e}chet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of outliers. Since the presence of outliers is a frequently…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We introduce the notion of curvature parameters for singular plane curves with finite multiplicities and define the notion of curvatures for them. We then provide criteria to determine their singularity types for A-simple singularities. As…
We introduce the discrete Fr\'echet gap and its variants as an alternative measure of similarity between polygonal curves. We believe that for some applications the new measure (and its variants) may better reflect our intuitive notion of…