3 citations · 4 across the 9 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CG2014
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…
cs.CG2014★ 3 cited
Intermittent Map Matching with the Discrete Fréchet Distance
Tim Wylie, Binhai Zhu
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal…