53 citations · 58 across the 3 of their papers we have counts for
3 papers
cs.CG2007★ 4 cited
Faster Algorithms for Rigidity in the Plane
Sergey Bereg
In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G=(V,E) with n vertices it run…
math.CO2007★ 53 cited
Compatible Geometric Matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu +10
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing.…
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…