scientific article; zbMATH DE number 7238975

DOI10.4230/LIPIcs.SWAT.2018.20zbMath1477.68468MaRDI QIDQ5116484

Omrit Filtser, Matthew J. Katz

Publication date: 25 August 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmstranslationcurve similaritydiscrete Fréchet distanceBOP

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Fréchet Distance for Uncertain Curves ⋮ Computing the Fréchet gap distance

Cites Work

• Unnamed Item
• Unnamed Item
• Approximately matching polygonal curves with respect to the Fréchet distance
• Balanced optimization problems
• On finding most uniform spanning trees
• Paths with minimum range and ratio of arc lengths
• A data structure for dynamic trees
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
• Maintenance of a minimum spanning forest in a dynamic plane graph
• Computing the Fréchet distance with shortcuts is NP-hard
• The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Four Soviets Walk the Dog—with an Application to Alt's Conjecture
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: