4 papers · 1 filter
Range closest-pair search in higher dimensions
Timothy M. Chan, Saladi Rahul, Jie Xue
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set of points into some space-efficient data struct…
Active Learning a Convex Body in Low Dimensions
Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Consider a set of points, and a convex body provided via a separation oracle. The task at hand is to decide for each point of if it is in using…
Searching for the closest-pair in a query translate
Jie Xue, Yuan Li, Saladi Rahul +1
We consider a range-search variant of the closest-pair problem. Let be a fixed shape in the plane. We are interested in storing a given set of points in the plane i…
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
Timothy M. Chan, Yakov Nekrich, Saladi Rahul +1
In this work, we present a collection of new results on two fundamental problems in geometric data structures: orthogonal point location and rectangle stabbing. -We give the first…