activity
20232025
collaborators

7 papers

cs.CG2025

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time

Siu-Wing Cheng, Haoqiang Huang, Shuo Zhang

Let and be two polygonal curves in for any fixed . Suppose that and have and vertices, respectively, and . While conditional lower…

cs.CG2025

Simplification of Trajectory Streams

Siu-Wing Cheng, Haoqiang Huang, Le Jiang

While there are software systems that simplify trajectory streams on the fly, few curve simplification algorithms with quality guarantees fit the streaming requirements. We present…

cs.CG2024

Fréchet Distance in Subquadratic Time

Siu-Wing Cheng, Haoqiang Huang

Let and be the numbers of vertices of two polygonal curves in for any fixed such that . Since it was known in 1995 how to compute the Fréchet d…

cs.CG2023

Geometric Matching and Bottleneck Problems

Sergio Cabello, Siu-Wing Cheng, Otfried Cheong +1

Let be a set of at most points and let be a set of at most geometric ranges, such as for example disks or rectangles, where each has an associated supply…

cs.CG2023

Solving Fréchet Distance Problems by Algebraic Geometric Methods

Siu-Wing Cheng, Haoqiang Huang

We study several polygonal curve problems under the Fréchet distance via algebraic geometric methods. Let and be the spaces of all polygonal curve…

cs.CG2023

Solving Proximity Problems for Polygonal Shapes via Polynomials

Frederik Brüning, Siu-Wing Cheng, Anne Driemel +1

We study range spaces, where the ground set consists of either polygonal curves in or polygonal regions in the plane that may contain holes and the ranges are balls…

cs.CG2023

Approximate Nearest Neighbor for Polygonal Curves under Fréchet Distance

Siu-Wing Cheng, Haoqiang Huang

We propose -approximate nearest neighbor (ANN) data structures for polygonal curves under the Fréchet distance in , where $κ\in \{1+\varepsilon,3+\varepsilon\}…