28 citations · 244 across the 83 of their papers we have counts for
Showing 2013 · cs.CGShow all
2 papers · 2 filters
cs.CG2013
Union of Random Minkowski Sums and Network Vulnerability Analysis
Pankaj Agarwal, Sariel Har-Peled, Haim Kaplan +1
Let be a set of pairwise-disjoint convex sets of constant description complexity, and let be a probability density function (pdf for short)…
cs.CG2013★ 1 cited
The Discrete and Semi-continuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques
Rinat Ben Avraham, Omrit Filtser, Haim Kaplan +2
The \emph{Fréchet distance} is a well studied similarity measures between curves. The \emph{discrete Fréchet distance} is an analogous similarity measure, defined for a sequence $A…