158 citations · 543 across the 80 of their papers we have counts for
4 papers · 2 filters
Output-Sensitive Tools for Range Searching in Higher Dimensions
Micha Sharir, Shai Zaban
Let be a set of points in . A point is \emph{-shallow} if it lies in a halfspace which contains at most points of (including ). We…
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)…
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage
Tal Kaminker, Micha Sharir
Let D be a set of n disks in the plane. We present a data structure of size O(n) that can compute, for any query point q, the largest disk in D that contains q, in O(log n) time. T…
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…