3 citations · 4 across the 3 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2007
Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance
Kevin Buchin, Maike Buchin
We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Frechet distance. We show that the Voronoi diagram of n curves i…
cs.CG2007★ 1 cited
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Sergey Bereg, Marina Gavrilova, Binhai Zhu
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two p…
cs.CG2007★ 3 cited
Can we Compute the Similarity Between Surfaces?
Helmut Alt, Maike Buchin
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fréchet distance. Whereas efficient algorithms are known for computing the Fr…