Showing cs.CGShow all
3 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 vertices in a c…
cs.CG2025
A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
Timothy M. Chan, Isaac M. Hair
Given two convex polygons and with and edges, the maximum overlap problem is to find a translation of that maximizes the area of its intersection with . We g…
cs.CG2024
Convex Polygon Containment: Improving Quadratic to Near Linear Time
Timothy M. Chan, Isaac M. Hair
We revisit a standard polygon containment problem: given a convex -gon and a convex -gon in the plane, find a placement of inside under translation and rotati…