Approximately matching polygonal curves with respect to the Fréchet distance

DOI10.1016/j.comgeo.2004.05.004zbMath1066.65027OpenAlexW2093651920MaRDI QIDQ705548

Axel Mosig, Michael Clausen

Publication date: 31 January 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.05.004

zbMATH Keywords

time complexityFréchet distanceGeometric pattern matchingmatching polygonal curves

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Following a curve with the discrete Fréchet distance ⋮ Curve matching, time warping, and light fields: New algorithms for computing similarity between curves ⋮ Gromov-Fréchet distance between curves ⋮ Spectra of graphs attached to the space of melodies ⋮ Fast Fréchet queries ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ Unnamed Item ⋮ Discretely Following a Curve

Cites Work

• On computing a set of points meeting every cell defined by a family of polynomials on a variety
• Pattern matching for sets of segments
• Matching Shapes with a Reference Point
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• On the number of cells defined by a family of polynomials on a variety
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximately matching polygonal curves with respect to the Fréchet distance