Timothy M. Chan

activity

20242026

collaborators

Showing 2026Show all

4 papers · 1 filter

cs.CG2026

Shaving Two Logs for Discrete and Continuous Fréchet Distance

Timothy M Chan, Isaac M Hair

We revisit the classical computational geometry problem of computing the exact (discrete or continuous) Fréchet distance between two given polygonal curves with $n$ vertices in a c…

cs.CG2026

Computing Planar Convex Hulls with a Promise

Sepideh Aghamolaei, Kevin Buchin, Timothy M. Chan +5

Computing the convex hull of a planar $n$ -point set $P$ is one of the most fundamental problems in computational geometry. It has an $Ω (n lo g n)$ lower bound in the algebraic comp…

cs.CG2026

Delaunay Triangulations with Predictions

Sergio Cabello, Timothy M. Chan, Panos Giannopoulos

We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set $P$ of $n$ poi…

cs.DS2026

Derandomizing Pseudopolynomial Algorithms for Subset Sum

Timothy M. Chan

We reexamine the classical subset sum problem: given a set $X$ of $n$ positive integers and a number $t$ , decide whether there exists a subset of $X$ that sums to $t$ ; or more gene…