Fr\'echet Distance for Offline Evaluation of Information Retrieval Systems with Sparse Labels
The rapid advancement of natural language processing, information retrieval (IR), computer
vision, and other technologies has presented significant challenges in evaluating the …
vision, and other technologies has presented significant challenges in evaluating the …
An efficient query algorithm for trajectory similarity based on Fréchet distance threshold
N Guo, M Ma, W **ong, L Chen, N **g - ISPRS International Journal of …, 2017 - mdpi.com
The processing and analysis of trajectories are the core of many location-based applications
and services, while trajectory similarity is an essential concept regularly used. To address …
and services, while trajectory similarity is an essential concept regularly used. To address …
The k-Fréchet distance: How to walk your dog while teleporting
We introduce a new distance measure for comparing polygonal chains: the k-Fréchet
distance. As the name implies, it is closely related to the well-studied Fréchet distance but …
distance. As the name implies, it is closely related to the well-studied Fréchet distance but …
Minimizing walking length in map matching
In this paper, we propose a geometric algorithm for a map matching problem. More
specifically, we are given a planar graph, H, with a straight-line embedding in a plane, a …
specifically, we are given a planar graph, H, with a straight-line embedding in a plane, a …
[PDF][PDF] The k-Fréchet distance revisited and extended
We recently introduced a new distance measure for polygonal curves, the k-Fréchet
distance. It bridges between Hausdorff distance and weak Fréchet distance, and allows us to …
distance. It bridges between Hausdorff distance and weak Fréchet distance, and allows us to …
[HTML][HTML] Weighted minimum backward Fréchet distance
The minimum backward Fréchet distance (MBFD) problem is a natural optimization problem
for the weak Fréchet distance, a variant of the well-known Fréchet distance. In this problem …
for the weak Fréchet distance, a variant of the well-known Fréchet distance. In this problem …
The -Fr\'echet distance
We introduce a new distance measure for comparing polygonal chains: the $ k $-Fr\'echet
distance. As the name implies, it is closely related to the well-studied Fr\'echet distance but …
distance. As the name implies, it is closely related to the well-studied Fr\'echet distance but …
On distance measures for polygonal curves bridging between Hausdorff and Fréchet distance
L Ryvkin - 2021 - hss-opus.ub.ruhr-uni-bochum.de
Hausdorff and Fréchet distance are popular means to compare point sets, curves, and
higher dimensional objects. We introduce the\(\textit {cut distance}\) and the\(\textit {cover …
higher dimensional objects. We introduce the\(\textit {cut distance}\) and the\(\textit {cover …
The prefix Fréchet similarity
C Scheffer - Computational Geometry, 2022 - Elsevier
We present the prefix Fréchet similarity as a new measure for similarity of curves which is for
instance motivated by evacuation analysis and defined as follows. Given two (polygonal) …
instance motivated by evacuation analysis and defined as follows. Given two (polygonal) …
Discrete Geometric Path Analysis in Computational Geometry
A Gheibi - 2016 - repository.library.carleton.ca
In this thesis, first, we study the weighted region problem (WRP), which is to compute a
geometric shortest path on a weighted partitioning of a plane. Recent results show that WRP …
geometric shortest path on a weighted partitioning of a plane. Recent results show that WRP …