Thijs van der Horst

According to our database, Thijs van der Horst authored at least 16 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Reconfiguration of Squares Using a Constant Number of Moves Each.

Thijs van der Horst, Maarten Löffler, Tim Ophelders, Tom Peters

CoRR, March, 2026

Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm.

Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst, Tim Ophelders

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025

Computing the Fréchet Distance When Just One Curve is <i>c</i>-Packed: A Simple Almost-Tight Algorithm.

Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst, Tim Ophelders

CoRR, August, 2025

A near-linear time exact algorithm for the L₁-geodesic Fréchet distance between two curves on the boundary of a simple polygon.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

CoRR, April, 2025

A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Faster, Deterministic and Space Efficient Subtrajectory Clustering.

Ivor van der Hoog, Thijs van der Horst, Tim Ophelders

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Fréchet Distance in Unweighted Planar Graphs.

Ivor van der Hoog, Thijs van der Horst, Eva Rotenberg, Lasse Wulf

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Faster Fréchet distance approximation through truncated smoothing.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

J. Comput. Geom., 2024

Faster and Deterministic Subtrajectory Clustering.

Ivor van der Hoog, Thijs van der Horst, Tim Ophelders

CoRR, 2024

Robust Bichromatic Classification Using Two Lines.

Erwin Glazenburg, Thijs van der Horst, Tom Peters, Bettina Speckmann, Frank Staals

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Faster Fréchet Distance Approximation Through Truncated Smoothing.

Thijs van der Horst, Tim Ophelders

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Simply Realising an Imprecise Polyline is NP-hard.

Thijs van der Horst, Tim Ophelders, Bart van der Steenhoven

CoRR, 2023

A Subquadratic <i>n</i>^ε-approximation for the Continuous Fréchet Distance.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

A Subquadratic n^ε-approximation for the Continuous Fréchet Distance.

Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann

CoRR, 2022

Chromatic k-Nearest Neighbor Queries.

Thijs van der Horst, Maarten Löffler, Frank Staals

Proceedings of the 30th Annual European Symposium on Algorithms, 2022