scientific article; zbMATH DE number 7238975
From MaRDI portal
Publication:5116484
DOI10.4230/LIPICS.SWAT.2018.20zbMATH Open1477.68468MaRDI QIDQ5116484FDOQ5116484
Authors: Omrit Filtser, Matthew J. Katz 
Publication date: 25 August 2020
Title of this publication is not available (Why is that?)
Recommendations
- Algorithms for the discrete Fréchet distance under translation
- Discrete Fréchet Distance under Translation
- An improved approximation algorithm for the discrete Fréchet distance
- Approximability of the discrete Fréchet distance
- Approximability of the discrete Fréchet distance
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Computing the discrete Fréchet distance in subquadratic time
- Computing the discrete Fréchet distance in subquadratic time
- Adaptive computation of the discrete Fréchet distance
- Translation invariant Fréchet distance queries
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A data structure for dynamic trees
- Maintenance of a minimum spanning forest in a dynamic plane graph
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Computing the discrete Fréchet distance in subquadratic time
- Approximately matching polygonal curves with respect to the Fréchet distance
- Title not available (Why is that?)
- Four Soviets walk the dog -- with an application to Alt's conjecture
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- On finding most uniform spanning trees
- Balanced optimization problems
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Title not available (Why is that?)
- Paths with minimum range and ratio of arc lengths
- Computing the Fréchet distance with shortcuts is NP-hard
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Cited In (9)
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances
- Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
- Translation invariant Fréchet distance queries
- Fréchet Distance for Uncertain Curves
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- Sampling-based bottleneck pathfinding with applications to Fréchet matching
- Computing the Fréchet gap distance
- Adaptive computation of the discrete Fréchet distance
- Algorithms for the discrete Fréchet distance under translation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116484)
