28 citations · 244 across the 83 of their papers we have counts for
30 papers · 1 filter
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
Haim Kaplan, Matthew J. Katz, Rachel Saban +1
We study the reverse shortest path problem on disk graphs in the plane. In this problem we consider the proximity graph of a set of disks in the plane of arbitrary radii: In th…
Insertion-Only Dynamic Connectivity in General Disk Graphs
Haim Kaplan, Katharina Klost, Kristin Knorr +2
Let be a set of \emph{sites} in the plane, so that every site has an \emph{associated radius} . Let be the \emph{disk inter…
Dynamic Connectivity in Disk Graphs
Alexander Baumann, Haim Kaplan, Katharina Klost +4
Let be a set of sites in the plane, so that every site has an associated radius . Let be the disk intersection graph defined by , i.e…
Duality-based approximation algorithms for depth queries and maximum depth
Dror Aiger, Haim Kaplan, Micha Sharir
We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement of a collection of halfplane…
Output sensitive algorithms for approximate incidences and their applications
Dror Aiger, Haim Kaplan, Micha Sharir
An -approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most from each othe…
On Radial Isotropic Position: Theory and Algorithms
Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir
We review the theory of, and develop algorithms for transforming a finite point set in into a set in \emph{radial isotropic position} by a nonsingular linear transforma…