Computing the discrete Fréchet distance in subquadratic time

PK Agarwal, RB Avraham, H Kaplan, M Sharir - SIAM Journal on Computing, 2014 - SIAM
The Fréchet distance measures similarity between two curves f and g that takes into account
the ordering of the points along the two curves: Informally, it is the minimum length of a leash …

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 …

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 …

A systematic survey of point set distance measures for link discovery

M Ahmed Sherif, AC Ngonga Ngomo - Semantic Web, 2018 - content.iospress.com
Large amounts of geo-spatial information have been made available with the growth of the
Web of Data. While discovering links between resources on the Web of Data has been …

[PDF][PDF] Similarity measures and algorithms for cartographic schematization

W Meulemans - 2014 - research.tue.nl
A map is a visual representation of a geographic region, depicting a number of elements
and features of the region. Elements may be geographic in nature—roads, rivers, buildings …

Computing the Fréchet distance between real-valued surfaces

K Buchin, T Ophelders, B Speckmann - … of the Twenty-Eighth Annual ACM …, 2017 - SIAM
The Fréchet distance is a well-studied measure for the similarity of shapes. While efficient
algorithms for computing the Fréchet distance between curves exist, there are only few …

How to walk your dog in the mountains with no magic leash

S Har-Peled, A Nayyeri, M Salavatipour… - Proceedings of the …, 2012 - dl.acm.org
We describe a O (log n)-approximation algorithm for computing the homotopic Frechet
distance between two polygonal curves that lie on the boundary of a triangulated topological …

Computing the Fréchet distance between folded polygons

AF Cook IV, A Driemel, J Sherette, C Wenk - Computational Geometry, 2015 - Elsevier
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only
known polynomial-time algorithm is limited to computing it between flat surfaces. We study …

Bark beetle larval dynamics carved in the egg gallery: a study of mathematically reconstructing bark beetle tunnel maps

H Li, T Li - Advances in Difference Equations, 2019 - Springer
Scolytinae (bark beetle) is one of the most detrimental pests on the Chongming Island. It is
desirable to understand the behaviour of the Scolytinae throughout its life cycle. Behaviour …

[PDF][PDF] On computing the Fréchet distance between surfaces

A Nayyeri, H Xu - 32nd International Symposium on …, 2016 - drops.dagstuhl.de
Abstract We describe two (1+ epsilon)-approximation algorithms for computing the Fréchet
distance between two homeomorphic piecewise linear surfaces R and S of genus zero and …