Tim Ophelders

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Relating interleaving and Fréchet distances via ordered merge trees
Journal of Computational Geometry
2026-03-17Paper
Shortest paths in portalgons2024-10-16Paper
A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance2024-05-14Paper
Minimum height drawings of ordered trees in polynomial time: homotopy height of tree duals2024-05-14Paper
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology
2023-12-16Paper
scientific article; zbMATH DE number 7765371 (Why is no real title available?)2023-11-14Paper
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science
2023-08-14Paper
Convex polygons in Cartesian products
(available as arXiv preprint)
2022-07-18Paper
Constructing monotone homotopies and sweepouts
Journal of Differential Geometry
2022-02-01Paper
Constructing monotone homotopies and sweepouts
Journal of Differential Geometry
2022-02-01Paper
Between shapes, using the Hausdorff distance
Computational Geometry
2021-12-15Paper
A note on equitable Hamiltonian cycles
Discrete Applied Mathematics
2021-09-15Paper
scientific article; zbMATH DE number 7324096 (Why is no real title available?)2021-03-17Paper
Homotopy height, grid-major height and graph-drawing height
(available as arXiv preprint)
2020-10-26Paper
Topological mapper for 3D volumetric images2020-06-15Paper
Computing optimal homotopies over a spiked plane with polygonal boundary2020-05-27Paper
Computing representative networks for braided rivers2020-01-13Paper
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-10-15Paper
The complexity of Snake and undirected NCL variants
Theoretical Computer Science
2018-11-23Paper
Computing the similarity between moving curves
Computational Geometry
2018-10-31Paper
scientific article; zbMATH DE number 6917067 (Why is no real title available?)2018-08-13Paper
Computing the Fréchet distance between real-valued surfaces
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
On the complexity of optimal homotopies2018-03-15Paper
On the complexity of optimal homotopies
(available as arXiv preprint)
2018-03-15Paper
The Complexity of Snake2017-07-17Paper
Constructing monotone homotopies and sweepouts
(available as arXiv preprint)
2017-04-20Paper
Computing the similarity between moving curves
Lecture Notes in Computer Science
2015-11-19Paper


Research outcomes over time


This page was built for person: Tim Ophelders