Computing the Fréchet distance between uncertain curves in one dimension
From MaRDI portal
Publication:5896889
DOI10.1007/978-3-030-83508-8_18OpenAlexW3194618699MaRDI QIDQ5896889FDOQ5896889
Author name not available (Why is that?)
Publication date: 25 March 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09922
Cites Work
- Title not available (Why is that?)
- 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
- Approximability of the discrete Fréchet distance
- Approximating the Fréchet distance for realistic curves in near linear time
- The frechet distance revisited and extended
- Preprocessing Imprecise Points and Splitting Triangulations
- The directed Hausdorff distance between imprecise point sets
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Tight Approximation Bounds for Connectivity with a Color-Spanning Set
- Largest and Smallest Tours and Convex Hulls for Imprecise Points
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Constructing Street Networks from GPS Trajectories
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
This page was built for publication: Computing the Fréchet distance between uncertain curves in one dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896889)
