Saved in:
| Main Authors: | Gudmundsson, Joachim, Seybold, Martin P., Wong, Sampson |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2211.02951 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Approximating the Fréchet distance when only one curve is $c$-packed
by: Gudmundsson, Joachim, et al.
Published: (2024)
by: Gudmundsson, Joachim, et al.
Published: (2024)
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
by: Gudmundsson, Joachim, et al.
Published: (2022)
by: Gudmundsson, Joachim, et al.
Published: (2022)
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)
by: Gudmundsson, Joachim, et al.
Published: (2021)
A well-separated pair decomposition for low density graphs
by: Gudmundsson, Joachim, et al.
Published: (2024)
by: Gudmundsson, Joachim, et al.
Published: (2024)
Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
Linear time single-source shortest path algorithms in Euclidean graph classes
by: Gudmundsson, Joachim, et al.
Published: (2026)
by: Gudmundsson, Joachim, et al.
Published: (2026)
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)
by: Gudmundsson, Joachim, et al.
Published: (2021)
Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)
by: Buchin, Kevin, et al.
Published: (2025)
Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)
by: Gudmundsson, Joachim, et al.
Published: (2024)
A WSPD, Separator and Small Tree Cover for c-packed Graphs
by: Deryckere, Lindsey, et al.
Published: (2025)
by: Deryckere, Lindsey, et al.
Published: (2025)
Minimum Exposure Motion Planning
by: de Berg, Sarita, et al.
Published: (2026)
by: de Berg, Sarita, 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)
Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)
by: Buchin, Kevin, et al.
Published: (2023)
Barking dogs: A Fréchet distance variant for detour detection
by: van der Hoog, Ivor, et al.
Published: (2024)
by: van der Hoog, Ivor, et al.
Published: (2024)
On computing the (exact) Fréchet distance with a frog
by: Conradi, Jacobus, et al.
Published: (2025)
by: Conradi, Jacobus, et al.
Published: (2025)
Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
by: Brankovic, Milutin, et al.
Published: (2021)
by: Brankovic, Milutin, et al.
Published: (2021)
A faster algorithm for the Fréchet distance in 1D for the imbalanced case
by: Blank, Lotte, et al.
Published: (2024)
by: Blank, Lotte, et al.
Published: (2024)
Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
by: Buchin, Kevin, et al.
Published: (2025)
by: Buchin, Kevin, et al.
Published: (2025)
The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)
by: Alsaedi, Rusul J., et al.
Published: (2022)
Shortest Paths of Mutually Visible Robots
by: Alsaedi, Rusul J., et al.
Published: (2023)
by: Alsaedi, Rusul J., et al.
Published: (2023)
Pattern Formation for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2023)
by: Alsaedi, Rusul J., et al.
Published: (2023)
Pattern Formation for Fat Robots with Memory
by: Alsaedi, Rusul J., et al.
Published: (2023)
by: Alsaedi, Rusul J., et al.
Published: (2023)
Revisiting the Fréchet distance between piecewise smooth curves
by: Conradi, Jacobus, et al.
Published: (2024)
by: Conradi, Jacobus, et al.
Published: (2024)
A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)
by: de Berg, Sarita, et al.
Published: (2026)
Fréchet Edit Distance
by: Fox, Emily, et al.
Published: (2024)
by: Fox, Emily, et al.
Published: (2024)
A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
by: Buchin, Kevin, et al.
Published: (2026)
by: Buchin, Kevin, et al.
Published: (2026)
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)
On Fréchet Traveling Salesmen Problems
by: Filtser, Omrit, et al.
Published: (2026)
by: Filtser, Omrit, et al.
Published: (2026)
Property Testing of Curve Similarity
by: Afshani, Peyman, et al.
Published: (2025)
by: Afshani, Peyman, et al.
Published: (2025)
On the Discrete Fréchet Distance in a Graph
by: Driemel, Anne, et al.
Published: (2022)
by: Driemel, Anne, et al.
Published: (2022)
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)
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)
by: van Renssen, Andrè, et al.
Published: (2022)
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
by: Oles, Vladyslav, et al.
Published: (2019)
by: Oles, Vladyslav, et al.
Published: (2019)
Theoretical analysis of beaconless geocast protocols in 1D
by: Gudmundsson, Joachim, et al.
Published: (2025)
by: Gudmundsson, Joachim, et al.
Published: (2025)
Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)
by: de Berg, Sarita, et al.
Published: (2025)
Fréchet Distance in Subquadratic Time
by: Cheng, Siu-Wing, et al.
Published: (2024)
by: Cheng, Siu-Wing, et al.
Published: (2024)
Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Similar Items
-
Approximating the Fréchet distance when only one curve is $c$-packed
by: Gudmundsson, Joachim, et al.
Published: (2024) -
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
by: Gudmundsson, Joachim, et al.
Published: (2022) -
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021) -
A well-separated pair decomposition for low density graphs
by: Gudmundsson, Joachim, et al.
Published: (2024) -
Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)