scientific article; zbMATH DE number 7238975
From MaRDI portal
Publication:5116484
DOI10.4230/LIPICS.SWAT.2018.20zbMATH Open1477.68468MaRDI QIDQ5116484FDOQ5116484
Matthew J. Katz, Omrit Filtser
Publication date: 25 August 2020
Title of this publication is not available (Why is that?)
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- 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 (5)
Recommendations
- Title not available (Why is that?) 👍 👎
- Computing the Discrete Fréchet Distance in Subquadratic Time 👍 👎
- Approximability of the discrete Fréchet distance 👍 👎
- Adaptive computation of the discrete Fréchet distance 👍 👎
- Algorithms for the discrete Fréchet distance under translation 👍 👎
- An improved approximation algorithm for the discrete Fréchet distance 👍 👎
- Translation invariant Fréchet distance queries 👍 👎
- Discrete Fréchet Distance under Translation 👍 👎
- When Lipschitz Walks Your Dog: Algorithm Engineering of 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)