A subquadratic n^-approximation for the continuous Fréchet distance

DOI10.1137/1.9781611977554.CH67MaRDI QIDQ6538601zbMATH OpenFDO

Authors Thijs van der Horst, Marc Van Kreveld, Tim Ophelders, Bettina Speckmann

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH67

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Faster Fréchet distance approximation through truncated smoothing
• A faster algorithm for the Fréchet distance in 1D for the imbalanced case
• The geodesic Fréchet distance between two curves bounding a simple polygon
• Faster Fréchet distance under transformations

This page was built for publication: A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538601)