Computing the Fréchet distance between uncertain curves in one dimension

DOI10.1016/j.comgeo.2022.101923OpenAlexW3162102340WikidataQ114195434 ScholiaQ114195434MaRDI QIDQ5918556

No author found.

Publication date: 16 November 2022

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101923

zbMATH Keywords

uncertaintycurveshardnessFréchet distanceweak Fréchet distance

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Classical measure theory (28Axx) Computing methodologies and applications (68Uxx)

Related Items (1)

Fréchet Distance for Uncertain Curves

Cites Work

• Unnamed Item
• Approximating the Fréchet distance for realistic curves in near linear time
• The directed Hausdorff distance between imprecise point sets
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Tight Approximation Bounds for Connectivity with a Color-Spanning Set
• Constructing Street Networks from GPS Trajectories
• [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition]
• Approximability of the discrete Fréchet distance
• COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
• Preprocessing Imprecise Points and Splitting Triangulations
• 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

This page was built for publication: Computing the Fréchet distance between uncertain curves in one dimension