96 citations · 442 across the 64 of their papers we have counts for
Showing 2014 · cs.CGShow all
3 papers · 2 filters
cs.CG2014
Improved approximation for Fréchet distance on c-packed curves matching conditional lower bounds
Karl Bringmann, Marvin Künnemann
The Fréchet distance is a well-studied and very popular measure of similarity of two curves. The best known algorithms have quadratic time complexity, which has recently been shown…
cs.CG2014★ 29 cited
Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails
Karl Bringmann
The Frechet distance is a well-studied and very popular measure of similarity of two curves. Many variants and extensions have been studied since Alt and Godau introduced this meas…
cs.CG2014
Counting Triangulations and other Crossing-Free Structures Approximately
Victor Alvarez, Karl Bringmann, Saurabh Ray +1
We consider the problem of counting straight-edge triangulations of a given set of points in the plane. Until very recently it was not known whether the exact number of tri…