Imagen de Portada

Data Structures for Approximate Discrete Fréchet Distance

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	van der Hoog, Ivor, Rotenberg, Eva, Wong, Sampson
Formato:	Preprint
Publicado:	2022
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
por: Conradi, Jacobus, et al.
Publicado: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
por: Gæde, Emil Toftegaard, et al.
Publicado: (2025)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2025)

On the Discrete Fréchet Distance in a Graph
por: Driemel, Anne, et al.
Publicado: (2022)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

Fréchet Distance in Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2024)

The Presort Hierarchy for Geometric Problems
por: van der Hoog, Ivor, et al.
Publicado: (2026)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
por: Gudmundsson, Joachim, et al.
Publicado: (2022)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
por: Beurskens, Thijs, et al.
Publicado: (2023)

Spanner for the $0/1/\infty$ weighted region problem
por: Gudmundsson, Joachim, et al.
Publicado: (2024)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Fréchet Distance in Unweighted Planar Graphs
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
por: van Wijland, Ernest, et al.
Publicado: (2023)

Approximate Algorithms for Chamfer Distance Under Translation
por: Halevi, Gil, et al.
Publicado: (2026)

On Approximating the Dynamic and Discrete Network Flow Problem
por: Manna, Bubai, et al.
Publicado: (2024)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
por: Kar, Debajyoti, et al.
Publicado: (2026)

Distance Approximating Minors for Planar and Minor-Free Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
por: Abbasi, Fateme, et al.
Publicado: (2023)

Even Faster Algorithm for the Chamfer Distance
por: Feng, Ying, et al.
Publicado: (2025)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

On the Complexity of the Ordered Covering Problem in Distance Geometry
por: Souza, Michael, et al.
Publicado: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
por: Greenhut, Daniel, et al.
Publicado: (2025)

Parameterized Approximation of Rectangle Stabbing
por: Chu, Huairui, et al.
Publicado: (2026)

Optimal Trajectories in Discrete Space with Acceleration Constraints
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)