7 citations · 21 across the 12 of their papers we have counts for
5 papers · 1 filter
Fréchet Distance for Uncertain Curves
Kevin Buchin, Chenglin Fan, Maarten Löffler +3
In this paper we study a wide range of variants for computing the (discrete and continuous) Fréchet distance between uncertain curves. We define an uncertain curve as a sequence of…
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams
Chenglin Fan, Benjamin Raichel
While the standard unweighted Voronoi diagram in the plane has linear worst-case complexity, many of its natural generalizations do not. This paper considers two such previously st…
Metric Violation Distance: Revisited and Extended
Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk
Metric data plays an important role in various settings such as metric-based indexing, clustering, classification, and approximation algorithms in general. Due to measurement error…
Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input
Chenglin Fan, Binhai Zhu
We study the problem of computing the upper bound of the discrete Fréchet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in…
On the Chain Pair Simplification Problem
Chenglin Fan, Omrit Filtser, Matthew J. Katz +2
The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification…