Range search on tuples of points》.pdfVIP

Journal of Discrete Algorithms 30 (2015) 1–12 Contents lists available at ScienceDirect Journal of Discrete Algorithms /locate/jda Range search on tuples of points Akash Agrawal, Saladi Rahul, Yuan Li, Ravi Janardan ∗ Dept. of Computer Science and Eng., Univ. of Minnesota-Twin Cities, 4-192 Keller Hall, 200 Union St. S.E., Minneapolis, MN 55455, USA a r t i c l e i n f o a b s t r a c t Article history: Range search is a fundamental query-retrieval problem, where the goal is to preprocess Received 2 April 2014 a given set of points so that the points lying inside a query object (e.g., a rectangle, or Received in revised form 20 October 2014 a ball, or a halfspace) can be reported efficiently. This paper considers a new version of Accepted 21 October 2014 the range search problem: Several disjoint sets of points are given along with an ordering Available online 11 November 2014 of the sets. The goal is to preprocess the sets so that for any query point q and a distance Keywords: δ, all the ordered sequences (i.e., tuples) of points can be reported (one per set and Algorithms consistent with the given ordering of the sets) such that, for each tuple, the total distance Data structures traveled starting from q and visiting