:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	van der Hoog, Ivor, Klute, Fabian, Parada, Irene, Schnider, Patrick
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2402.13159
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
by: Bertschinger, Daniel, et al.
Published: (2026)

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

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
by: Conradi, Jacobus, et al.
Published: (2025)

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

Computing crossing numbers with topological and geometric restrictions
by: Hamm, Thekla, et al.
Published: (2024)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Practical Insertion-Only Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024)

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

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

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)

Simpler and Faster Contiguous Art Gallery
by: de Berg, Sarita, et al.
Published: (2025)

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

Bounds for k-centers of point sets under $L_{\infty}$-bottleneck distance
by: Bierwirth, Mats, et al.
Published: (2025)

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

Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
by: de Berg, Sarita, et al.
Published: (2025)

Algorithms for Distance Problems in Continuous Graphs
by: Cabello, Sergio, et al.
Published: (2025)

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

Flagifying the Dowker Complex
by: Huber, Marius, et al.
Published: (2025)

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

Computing Enclosing Depth
by: Gärtner, Bernd, et al.
Published: (2024)

Chasing puppies on orthogonal straight-line plane graphs
by: Ockenfels, Johanna, et al.
Published: (2025)

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

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Unfairly Splitting Separable Necklaces
by: Schnider, Patrick, et al.
Published: (2024)

A faster algorithm for the Fréchet distance in 1D for the imbalanced case
by: Blank, Lotte, et al.
Published: (2024)

Query-Efficient Fixpoints of $\ell_p$-Contractions
by: Haslebacher, Sebastian, et al.
Published: (2025)

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

Flips in Odd Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

Approximating the Fréchet distance when only one curve is $c$-packed
by: Gudmundsson, Joachim, et al.
Published: (2024)

Map matching queries on realistic input graphs under the Fréchet distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Connected Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)