Jacobus Conradi

Orcid: 0000-0002-8259-1187

According to our database1, Jacobus Conradi authored at least 23 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Computing Planar Convex Hulls with a Promise.
CoRR, May, 2026

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves.
CoRR, April, 2026

On Small Pair Decompositions for Point Sets.
CoRR, January, 2026

Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance (CG Challenge).
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

On Computing the (Exact) Fréchet Distance with a Frog.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
The Contiguous Art Gallery Problem is in Θ(n log n).
CoRR, November, 2025

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

Simpler and Faster Contiguous Art Gallery.
CoRR, August, 2025


Computing Non-Obtuse Triangulations with Few Steiner Points.
CoRR, May, 2025

Revisiting the Fréchet distance between piecewise smooth curves.
Comput. Geom., 2025

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

Computing Non-Obtuse Triangulations with Few Steiner Points (CG Challenge).
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
On Computing the <i>k</i>-Shortcut Fréchet Distance.
ACM Trans. Algorithms, October, 2024

(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension.
Comput. Geom. Topol., 2024

Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Finding Complex Patterns in Trajectory Data via Geometric Set Cover.
CoRR, 2023

Learning Depth Vision-Based Personalized Robot Navigation From Dynamic Demonstrations in Virtual Reality.
IROS, 2023

2022
On Computing the k-Shortcut Fréchet Distance.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Faster Approximate Covering of Subcurves Under the Fréchet Distance.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022


  Loading...