Following a curve with the discrete Fréchet distance

DOI10.1016/j.tcs.2014.06.026zbMath1338.68272OpenAlexW1985300487MaRDI QIDQ300222

Tim Wylie, Binhai Zhu

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.026

zbMATH Keywords

Fréchet distancecurve similaritycurve/point-set matchingpolygonal curveset-chain matching

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance ⋮ Fréchet distance between two point sets ⋮ Weighted minimum backward Fréchet distance

Cites Work

• Unit disk cover problem in 2D
• Improved results on geometric hitting set problems
• Approximately matching polygonal curves with respect to the Fréchet distance
• Discretely Following a Curve
• On the Discrete Unit Disk Cover Problem
• Planar Formulae and Their Uses
• The Problem of Compatible Representatives
• Matching planar maps
• COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: Following a curve with the discrete Fréchet distance