1 research outputs found
Range closest-pair search in higher dimensions
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 structure such that when a query range is specified,
the closest pair in can be reported quickly. RCP search has received
attention over years, but the primary focus was only on . In this
paper, we study RCP search in higher dimensions. We give the first nontrivial
RCP data structures for orthogonal, simplex, halfspace, and ball queries in
for any constant . Furthermore, we prove a conditional lower
bound for orthogonal RCP search for