The Fréchet Distance Unleashed: Approximating a Dog with a Frog
Fuente:
arXiv
Saved in:
| Main Authors: | Har-Peled, Sariel, Raichel, Benjamin, Robson, Eliot W. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)
by: Har-Peled, Sariel, et al.
Published: (2014)
Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)
by: Har-Peled, Sariel, et al.
Published: (2023)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)
by: Har-Peled, Sariel
Published: (2011)
A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)
by: Har-Peled, Sariel, et al.
Published: (2019)
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)
by: Har-Peled, Sariel, et al.
Published: (2021)
Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)
by: Gao, Zhimeng, et al.
Published: (2023)
In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)
by: Ruggerio, Sam, et al.
Published: (2026)
Fréchet Edit Distance
by: Fox, Emily, et al.
Published: (2024)
by: Fox, Emily, et al.
Published: (2024)
Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)
by: Abam, Mohammad A., et al.
Published: (2025)
Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)
by: Dullerud, Jonathan E., et al.
Published: (2025)
Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)
by: Agarwal, Pankaj K., et al.
Published: (2023)
Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)
by: Giliberti, Jeff, et al.
Published: (2026)
An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Preprocessing Disks for Convex Hulls, Revisited
by: Löffler, Maarten, et al.
Published: (2025)
by: Löffler, Maarten, et al.
Published: (2025)
Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
by: Blank, Lotte, et al.
Published: (2025)
by: Blank, Lotte, et al.
Published: (2025)
On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)
by: Buchin, Kevin, et al.
Published: (2026)
Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)
by: van der Hoog, Ivor, et al.
Published: (2022)
On the Discrete Fréchet Distance in a Graph
by: Driemel, Anne, et al.
Published: (2022)
by: Driemel, Anne, et al.
Published: (2022)
Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)
by: van der Horst, Thijs, et al.
Published: (2024)
Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
by: Cheng, Siu-Wing, et al.
Published: (2025)
by: Cheng, Siu-Wing, et al.
Published: (2025)
Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)
by: Ashur, Stav, et al.
Published: (2025)
Discrete Fréchet Distance Oracles
by: Aronov, Boris, et al.
Published: (2024)
by: Aronov, Boris, et al.
Published: (2024)
Fréchet Distance in the Imbalanced Case
by: Blank, Lotte
Published: (2026)
by: Blank, Lotte
Published: (2026)
Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Fréchet Distance in Unweighted Planar Graphs
by: van der Hoog, Ivor, et al.
Published: (2025)
by: van der Hoog, Ivor, et al.
Published: (2025)
Similar Items
-
Well-Separated Pairs Decomposition Revisited
by: Har-Peled, Sariel, et al.
Published: (2025) -
The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025) -
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014) -
Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025) -
No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)