Fréchet Distance for Uncertain Curves
From MaRDI portal
Publication:6051994
DOI10.1145/3597640arXiv2004.11862OpenAlexW3018982745MaRDI QIDQ6051994
No author found.
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.11862
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Removing local extrema from imprecise terrains
- Approximating the Fréchet distance for realistic curves in near linear time
- The directed Hausdorff distance between imprecise point sets
- Fréchet distance with speed limits
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Selecting and covering colored points
- Distance measures for point sets and their computation
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Nearest-neighbor searching under uncertainty. I
- On the Most Likely Convex Hull of Uncertain Points
- Tight Approximation Bounds for Connectivity with a Color-Spanning Set
- Flow computations on imprecise terrains
- [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition]
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Dynamic programming algorithm optimization for spoken word recognition
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Computing Visibility Information in an Inaccurate Simple Polygon
- Compact Flow Diagrams for State Sequences
- Computing the Fréchet Gap Distance
- Computing the Fréchet distance with shortcuts is NP-hard
- COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Nearest-Neighbor Searching Under Uncertainty II
- Global Curve Simplification
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
- Competitive query strategies for minimising the ply of the potential locations of moving points
- Fast Fréchet Distance Between Curves with Long Edges
- Geometric Computations on Indecisive Points
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
- Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
- Approximating (k, ℓ)-center clustering for curves
- Preprocessing Imprecise Points and Splitting Triangulations
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- The frechet distance revisited and extended
- Computing the Discrete Fréchet Distance in Subquadratic Time
- Largest and Smallest Tours and Convex Hulls for Imprecise Points
- Computing the Fréchet distance between uncertain curves in one dimension
- Uncertain Curve Simplification
