Tim Ophelders

Orcid: 0000-0002-9570-024X

According to our database1, Tim Ophelders authored at least 35 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Faster and Deterministic Subtrajectory Clustering.
CoRR, 2024

The Complexity of Geodesic Spanners using Steiner Points.
CoRR, 2024

Faster Fréchet Distance Approximation through Truncated Smoothing.
CoRR, 2024

2023
Optimal In-Place Compaction of Sliding Cubes.
CoRR, 2023

A Monotone Interleaving Distance for Merge Trees.
CoRR, 2023

Simply Realising an Imprecise Polyline is NP-hard.
CoRR, 2023

Computing the Fréchet distance between uncertain curves in one dimension.
Comput. Geom., 2023

Morphing Planar Graph Drawings Through 3D.
Comput. Geom. Topol., 2023

A Subquadratic <i>n</i><sup>ε</sup>-approximation for the Continuous Fréchet Distance.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Shortest Paths in Portalgons.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
A Subquadratic n<sup>ε</sup>-approximation for the Continuous Fréchet Distance.
CoRR, 2022

Between shapes, using the Hausdorff distance.
Comput. Geom., 2022

Efficient Fréchet Distance Queries for Segments.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
A note on equitable Hamiltonian cycles.
Discret. Appl. Math., 2021

Volume from Outlines on Terrains.
Proceedings of the 11th International Conference on Geographic Information Science, 2021

Polygon-Universal Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

A Family of Metrics from the Truncated Smoothing of Reeb Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Convex polygons in cartesian products.
J. Comput. Geom., 2020

Automatic Tree Ring Detection using Jacobi Sets.
CoRR, 2020

Route-preserving Road Network Generalization.
Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

Planar Emulators for Monge Matrices.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Computing representative networks for braided rivers.
J. Comput. Geom., 2019

SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Topological Mapper for 3D Volumetric Images.
Proceedings of the Mathematical Morphology and Its Applications to Signal and Image Processing, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
The complexity of snake and undirected NCL variants.
Theor. Comput. Sci., 2018

Computing the similarity between moving curves.
Comput. Geom., 2018

On the complexity of optimal homotopies.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Volume-based similarity of linear features on terrains.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017
Visual analytics of delays and interaction in movement data.
Int. J. Geogr. Inf. Sci., 2017

Computing the Fréchet Distance between Real-Valued Surfaces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Data Structures for Fréchet Queries in Trajectory Data.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
The Complexity of Snake.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016


  Loading...