[LLIBRE][B] Encyclopedia of distances

E Deza, MM Deza, MM Deza, E Deza - 2009 - Springer
Encyclopedia of Distances is the result of re-writing and extending our Dictionary of
Distances published in 2006 (and put online http://www. sciencedirect. com/science/book …

Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails

K Bringmann - 2014 IEEE 55th Annual Symposium on …, 2014 - ieeexplore.ieee.org
The Fréchet distance is a well-studied and very popular measure of similarity of two curves.
Many variants and extensions have been studied since Alt and Godau introduced this …

Entanglement definitions for tethered robots: Exploration and analysis

G Battocletti, D Boskos, D Toliæ, I Palunko… - IEEE …, 2024 - ieeexplore.ieee.org
In this article we consider the problem of tether entanglement for tethered mobile robots.
One of the main risks of using a tethered connection between a mobile robot and an anchor …

Computational topology of graphs on surfaces

ÉC de Verdière - Handbook of Discrete and Computational …, 2017 - taylorfrancis.com
This chapter surveys computational topology results in the special, low-dimensional case
where the ambient space is a surface. Surface topology is very well-understood and …

Median trajectories

K Buchin, M Buchin, M Van Kreveld, M Löffler… - Algorithmica, 2013 - Springer
We investigate the concept of a median among a set of trajectories. We establish criteria that
a “median trajectory” should meet, and present two different methods to construct a median …

Four soviets walk the dog: Improved bounds for computing the Fréchet distance

K Buchin, M Buchin, W Meulemans… - Discrete & Computational …, 2017 - Springer
Given two polygonal curves in the plane, there are many ways to define a notion of similarity
between them. One popular measure is the Fréchet distance. Since it was proposed by Alt …

Tighter connections between formula-sat and shaving logs

A Abboud, K Bringmann - arxiv preprint arxiv:1804.08978, 2018 - arxiv.org
A noticeable fraction of Algorithms papers in the last few decades improve the running time
of well-known algorithms for fundamental problems by logarithmic factors. For example, the …

Four soviets walk the dog—With an application to Alt's conjecture

K Buchin, M Buchin, W Meulemans, W Mulzer - … of the twenty-fifth annual ACM …, 2014 - SIAM
Given two polygonal curves in the plane, there are many ways to define a notion of similarity
between them. One measure that is extremely popular is the Fréchet distance. Since it has …

[HTML][HTML] Towards topological geospatial conflation: An optimized node-arc conflation model for road networks

Z Lei, TL Lei - ISPRS International Journal of Geo-Information, 2023 - mdpi.com
Geospatial data conflation is the process of identifying and merging the corresponding
features in two datasets that represent the same objects in reality. Conflation is needed in a …

Parsimonious time series clustering using p-splines

C Iorio, G Frasso, A D'Ambrosio, R Siciliano - Expert Systems with …, 2016 - Elsevier
We introduce a parsimonious model-based framework for clustering time course data. In
these applications the computational burden becomes often an issue due to the large …