Fast Fréchet Distance Between Curves with Long Edges

DOI10.1142/S0218195919500043zbMath1430.68373arXiv1710.10521MaRDI QIDQ5197493

Carola Wenk, Ali Mohades, Joachim Gudmundsson, Majid Mirzanezhad

Publication date: 24 September 2019

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.10521

zbMATH Keywords

approximation algorithmFréchet distancedata structure

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

Translation invariant Fréchet distance queries ⋮ Fréchet Distance for Uncertain Curves

Cites Work

• Approximating the Fréchet distance for realistic curves in near linear time
• Hierarchical decompositions and circular ray shooting in simple polygons
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Comparison of distance measures for planar curves
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Fréchet Queries in Geometric Trees
• Approximability of the discrete Fréchet distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Fréchet Distance for Curves, Revisited
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: Fast Fréchet Distance Between Curves with Long Edges